Ernst & Young Senior Engineer Interview Questions and Answers for Experienced

Hacker Rank test with medium difficulty

Q1. Technical discussion mainly around system design, different architectures, problem solving and coding question may be asked.
Add your answer

A case study for a problem statement

Q1. Tell me something about your self?
Ans. 
I am a dedicated and experienced Senior Engineer with a strong background in project management and problem-solving.
• Over 10 years of experience in engineering field

• Expertise in project management and team leadership

• Strong problem-solving skills and attention to detail

• Proficient in various engineering software and tools

• Excellent communication and interpersonal skills
Answered by AI
Add your answer
Q2. Why deloitte? and Us
Ans. 
Deloitte is a global leader in consulting and technology services, offering exciting opportunities for growth and innovation.
• Deloitte is a prestigious global consulting firm known for its innovative solutions and industry expertise

• Deloitte offers a wide range of opportunities for career growth and development

• Deloitte values diversity and inclusion, creating a supportive and collaborative work environment

• Deloitte's focu...read more
Answered by AI
Add your answer

Q1. How you will do a test planning
Ans. 
Test planning involves defining the scope, objectives, resources, and timeline for testing activities.
• Identify the scope of testing, including what features or functionalities need to be tested

• Define the objectives of testing, such as finding defects, ensuring quality, or validating requirements

• Allocate resources for testing, including people, tools, and environments

• Create a timeline for testing activities, including m...read more
Answered by AI
Add your answer
Q2. What are your test startegy
Ans. 
My test strategy involves a combination of manual and automated testing to ensure thorough coverage and timely delivery.
• Utilize a mix of manual and automated testing to cover different aspects of the application

• Prioritize test cases based on risk and impact to focus testing efforts

• Implement continuous integration and continuous deployment practices for faster feedback loops

• Collaborate closely with developers and stakeh...read more
Answered by AI
Add your answer

Q1. Binary search using Java 8
Ans. 
Binary search is a fast search algorithm that finds the position of a target value within a sorted array.
• Ensure the array is sorted before performing binary search.

• Compare the target value with the middle element of the array.

• If the target value is less than the middle element, search the left half of the array. If greater, search the right half.

• Repeat the process until the target value is found or the subarray is empt
Answered by AI
Add your answer
Q2. Merge sort and it's implementation
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges them back together.
• Divide the array into two halves recursively

• Sort each half separately

• Merge the sorted halves back together
Answered by AI
Add your answer