Round 1: 25 MCQ questions (14 Aptitude + 11 Electronics) on HackerRank.

Interviews: Round 2: Technical (OS, C pointers, memory layout, BST) Round 3: Technical (C, C++, OOPs, trees) Round 4: Technical and HR (Introduce yourself, OOPs, puzzles, hobbies, etc.).

They didn't ask me about my project, but they did for others.

Out of 80 candidates, only 18 made it to Round 2. After Round 2, only 10 remained. For the final round, 7 were selected. Finally, they hired 4.

Do basic aptitude; you will make it through Round 1. Simple questions on trains, age, time, etc.

Round 1

1. Find element in a BST with and without recursion.
2. Given a 2D array, what will be the output? (Printf("%d",(**((array+0)+1)))) - The answer is the second element in that array.
3. Paging, virtual memory, page fault.
4. If my PC has RAM of 2GB and I want to play a game which is of 10GBs, will it run on my PC? Yes, it will run, using the paging concept and virtual memory.

Round 2

1. Introduce yourself.
2. Difference between overloading and overriding.
3. Virtual function, and explain with an example.
4. Pure virtual function.
5. What methods are invoked when you initialize an object? Default constructor, destructor, copy constructor...
6. Print a binary tree from leaf to root.
7. Find an element in a generic tree.

Round 3

1. Introduce yourself.
2. What is polymorphism and its types?
3. Give examples of overloading and overriding.
4. Hobbies.
5. After 5 years, where do you see yourself?
6. Puzzle: You have two jars of 3 and 5 liters. Fill the 5-liter jar with 4 liters of water. Add 3 liters to the 5-liter jar again. Now you have 3 liters in the 5-liter jar. Again, try to completely fill the 5-liter jar with the 3-liter jar, and when it is completely filled, you will have 1 liter in the 3-liter jar. Now, empty the 5-liter jar and fill it with 1 liter from the 3-liter jar. Finally, add 3 liters to the 5-liter jar. Now you have 4 liters in one jar.