a) Write an algorithm for traversing nodes in a single linked list? Explain with an example. (Unit 1)

b) Define data structures. Classify different types of data structures. (Unit 1)

a) Compare and contrast the characteristics of arrays and linked lists as abstract data types. (Unit 1)

b) Describe the concept of a dynamic array and how it differs from a static array in terms of memory management and flexibility. (Unit 1)

a) Write an algorithm which reverses the order of elements on stack using one additional stack and some additional variables. (Unit 2)

b) Explain the addition and deletion operations performed on a circular queue with necessary algorithms. (Unit 2)

a) Write an algorithm for Push and Pop operations on Stack using linked list. (Unit 2)

b) What is a DeQueue? Explain its operation with example. (Unit 2)

a) Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). Apply inorder, preorder and postorder traversals on tree. (Unit 3)

b) Create a binary search tree for the following numbers 45, 26, 10, 60, 70, 30, 40. Start from an empty binary search tree. Delete keys 10, 60 and 45 one after the other and show the trees at each stage. (Unit 3)

a) Describe the algorithms used to perform single and double rotation on AVL tree. (Unit 3)

b) Differentiate between Depth first search and Breadth First search algorithm. (Unit 4)

a) Define minimum spanning tree. Write down Prim's algorithm to find minimum spanning tree. (Unit 4)

b) Sort the following elements using quick sort:
55, 72, 12, 45, 88, 38, 27, 33, 91, 80. (Unit 5)

a) Apply Binary search to search 36 in following list:
21, 12, 36, 32, 38, 23, 56, 83, 92, 5, 10, 15 (Unit 5)

b) Write short notes on:
i) Hashing and Indexing (Unit 5)
ii) Heap Sort (Unit 5)
iii) Red Black Tree (Unit 3)