Tribhuvan University
Bachelor of Information Technology
Semester 3 · TU Board 2083
Course Title: Data Structure and Algorithms (BIT201)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
Group A
Attempt any Two questions.(2 × 10 = 20)
- 1.10
Define hash function. Discuss the types of graph. Explain the working mechanism of BFS.
- 2.10
Make a comparison between quick sort and merge sort.
- 3.10
What is balanced tree? How do you insert and delete a node in a Binary Search Tree? Explain.
Answer comingAlso asked in 2080
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
Describe the merits and demerits of sequential search over binary search.
- 5.5
Define level, height and depth of a tree with example.
- 6.5
Differentiate between static and dynamic list structure.
- 7.5
How do you insert a node at n^th position in singly linked list? Explain.
- 8.5
Differentiate between doubly linked list and doubly circular linked list.
Answer comingAlso asked in 2080
- 9.5
Write a recursive program to generate the Fibonacci series.
- 10.5
List the advantages and disadvantages of linear queue.
- 11.5
Define stack. Evaluate + * 3 4 2 using stack.
- 12.5
What is structure? Discuss about time and space complexities.
— The End —