Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Tribhuwan University

Institute of Science and Technology

2079

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.
How stack is used in recursion? Explain different stack operations. Explain algorithm to convert an infix expression to postfix using stack.[10]
2.
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, 27, 17, 61, 5, and 26. Also, traverse the resulting tree in pre-order, in-order, and post-order.[5]
3.
Explain quick sort algorithm. Use this algorithm to sort the numbers 35, 82, 18, 54, 13, 31, 20, 69, and 19.[10]
Section B

Short Answers Questions

Attempt any Eight questions.
[8*5=40]
4.
Define ADT. Explain array as an ADT. [5]
5.
What is time complexity? Explain big oh notation with example. [5]
6.
Explain priority queue with example. What is circular queue? [5]
7.
What are the benefits of using recursion? Write a recursive function to find nth Fibonacci number. [5]
8.
Explain singly linked list with example. Compare singly linked list with doubly linked list. [5]
9.
Explain different applications of binary tree. [5]
10.
Explain collision and collision resolution in hashing. What is double hashing? [5]
11.
Explain adjacency matrix representation of graphs with example. [5]
12.
Write short notes on: a) Linear Search Write short notes on: b) Minimum Spanning Tree [2.5+2.5]