a) Describe the difference between an abstract data type specification and implementation. (Unit 1)

b) How is a two dimensional array represented in memory? Calculate amount memory required to store this array and the accessing function for it. (Unit 1)

a) Give the implementation of circular linked list. Also give its application. (Unit 1)

b) Discuss various classification of data structures with an example. (Unit 1)

a) What is Stack? Why it is known of LIFO? Write algorithm of PUSH, POP and CHANGE operation on stack. (Unit 2)

b) Write a ‘C’ program to convert the infix expression to postfix expression. (Unit 2)

a) Differentiate between the stack and queue. (Unit 2)

b) What are circular queue and priority queue? Write an algorithm in insert and delete an element from a circular queue. (Unit 2)

a) Explain Red black trees also discuss the properties of red black tree. (Unit 3)

b) Construct an AVL search tree by inserting the following elements in order of their occurrence.
64, 1, 44, 26, 13, 110, 98, 85 (Unit 3)

a) Explain Dijkstra algorithm with the help of example. (Unit 4)

b) Write a C function to create the adjacency list representation of a graph, given its adjacency matrix representation. (Unit 4)

a) Write a Heap sort algorithm. Use Heap sort algorithm to sort the following element.
12, 3, 9, 14, 10, 18, 8, 23 (Unit 5)

b) What are hash function? Write down various popular hash function with example. (Unit 5)

Write short notes on (any three):
i) B-tree (Unit 3)
ii) Indexing (Unit 5)
iii) Postfix evaluation (Unit 2)
iv) Shell sort (Unit 5)
v) Prim’s algorithm (Unit 4)