2011 Tejas Networks Placement Papers:
1. Preorder of A*(B+C)/D-G
Ans.*+ABC/-DG
2. B-tree (failure nodes at same level)
3. Dense index (index record appears for every search -key in file)
4. What is the efficiency of merge sort
Ans. O(n log n)
5.A program on swapping ( 10,5 )was given
Click Here
1. Preorder of A*(B+C)/D-G
Ans.*+ABC/-DG
2. B-tree (failure nodes at same level)
3. Dense index (index record appears for every search -key in file)
4. What is the efficiency of merge sort
Ans. O(n log n)
5.A program on swapping ( 10,5 )was given
Click Here
No comments:
Post a Comment