Tribhuvan University
Bachelor of Information Technology
Semester 3 · TU Board 2080
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
What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.
Answer comingAlso asked in 2079, 2078
- 2.10
Explain almost complete binary tree with example. How do you insert, search, and delete nodes in a binary search tree? Explain with suitable example?
Answer comingAlso asked in 2083
- 3.10
Discuss the limitation of choosing first element as pivot in quick sort. Using merge sort algorithm, sort the numbers 40, 6, 5,21, 3, 100, 90, 7, 8, 12, 30.
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
Define data type and ADT. What are the benefits of using ADT? Explain
- 5.5
What is space complexity? Explain omega notation with example.
- 6.5
What is circular queue? How can you implement circular queue?
Answer comingAlso asked in 2080, 2078
- 7.5
Define recursion. Explain Tower of Hanoi (TOH) with example.
Answer comingAlso asked in 2078
- 8.5
How can we use linked list to implement queue? Explain.
Answer comingAlso asked in 2080, 2078
- 9.5
What are different applications of binary tree? Explain.
Answer comingAlso asked in 2079, 2078
- 10.5
Why do we need hashing? Explain quadratic probing.
Answer comingAlso asked in 2078
- 11.5
Define spanning tree. Explain minimum spanning tree with example.
Answer comingAlso asked in 2079
- 12.5
Write short notes on: a. Doubly circular linked list b. Breadth first search
Answer comingAlso asked in 2083
— The End —