Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Tribhuwan University

Institute of Science and Technology

2080

Bachelor Level / Second Year / Third Semester / Science

Bachelors in Information Technology (BIT201)

(Data Structures 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 Answers Questions

Attempt any TWO questions.
[2*10=20]
1.
What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.[10]
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?[10]
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.[10]
Section B

Short Answers Questions

Attempt any Eight questions.
[8*5=40]
4.
Define data type and ADT. What are the benefits of using ADT? Explain [5]
5.
What is space complexity? Explain omega notation with example. [5]
6.
What is circular queue? How can you implement circular queue? [5]
7.
Define recursion. Explain Tower of Hanoi (TOH) with example. [5]
8.
How can we use linked list to implement queue? Explain. [5]
9.
What are different applications of binary tree? Explain. [5]
10.
Why do we need hashing? Explain quadratic probing. [5]
11.
Define spanning tree. Explain minimum spanning tree with example. [5]
12.
Write short notes on a.) Doubly circular linked list Write short notes on b.) Breadth first Search [2.5+2.5]