BIT 3rd Semester
Data Structure and Algorithms Board Question Paper 2083

Views: ...
BIT 201-2083 ✡

Tribhuvan University

Institute of Science and Technology

TUpapers.com TUpapers.com
Bachelor Level/Second Year/Third Semester/Science
Bachelors in Information Technology (BIT 201)
(Data Structure and Algorithms)
Full Marks: 60 Pass Marks: 24 Time: 3 hours

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

Section A
Long Answer Questions
Attempt any Two questions.
[2x10=20]
1.

Define hash function. Discuss the types of graph. Explain the working mechanism of BFS.

2.

Make a comparison between quick sort and merge sort.

3.

What is balanced tree? How do you insert and delete a node in a Binary Search Tree? Explain.

Section B

Attempt any Eight questions

[8×5=40]
4.

Describe the merits and demerits of sequential search over binary search.

5.

Define level, height and depth of a tree with example.

6.

Differentiate between static and dynamic list structure.

7.

How do you insert a node at nth position in singly linked list? Explain.

8.

Differentiate between doubly linked list and doubly circular linked list.

9.

Write a recursive program to generate the Fibonacci series.

10.

List the advantages and disadvantages of linear queue.

11.

Define stack. Evaluate + * 3 4 2 using stack.

12.

What is structure? Discuss about time and space complexities.