Data Structures and Algorithms 2078

Section A
Long Answer Questions
Attempt any TWO questions. [2 × 10 = 20]

1. Explain algorithm to convert an infix expression to postfix using stack? Use this algorithm to convert (A+B)*C-D to postfix. [10]

2. Explain merge sort along with its time complexity. Use this algorithm to sort array of numbers given below:
25, 37, 48, 25, 23, 17, 31, 45, 7, 21, 15, 8, 11 [10]

3. What is shortest path algorithm? Use Dijkstra's algorithm to find shortest path between the vertices of a and z in the graph given below. [10]

Section B
Short Answer Questions
Attempt any EIGHT questions. [8 × 5 = 40]

4. What is data Structure? Explain an array as an abstract data type. [5]

5. Explain big oh(O) notation with suitable example. [5]

6. Define priority queue. How do you implement priority queue? Explain. [5]

7. Define recursion. Explain Tower of Hanoi algorithm in detail. [5]

8. How can you implement queue using linked list? Explain. [5]

9. What is binary tree? Explain different application of binary tree. [5]

10. Explain sequential search. How is it different from binary search? [5]

11. Define hashing. Explain quadratic probing with example. [5]

12. What is graph traversal? Explain breadth first search. [5]