Round II(F2F-technical) They shortlisted around 60 students for the second round. Second round was 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 datastructure questions: Name any some of the data structures you know – I told linked lists, stacks, queues and trees, etc He started with Linked list and asked code for reversal of 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 comparision of different search algorithms Then, he moved onto Trees What is balancing of a tree?How to do it? What is AVL tree?(He asked to explain and made me to balance an AVL tree as well as write a code for it) Types of trees.
Sigiloso
Round III(F2F-technical) This time I wasn’t so lucky and I bumped into a CSE background guy : ( .Though, he asked some tricky questions, I was able to answer most of them. Operating Systems: What are the different types of OS. Do you know RTOS? What are its types? How do you implement RTOS? How to achieve zero error rate in Hard RTOS? What is semaphore? What is a monitor? Difference between them