Tribhuvan University
Bachelor of Information Technology
Semester 3 · TU Board 2079
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
How stack is used in recursion? Explain different stack operations. Explain algorithm to convert an infix expression to postfix using stack.
Answer comingAlso asked in 2080, 2078
- 2.10
Explain complete binary tree with example. Starting with an empty binary search tree, show the effect of successively adding the following elements: 47, 50, 25, 2 7, 17, 61, 5, and 26. Also, traverse the resulting tree in pre-order, in-order, and post-order.
- 3.10
Explain quick sort algorithm. Use this algorithm to sort the numbers 35, 82, 18, 54, 13, 31, 20, 69, and 19.
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
Define ADT. Explain array as an ADT.
- 5.5
What is time complexity? Explain big oh notation with example.
Answer comingAlso asked in 2078
- 6.5
Explain priority queue with example. What is circular queue?
- 7.5
What are the benefits of using recursion? Write a recursive function to find nth Fibonacci number.
- 8.5
Explain singly linked list with example. Compare singly linked list with doubly linked list.
- 9.5
Explain different applications of binary tree.
Answer comingAlso asked in 2080, 2078
- 10.5
Explain collision and collision resolution in hashing. What is double hashing?
- 11.5
Explain adjacency matrix representation of graphs with example.
- 12.5
Write short notes on: a. Linear Search b. Minimum Spanning Tree
Answer comingAlso asked in 2080
— The End —