Imp questions:
1.Explain Min and Max Heap with example? Unit-1
2.What is order in Fibonacci heap? What are Fibonacci heaps used for? Unit-1
3.Explain Leftist tree with an example? Unit-1
4.What is a Binomial Heap? Describe the Properties of Binomial heap. Unit-1
5.Convert Min Heap to Max Heap ? explain with an example briefly. Unit-1
6.What is an example of the mid-square method hashing? Unit-2
7.What is mid square method in hashing with example? Unit-2
8.Define what is a Hash Function? What are the different types of hash functions? Unit-2
9.Explain Collisions? What are the 3 types of collision? Unit-2
10.Illustrate the space complexity of a Hash Table? Unit-2
11.What are the main rules of red-black tree? What is the insertion problem in red-black tree? Unit-
3
12.What is an AVL tree explain the balancing methods of an AVL tree with an example? Unit-3
13.Define the splay tree explain with an example? Unit-3
14.What is a B Tree?what are the operations of B tree. Unit-3
15.What is heap Short strategy ? Prove that heap short requires O(n log n) time. Also compare binary
and binomial heap. Unit-3
16.What is a Binary Tree? Explain the preorder, in order and post order Traversals? Write the code
for Binary Tree Insertion. Unit-3
17.Write an algorithm for a binary search technique and explain it with the help of an example.Unit3
18.What is a digital search Tree in Data Structures?What distinguishes a DST from other trees? Unit-4
19.What is a priority queue ADT and explain the insertion & deletion operations on a priority queue
with an example. Unit-4
Topics to be covered:
OBST, 2-3trees, Binary tries and Partricia, Multiway tries, suffix trees, standard tries, compressed
tries, introduction to pattern matching, brute force, the boyer-moore algorithm, knuth- morris pratt
algorithm, naïve string, harspool, rabin karp
