5- E. COW) IS£ M .J1C

VI -April-I 0- 156 OW-O Shw' h.l'rG !! CrU.

31 ~~fo

Con. 3670-10. AN-2497

( 3 Hours) [ Total Marks: 100

N.S. : (1) Question NO.1 is compulsory.

(2) Attempt any four questions from Q.Nos. 2 to 7.

(3) Use diagrams wherever necessary.

(4) Assume suitable data wherever required bust justify the same.

1. (a) Write a program in java to implement Binary search. 10

(b) What is Recursion &write a program injava to implement "Towerof HanoL" 10

~

2. (a) Write a java program to implement circular queue using linked list. 10

(b) Construct the binary tree forthe inorder and post order traversal sequences 10

given below.

Inorder

Post Order "INFORMATION"

."INOFMAINOTR"

3. (a) Discuss Threaded binary tree in detail. 10

(b) Write the program in java to perform quick sort. Show the steps with 10

example.

4. (a) Explain Huffman Coding with example. Write a java program to create 14

the binary tree using Huffman Coding for the given characters and their

frequencies. Print the Huffman Code for each character.

(b) Compare Interation and Recursion. 6

5. (a) Write a program in java to sort given n integer number using heap sort. 10

(b) Explain BFS algorithm, explain it by example. 10

6. (a) Write short note on B-Trees and B+-Trees. 10

(b) Hash the following in a table of size 11. Use any two collision resolution 10

techniques :-

23, 0, 52, 61, 78, 33, 10O, 8, 90, 1O, 14.

7. (a)

(b)

(c)

Show with example how graphs are represented in Computer Memory.

Discuss practical application of tress.

Write short notes on :-

(i) AVLTree

(ii) Array Representation of Linked List.

6

4

10

*********