CSIT 3rd Semester
Data Structure And Algorithms Board Question Paper 2081 Old Course

CSC 211-2081 ✡
Tribhuvan University
Institute of Science and Technology
2081
✡
Bachelor Level/Second Year/Third Semester/Science
Computer Science Information Technology (CSC 211)
(Data Structure And Algorithms)
(Old Course)
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 Answer Questions
Attempt any Two question.
[2x10=20]
1.

Explain stack as an ADT. Explain algorithm to convert an infix expression to postfix using stack? Use this algorithm to convert (A+B) * (C–D) to postfix expression.

2.

What is linked list? Compare singly linked list with doubly linked list. How do you insert and delete nodes in a singly linked list?

3.

Explain breadth first search (BFS) algorithm. Show each step of this algorithm to traverse the graph given below.
Graph with nodes

Section B

Attempt any Eight questions

[8x5=40]
4.

What is asymptotic analysis? Explain big oh notation with example.

5.

Explain primitive queue operations. What are different applications of queue?

6.

Define recursion. Compare recursion with iteration. Write a recursive function to implement factorial.

7.

Trace bubble sort algorithm with array of numbers 37, 88, 16, 55, 10, 32, 23, 66, and 17.

8.

Define hashing. Explain collision and collision resolution in hashing.

9.

What is binary tree? Explain binary search tree with example.

10.

Write a program to implement binary search.

11.

Define spanning tree. Explain minimum spanning tree with example.

12.

Write short notes on:
a) Abstract data type
b) Stack as linked list