Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Tribhuwan University

Institute of Science and Technology

2074

Bachelor Level / Second Year / Third Semester / Science

B.Sc in Computer Science and Information Technology (CSC211)

(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.
Illustrate the algorithm for Binary search tree with example.[10]
2.
What do you mean by circular list? Differentiate between stack as a circular list and Queue as a circular list.[10]
3.
Explain the procedure for construction of Huffman algorithm with example.[10]
Section B

Short Answers Questions

Attempt any Eight questions.
[8*5=40]
4.
Explain the infix to post fix conversion algorithm. [5]
5.
Explain the Tower of Hanoi (TOH) with practical example. [5]
6.
What do you mean by double linked list? Explain with example. [5]
7.
What are the types of binary tree? Compare between them. [5]
8.
Differentiate between pre-order traversal and in order traversal. [5]
9.
What do you mean by sorting? Explain the Bubble sort with example. [5]
10.
Differentiate between sequential searching and binary searching. [5]
11.
Discuss the Kruskal's algorithm with example. [5]
12.
Differentiate between structure and union. [5]
13.
Describe the Big 'O' notation. [5]