On the very next day, 6th June, it was time for SERC interview. There was also a small written test followed by the interview. Here they selected candidates based on their performance in written, unlike CSA.
In the written exam, there were 8 questions among which 5 were to be attempted in 30mins. Very basic questions were there, but little tougher, rather more lengthy, than the CSA warm up. Questions were like,
1. Form a binary search tree with the elements of an array given
2. Probability problems (Bayes theorem)
3. Fill in the blanks in a linked list reversal pseudo code. Was to place the pointers properly.
… I could attempt only 4, but got selected for the interview.
Here also we had to give our lab preference, in which all lab we would like to work and interview questions were supposed to be in accordance with that. This time the interview started with data structure by default.
- Draw an arbit binary tree
- Represent it using an array (with out caring about wastage of memory)
- postfix and prefix notation
- can construct the tree back?
- why not?
- With infix? why?
- made it a expression tree. Now why with postfix we can evaluate?
- draw a 4*4 grid. In how many ways one can come from (0,0) to (4,4)?
So, it finished within 30 minutes and I realized in interview confidence and faith on yourself really matters, specially comparing with the last day’s one.