Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Tribhuwan University

Institute of Science and Technology

2078

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.
Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.[10]
2.
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.[10]
3.
Define Queue. Write are different applications of queue? Explain queue operations with example.[10]
Section B

Short Answers Questions

Attempt any Eight questions.
[8*5=40]
4.
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7. [5]
5.
Write a recursive program to find nth fibonacci number. [5]
6.
Explain array implementation of list. [5]
7.
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order. [5]
8.
Write a program to implement sequential search algorithm. [5]
9.
What is graph traversal? Explain. [5]
10.
How do you find complexity of algorithms? Explain. [5]
11.
What is priority queue? Why do you need this type of queue? [5]
12.
Write short notes on: a. Divide and Conquer sorting b. AVL Tree [5]