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

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)
(New 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.

Compute the GCO of 30 and 12 using recursion. Convert the infix expression A + B *(C – D) / E to postfix using stack.

2.

Explain circular linked list in brief. Explain process of inserting and removing nodes in a singly linked list.

3.

Explain merge sort along with its time complexity. Trace the execution of Quick sort algorithm with the array of numbers 40, 22, 70, 11, 43, 18, 20, 21 and 8.

Section B

Attempt any Eight questions

[8x5=40]
4.

Why do we need dynamic memory allocation? Explain abstract data type with example.

5.

What is drawback of linear queue? Explain circular queue.

6.

List any one limitation of recursion. Describe stack as linked list.

7.

Define max and min heap. How can we use heap property in heap sort? Explain.

8.

Write the algorithm of binary search with its time complexity.

9.

Suppose, the set of keys is {5, 10, 12, 8, 47, 56, 7, 48}, m = 10, and h(x) = x mod 10. Show the effect of successively inserting these keys using linear probing.

10.

Create a BST from data 20, 25, 18, 16, 19, 30, 17 and traverse it in inorder, preorder and post order.

11.

How do you represent graphs? Explain.

12.

Write short notes on:
a) Priority queue
b) Minimum spanning tree