a) What is Abstract data type? Explain with the help of example. (Unit 1)

b) Differentiate array and linked list. (Unit 1)

a) Draw an AVL tree on following inputs, assume that tree is initially empty: (Unit 3)

485, 575, 655, 745, 830, 910, 100, 110, 520, 130, 340, 450, 365, 525, 204, 155, 130, 35

b) Compare and Contrast the Spanning tree and Minimum Spanning Tree. (Unit 4)

a) What do you mean by an algorithm? Write the criteria and characteristics of an algorithm. (Unit 1)

b) Demonstrate the efficiency of an algorithm. (Unit 1)

a) Write an algorithm to convert infix expression into postfix form using Stack. Also evaluate the given postfix form using stack: (Unit 2)

$2 \ 3 \ 9 \ * \ + \ 2 \ 3 \ \hat{} \ - \ 6 \ 2 \ / \ +$

b) Write a program in ‘C’ to implementation of QUEUE. (Unit 2)

a) What are the differences between: (Unit 3)

i) Height and depth

ii) Order and degree

b) Show that the maximum number of nodes in a binary tree of height h is $2^{h+1}-1$. (Unit 3)

a) What are sparse matrices? Explain the representation of the Sparse matrix. Also, demonstrate the upper triangle and lower triangular sparse matrices. Suggest a space efficient representation for sparse matrices and determine the address determination formulas for it. (Unit 1)

b) Write a note on Compaction, overflow, and Underflow in Array term. (Unit 1)

a) What is HashMap in data structure? How does HashMap handle collisions? Explain with C or Java. (Unit 5)

b) Demonstrate LRU Algorithm. Which data structure uses LRU algorithm. (Unit 5)

a) Draw the directed graph that corresponds to the following adjacency matrix. (Unit 4)

b) Explore all types of operations that can be performed on a linked list. (Unit 1)