Tribhuvan University
Bachelor of Information Technology Management
Semester 3 · TU Board 2023
Course Title: Data Structure And Algorithms (IT238)
Full Marks: 60Pass Marks: 30Time: 3 Hrs
Candidates are required to give their answers in their own words as for as practicable.
Group A
Brief Answer Questions(10 × 1 = 10)
- 1.1
Define Asymptotic notations.
- 2.1
Draw a doubly linked list.
- 3.1
Define stack.
- 4.1
What is a priority queue?
- 5.1
What do you mean by tail recursion?
- 6.1
Define a balanced tree.
- 7.1
Define hashing.
- 8.1
What do you mean by degree of a vertex?
- 9.1
List any two sorting algorithms.
- 10.1
Why is Huffman algorithm needed?
Group B
Short Answer Questions: (Attempt any FIVE Questions)(5 × 3 = 15)
- 11.3
Explain Abstract Data Type.
- 12.3
Explain Worst-Case time complexity.
- 13.3
Write a function to traverse a binary tree in Preorder.
- 14.3
Explain different application of queue.
- 15.3
How binary search differs from linear search? Explain.
- 16.3
Explain Breadth First Traversal of a graph.
Group C
Long Answer Questions: (Attempt any THREE Questions)(3 × 5 = 15)
- 17.5
Write an algorithm to find the factorial of n number using recursion.
- 18.5
Define an AVL tree. Construct an AVL tree from the given data: 14, 16, 22, 19, 15, 12, 21.
- 19.5
Sort the given data using quick sort algorithm: 17, 8, 91, 10, 111.
Group D
Comprehensive Answer / Case / Situation Analysis Questions(2 × 10 = 20)
- 20.10
Draw a minimum spanning tree of the below graph using Kruskal's algorithm: [figure in the original paper]
- 21.10
Write an algorithm to perform insertion and deletion operation in a binary search tree.
- 22.10
Illustrate push and pop operation in stack using linked lists.
— The End —