Ernst & Young ODI Developer Interview Questions and Answers

Q1. MULTIPLE QUESTIONS OF OOPS
Add your answer
Q2. Program of prime number
Ans. 
A program to find prime numbers within a given range
• Iterate through numbers in the given range

• Check if each number is divisible by any number other than 1 and itself

• If not divisible, it is a prime number
Answered by AI
Add your answer
Q3. Pseudo code of finding ones in a number
Ans. 
Count the number of ones in a given number using pseudo code
• Initialize a count variable to 0

• Iterate through each bit of the number and check if it is 1

• Increment the count if the bit is 1

• Return the count as the result
Answered by AI
Add your answer
Q4. Basic questions of sql and mongodb
Add your answer

Q1. Fir arrow function This keyword Promises Promise chain Generator function Rest operator Spread operator React hooks Higher order component Redux life cycle Palindrome string code Fibonacci code
Add your answer

Just asked to expand on past experiences and what technologies i had experience with.

Q1. Too much focus on theory questions. Like how would you link multiple middleware - write code for that
Add your answer

Aptitude test with different sections. Each section had its own time limit. Level - Moderate to difficult

Q1. Introduce yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java and Python programming languages

• Proficient in web development technologies like HTML, CSS, and JavaScript

• Currently pursuing a degree in Computer Science
Answered by AI
Add your answer
Q2. Resume projects
Add your answer
Q3. 2 DSA questions
Add your answer
Q4. One SQL Query question
Add your answer

Q1. What is Hash map? What app did you build How do u maintain app life cycle
Ans. 
A hash map is a data structure that allows for efficient storage and retrieval of key-value pairs.
• A hash map uses a hash function to convert keys into array indices.

• It provides constant-time average case complexity for insertion, deletion, and retrieval operations.

• Hash maps are commonly used in programming languages and databases for fast data access.

• Example: HashMap map = new HashMap<>();

• map.put("appl
Answered by AI
Add your answer