interview:(There were 3 male professors and 1 madam) .
They directly asked to take marker and start with the whiteboard.
1. find the maximum and minimum height of the bst given number of nodes.
2. write heapify procedure for heap.
3. write code to find the second largest element in the array.
4. prove the divisibility test for 3.
5 a question from null space which i didn't know.
6.given a tree(which might not be complete binary tree) write a storage mechanism to minimize space wastage.
In written test there were 2 marks question on programming where you need to find whether there is an error in program if there is an error then correct that line else give justification(easy).
there were multiple option correct question on linear algebra, mostly vector space which were tough for me.(1 mark each).