problem 1: Describe the difference between single linked list and double linked list. Describe about different operations performed on double linked list.

problem 2: What do you mean by queue? How do you represent a queue by using linked list? Describe about different kinds of queues.

problem 3: What do you mean by height balanced binary tree? Describe in detail about AVL rotations.

problem 4: prepare the heap sort algorithm. Construct a heap tree for the numbers 23, 22, 8, 20, 18, 25, 11, 20, 12, 14, 17 and then trace the heap sort algorithm.

problem 5: What do you mean by spanning tree? Describe Prim’s algorithm with an illustration.

problem 6: Describe about the overview of data structures.

problem 7: What do you mean by stack? Describe about the stack operations.

problem 8: Describe about different hashing methods.

problem 9: Define the term binary tree. Describe how you represent a binary tree.

problem 10: Define the term B Tree. prepare about B Tree indexing.