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

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

a) What is the application of linked list. And also write the algorithm how to add two polynomials using linked list. (Unit 1)

b) Write a program in C to insert a node at any specified position in doubly linked list. (Unit 1)

a) What is the difference between data and information? Give one example of each. (Unit 1)

b) How to represent 2-D array in memory? Explain with the help of example. (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) Construct the steps to configure a B-tree of order 5 for the following data: (Unit 3)

78, 21, 11, 97, 85, 74, 63, 45, 42, 57, 20, 16, 19, 32, 30, 31.

b) Explain Dijkstra Algorithm with the help of example. (Unit 4)

a) Write a Heap sort algorithm. Use Heap sort algorithm to sort the following element: (Unit 5)

D A T A S T R U C T U R E S

b) Differentiate internal sorting and external sorting. Also enlists the name of two sorting techniques of each. (Unit 5)

a) Binary search is more efficient than Linear search. Justify your answer. (Unit 5)

b) Write short note on Hashing and Indexing. (Unit 5)