Odessa Interview Questions and Answers for Freshers

Technical MCQ and Programing

Only one question was asked but it was written test
question:
coin denomination program

Q1. Tell me about yourself?
Add your answer
Q2. Best sorting algorithm and why and explain the logic
Ans. 
The best sorting algorithm is QuickSort due to its average case time complexity of O(nlogn) and low memory usage.
• QuickSort is a divide and conquer algorithm that recursively partitions the array into smaller subarrays and sorts them.

• It has an average case time complexity of O(nlogn) and a worst case time complexity of O(n^2).

• QuickSort has low memory usage as it sorts the array in place, without requiring additional mem...read more
Answered by AI
Add your answer
Q3. OOPS,DBMS,DS basic concepts
Add your answer
Q4. Real life example of stack and queue
Ans. 
Stack and queue are data structures used to store and retrieve data in a specific order.
• Stack: undo/redo functionality in text editors, back button in web browsers

• Queue: printing jobs in a printer, waiting list for a ride at an amusement park
Answered by AI
Add your answer
Q5. Basic sql query and normalisation techniques
Add your answer

The first round is a online test

1 question is given to solve , easy one

Two coding questions were asked and some 20-30 MCQs were present. 1 coding question was of moderate level and 1 was a bit standard question. One of them was string based and other one was DP based.

Q1. 1 hr long technical interview(questions revolved around my CV). I was asked questions from DSA,DBMS,OS as well as networking as these were mentioned in my CV. I was asked to briefly explain what my project...read more
Add your answer

Q1. Second technical interview - I was asked to code in an editor, one of them was a moderately easy question based on string where I had to remove all consecutive vowels from a string. The other question was ...read more
Add your answer