Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2081
Course Title: Data Structures and Algorithms (CSC211)
Full Marks: 60Pass Marks: 24Time: 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.
Group A
Attempt any TWO question.(2 × 10 = 20)
- 1.10
Define circular queue. How queue differ from stack. Write a program to implement linear queue.
Answer comingAlso asked in 2080, 2075
- 2.10
What is AVL tree? How heap differ from tree? Construct an AVL tree for data 24,12,8,15,35,30,57,40,45 and 78.
- 3.10
Define list. How can you use linked list to implement stack? Explain circular linked list.
Answer comingAlso asked in 2080, 2078
Group B
Attempt any EIGHT question.(8 × 5 = 40)
- 4.5
Explain big oh notation in brief. Find big oh of the following function:
f(x) = 5x^4 + 9x^2 + 7x + 9.
- 5.5
Convert the infix expression
A+(((B-C)*(D-E)+F)/G)$(H-I) into post expression using stack.
- 6.5
Write a program to find GCD of two numbers using recursion.
Answer comingAlso asked in 2077
- 7.5
What is the application of spanning tree? Draw a MST of a graph containing any 8 vertices and 11 edges with arbitrary edge costs.
- 8.5
Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort.
Answer comingAlso asked in 2079
- 9.5
What is hashing? how do you apply linear probing and rehashing explain with example.
- 10.5
What is the algorithm for node insertion and deletion from specified position from doubly linked list.
- 11.5
What is linear queue? Why do we need circular queue? Explain.
- 12.5
Write short notes on:
- Breadth First traversal of graph
- TOH
Answer comingAlso asked in 2079, 2075
— The End —