Written Round

Written Round Comprised of 3 Questions where Time Complexity was one of the
important performance criteria.
First Question
Given: Linked list with next and random pointers.
Question: Create a copy of given linked list.
Second Question
Given: Array of Structures of the form
Struct Parent_Child
{ int parent_value;
int child_value;
}ob[n];
Question: Create a binary tree.
Second Question
Given: Array with the condition A[i]=parent of i and also, A[i] with value -1 is root.
Problem: Construct Binary Tree

Interview Round
Round 1:
It was mainly based on my resume.
Questions related to projects that I have done were asked.
Since I specified Java as one the known languages, Questions were put forward
from that also.
Rest of the Questions were from DS and Algo
Find least common ancestor
What is the difference b/w b & b+ tree
Level order traversal
Sorting Techniques

Round 2:
 NP and NP hard Problem
Numerical analysis: what is newton raphson method etc.
Analysis (Running Time) of algo
Discussion of Written Round Questions.
Stacks and Queues
Mini-DBMS project from resume