BITM 3rd Semester
Data Structure And Algorithms Board Question Paper 2023

TRIBHUVAN UNIVERSITY
FACULTY OF MANAGEMENT
Office of the Dean
September - October 2023
Full Marks:60 Pass Marks:30 Time:3 Hrs.
BIM /
Third Semester /
IT 238:
Data Structure And Algorithms

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

Long Answer Questions
Section "A"

Brief Answer Questions:

[10 × 1 = 10]
1.

Define Asymptotic notations.

2.

Draw a doubly linked list.

3.

Define stack.

4.

What is a priority queue?

5.

What do you mean by tail recursion?

6.

Define a balanced tree.

7.

Define hashing.

8.

What do you mean by degree of a vertex?

9.

List any two sorting algorithms.

10.

Why is Huffman algorithm needed?

Section "B"

Short Answer Questions: (Attempt any FIVE Questions)

[5 × 3 = 15]
11.

Explain Abstract Data Type.

12.

Explain Worst-Case time complexity.

13.

Write a function to traverse a binary tree in Preorder.

14.

Explain different application of queue.

15.

How binary search differs from linear search? Explain.

16.

Explain Breadth First Traversal of a graph.

Section "C"

Long Answer Questions: (Attempt any THREE Questions)

[3 × 5 = 15]
17.

Write an algorithm to find the factorial of n number using recursion.

18.

Define an AVL tree. Construct an AVL tree from the given data: 14, 16, 22, 19, 15, 12, 21.

19.

Sort the given data using quick sort algorithm: 17, 8, 91, 10, 111.

Section "D"

Comprehensive Answer / Case / Situation Analysis Questions:

[2 × 10 = 20]
20.

Draw a minimum spanning tree of the below graph using Kruskal's algorithm:
graph for kruskal algorithm

21.

Write an algorithm to perform insertion and deletion operation in a binary search tree.

22.

Illustrate push and pop operation in stack using linked lists.