Tribhuvan University
Bachelor of Information Technology
Semester 3 · TU Board 2078
Course Title: Data Structure and Algorithms (BIT201)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
Group A
Attempt any Two questions.(2 × 10 = 20)
- 1.10
Explain algorithm to convert an infix expression to postfix using stack? Use this algorithm to convert (A+B)*C-D to postfix.
Answer comingAlso asked in 2080, 2079
- 2.10
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
- 3.10
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. [figure in the original paper]
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
What is data Structure? Explain an array as an abstract data type.
- 5.5
Explain big oh(O) notation with suitable example.
Answer comingAlso asked in 2079
- 6.5
Define priority queue. How do you implement priority queue? Explain.
Answer comingAlso asked in 2080, 2078
- 7.5
Define recursion. Explain Tower of Hanoi algorithm in detail.
Answer comingAlso asked in 2080
- 8.5
How can you implement queue using linked list? Explain.
Answer comingAlso asked in 2080, 2078
- 9.5
What is binary tree? Explain different application of binary tree.
Answer comingAlso asked in 2080, 2079
- 10.5
Explain sequential search. How is it different from binary search?
- 11.5
Define hashing. Explain quadratic probing with example.
Answer comingAlso asked in 2080
- 12.5
What is graph traversal? Explain breadth first search.
— The End —