Professional Documents
Culture Documents
Old QP
Old QP
Old QP
Q: ( Write a recursive pseudo code for Preorder and In Order traversal of a binary [04
2 A Search tree. ]
)
( Construct the open hash table (separate chaining) and closed hash table (open [06
B addressing – use linear probing) for the input: 32, 20, 56, 77, 40, 81, 63, 76, 37, ]
) 90 using the hash function h(k) = k mod 10. Explain each step in detail.
Q: ( What is Skip list? Write pseudo code for inserting a node in skip list. [05
3 A ]
)
( Insert the following letters into an empty B-tree of order 5: [05
B CNGAHEKQMFWLTZDPRXYS ]
)
OR
( What is K-D Tree? Create K-D Tree for inserting (3, 6), (17, 15), (13, 15), (6, [05
B 12), (9, 1), (2, 7), (10, 19) values. Delete (13, 15) and (2, 7). Draw tree after each ]
) operation.
Q: ( Which data structures can be used for 1-D Range searching? Explain any one [05
4 A with suitable example. ]
)
( What are tries? Generate tries for the following keys. [05
B banana, ban, banner, ball, basket ]
)
OR
( Write a pseudo code to delete a key from trie [05
B ]
)
Page 1 of 2
( Construct a priority search tree for the point set of given below: [05
B {(1, 2), (4, 10), (14, 3), (6, 6), (3, 15), (2, 2), (3, 12), (9, 4), (12, 14)}. ]
)
Page 2 of 2