Full Marks: 60
Pass Marks: 24
Time: 3 hours

Attempt any two questions: (2 x 10 = 20)

1. Define Queue as an ADT. Write a program for basic operations in Linear queue in array implementation.
2. Why recursion is required? Explain with Tower-of-Hanoi example. How recursive algorithm makes program effective? Write the merits and demerits of recursion in Programming.
3. Explain In-fix to Postfix Conversion Algorithm. Illustrate it with an example. What changes should be made for converting postfix to prefix.

Attempt any eight questions: (8 x 5 = 40)

4. Explain Kruskal’s algorithm with example.
5. Write a program in C for bubble sorting.
6. Differentiate between contiguous list and linked list with examples.
7. Explain binary search. Illustrate it with example.
8. Explain hashing with example.
9. Explain why linked list is called dynamic list? Write the algorithm for deleting a new node before a node.
10. Explain the characteristics of Huffman’s algorithm and its application.
11. Write merits and demerits of recursive function over non-recursive function.
12. Write the steps involved in deleting a node in a Binary selection tree.
13. Discuss merge sort. How you rate this sorting from selection sort?