Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2080
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 questions.(2 × 10 = 20)
- 1.10
Explain queue as an ADT. Write a program to implement linear queue. Compare linear queue with circular queue.
Answer comingAlso asked in 2081, 2075
- 2.10
Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.
- 3.10
Explain AVL tree with example. Also, explain balancing algorithm for this tree.
Group B
Attempt any eight questions.(8 × 5 = 40)
- 4.5
What is asymptotic analysis? Explain theta notation with example.
- 5.5
Explain push and pop operations of stack. What are different applications of stack?
Answer comingAlso asked in 2078, 2077
- 6.5
Explain tail recursion with example. Compare recursion with iteration.
- 7.5
Trace selection sort algorithm with array of numbers 2, 81, 6, 45, 11, 21, 23, 41, and 11.
- 8.5
Explain binary search with an example. What is the time complexity of binary search?
Answer comingAlso asked in 2075
- 9.5
Write Dijkstra's algorithm to find shortest path between any two vertices of a graph.
Answer comingAlso asked in 2077
- 10.5
Write a program to implement insertion sort.
- 11.5
How can you use linked list to implement stack? Explain.
Answer comingAlso asked in 2081, 2078
- 12.5
Write short notes on:
a) Abstract data type
b) Circular linked list
— The End —