Tribhuvan University

Institute of Science and Technology

2078

Bachelor Level / third-semester / Science

Computer Science and Information Technology( CSC211 )

Data Structure and Algorithm

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

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.

Attempt any TWO Questions (2 x 10 = 20)

1

Define Queue. Write are different applications of queue? Explain queue operations with example.

2

Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.

3

What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.

Attempt any EIGHT Questions (8 x 5 = 40)

4

How do you find complexity of algorithms? Explain

5

Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7

6

What is priority queue? Why do you need this type of queue?

7

Write a recursive program to find nth fibonacci number.

8

Explain array implementation of list.

9

Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.

10

Write a program to implement sequential search algorithm.

11

What is graph traversal? Explain.

12

Write short notes on:

1. Divide and Conquer sorting
2. AVL Tree