There were four rounds of interviews: 1st - written test, 2nd and 3rd - technical interviews, 4th - HR interview.

Round I

This round had 60 multiple-choice questions (20 general aptitude, 20 technical, 20 again technical based on either communication, electronics, or computer science). The technical questions were a bit easy, and the aptitude questions took time to solve.

Round II (F2F-technical)

They shortlisted around 60 students for the second round. The second round was a technical F2F. I was lucky to have a panel member from ECE, and he didn’t know much about Data Structures (I’m from IT :-P). So, he asked some basic data structure questions:

• Name some data structures you know – I told linked lists, stacks, queues, and trees, etc.
• He started with Linked Lists and asked for the code for reversal of a linked list.
• Deleting a particular node in a Circular Linked List.
• Binary Search logic and its code.
• Any other search algorithms he asked, and I said Linear search, etc.
• Time complexity comparison of different search algorithms.

Then, he moved onto Trees:

• What is balancing of a tree? How to do it?
• What is an AVL tree? (He asked me to explain and made me balance an AVL tree as well as write a code for it).
• Types of trees.

C/C++:

First, the question was, "How do you rate your knowledge in C/C++?" I told him 8-9 out of 10. So, he started asking.

• Difference between Macro and Inline?
• What is the new thing you learned about C/C++? (I told him how to calculate sizeof without using the sizeof() operator).
• What’s the silliest mistake you’ve done, and after recognizing the mistake, you thought, "Ohh!!! This simple mistake I made??"
• Structure Padding question:

cpp struct temp{ int a; char b; int c; }

What is the sizeof this structure? Answer: 12 (not 9 because of structure padding).