a) Explain the classification of data structures in detail. (Unit 1)

b) Define Abstract Data Types (ADT). Explain the different operations performed on data structures and describe the criteria for cost estimation. (Unit 1)

a) Describe the memory representation of a Singly Linked List. Write an algorithm to insert a node at a specific position in a linked list. (Unit 1)

b) Define Stack as an ADT. Explain the array and linked list implementation of stacks. (Unit 2)

a) Explain the algorithm to convert an Infix expression to a Postfix notation using a stack. (Unit 2)

b) Explain the concept of Queue simulation with a real-world example. (Unit 2)

a) Define a Binary Search Tree (BST). Explain the algorithms for In-order, Pre-order, and Post-order traversal with an example. (Unit 3)

b) What are AVL Trees? Explain the four types of rotations (LL, RR, LR, RL) used to balance an AVL tree. (Unit 3)

a) Define the following tree terminologies: Height, Depth, Degree of a node, and Forest. (Unit 3)

b) Explain the Adjacency Matrix and Adjacency List representations of a graph. (Unit 4)

a) Describe the Depth First Search (DFS) and Breadth First Search (BFS) algorithms for graph traversal with examples. (Unit 4)

b) What is a Minimum Spanning Tree (MST)? Explain Kruskal's or Prim's algorithm to find the MST of a weighted graph. (Unit 4)

a) Explain the Quick Sort algorithm with suitable example. (Unit 5)

b) Explain Binary Search with an example. (Unit 5)

Write short notes on any Two:

(a) Circular Linked Lists (Unit 1)

(b) Linear Probing and Chaining (Unit 5)

(c) B+ Trees (Unit 3)

(d) Dijkstra's shortest path algorithm (Unit 4)