BIT 3rd Semester
Data Structure and Algorithms Board Question Paper 2080

Views: ...
BIT 201-2080 ✡
Tribhuvan University
Institute of Science and Technology
2080
✡
Bachelor Level/Second Year/Third Semester/Science
Bachelors in Information Technology (BIT 201)
(Data Structure and Algorithms)
Full Marks:60 Pass Marks:24 Time:3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks

Section A
Long Answer Questions
Attempt any Two question.
[2x10=20]
1.

What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.

2.

Explain almost complete binary tree with example. How do you insert, search, and delete nodes in a binary search tree? Explain with suitable example?

3.

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.

Section B

Attempt any Eight questions

[8x5=40]
4.

Define data type and ADT. What are the benefits of using ADT? Explain

5.

What is space complexity? Explain omega notation with example.

6.

What is circular queue? How can you implement circular queue?

7.

Define recursion. Explain Tower of Hanoi (TOH) with example.

8.

How can we use linked list to implement queue? Explain.

9.

What are different applications of binary tree? Explain.

10.

Why do we need hashing? Explain quadratic probing.

11.

Define spanning tree. Explain minimum spanning tree with example.

12.

Write short notes on:
a. Doubly circular linked list
b. Breadth first search