Interview Experience 16 (Intern)

For this company, apart from data structures you need a good knowledge of OOPs concepts, OS , DBMS and networking. They may ask you anything from these topics. ##Round 1:

• How to determine height of a binary search tree.

• Check if a binary tree is a BST or not.

• Given an array of both negative and positive integers, you need to rearrange the array such that positive and negative numbers alternate. Also, the order should be same as previous array and only O(1) auxiliary space can be used and time complexity boundation O(n). eg. -2 3 4 5 -1 -6 7 9 1 result – 3 -2 4 -1 5 -6 7 9 1.

• Some more basic questions from trees and linked list were asked.

##Round 2: This round consisted of a mixed bag of questions.

• It started with Tell me about your yourself.
• There was a discussion on my summer project.
• Then some SQL queries were asked.
• Some data structure questions were also asked like:
  • How to detect loop in a linked list. and some more common ones.
  • After that there a discussion on Cache page replacement algorithms, which is the most efficient one, how to reduce the overhead.
  • And Lastly basic oops concepts.