Vidyalankar

S.E. Sem. III [CMPN]

Data Structure and Files
Time : 3 Hrs.] Prelim Question Paper [Marks : 100

N.B. : (1) Question No. 1 is compulsory.

(2) Attempt any four from remaining six.
(3) Figures to the right indicate full marks.

1. (a) What is recursion? Write a program in Java to implement “Tower of Hanoi” problem ? [10]
(b) What is meant by Data structures? Explain types of data structures. [10]

2. (a) What is Hashing? Explain any four hash functions. [10]

(b) Design and implement the selection sort algorithm to sort a given set of randomly ordered n [10]
numbers.

3. (a) Write a program to convert an expression from infix to postfix using stack. [10]
(b) Write a program to implement Queue using array. [10]

4. (a) What is Queue? Write algorithm for Queue implementation. [5]

(b) Write note on Priority Queue. [5]
(c) Write a program to implement insertion and deletion in priority queue. [10]

5. (a) Write note on array representation of Linked List and write the program for the same. [12]
(b) Write a program in Java to reverse a given linked list. [8]

6. (a) A binary tree T has 9 nodes. The INORDER and PREORDER traversals of T yields the [10]
following sequences of nodes :
INORDER : E A C K F H D B G
PREORDER : F A E K C D H G B
Draw the tree, also define inorder and preorder traversal.
(b) Write difference between B and B+ tree. [4]
(c) Write short notes on AVL tree. [6]

7. (a) (i) Explain threaded binary tree. [10]

(ii) Explain method of Huffman coding.
(b) What is a graph? Write a program in Java to implement DFS traversal of graph. [10]

