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

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

1. What is stack? How is it different from queue? Write a program to implement all stack operations.
2. What is linked list? Explain the process of inserting and removing nodes from a linked list.
3. What is graph traversal? Discuss depth-first traversal technique with suitable example.

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

4. Discuss array as an ADT.
5. Transform the postfix expression AB − C + DEF − + $ to infix.
6. What is recursion? Write a recursive program to find factorial of a number.
7. Explain almost complete binary tree with example.
8. Write a program to sort an array using selection sort.
9. Discuss binary search technique along with its efficiency.
10. Why do we need Hashing? Discuss linear probing in detail.
11. How to find complexity of algorithms? Explain.
12. Hand test the insertion sort algorithm with following array of numbers.
    16 7 31 2 9 41 -10
13. Write short notes on:
    • a. Tree traversal
    • b. Circular queue