Package: - 6.5 lpa
1st Round: Time: - 40 Minutes
There was total 20 objective questions form C/C++ and OS. Questions was Easy and medium level. Those who have solved 16+ correct questions cracked first round. There is no –ve Marking.
2nd Round (Technical): Time: - 1 hr 40 minutes
Q1. Given a sorted array having duplicate elements,how would you find first index of a given element in O(logn). After that they have changed quetion to find the last index of a given element in O(logn)
Q2. You have a dictionary of words. Given a word, print all anagram are in dictionary . State the data structure to be used to solve this problem.
Q3. Discussion about my project.
Q4. oop s concept (polymorphism , encapsulation , virtual function…etc)
Q5. What is Hashing? Different Hashing techniques. How hashing is implemented internally in C++ STL Library.
Q6. What is Depth first Search (DFS) and (BFS)? Write Code?
Q7. difference between cluster index or non cluster index.
Q8. difference between mutex and semaphore.
3rd Round (Technical): Time:- 1 hr 10 minutes
Q1. U have given 10 million unsorted integer , physical memory have size of 1 million suggest method to sort 10 million integer efficiently.
Q2. given two tree , write a code to findout , they r identical or not .
Q3. some questions on my project.
Q4. inorder treversal of tree , without any extra space.
Q5. some discussion on process n thread.
Q7. ACID property.
Q8.normal form up to bcnf.
4th Round (HR + Technical): Time: - 1 hour
5th Round (Telephonic HR Round): Time: - 56 Minutes
After a long waiting , result came , five got selected , n I was in five .