Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2077
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.
- 1.
What is stack? What are the different applications of stack? Explain stack operations with example.
Answer comingAlso asked in 2080, 2078
- 2.
Differentiate between singly linked list and doubly linked list. How do you insert and delete a node from doubly linked list? Explain.
- 3.
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.
Answer comingAlso asked in 2080
- 4.
What is dynamic memory allocation? Compare data structure with abstract data type.
- 5.
Explain algorithm for evaluation of postfix expression using stack
Answer comingAlso asked in 2079, 2078
- 6.
Explain queue as an ADT.
- 7.
Write a recursive program to find GCD of two numbers.
Answer comingAlso asked in 2081
- 8.
What is linked list? How is it different from array?
- 9.
Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order.
Answer comingAlso asked in 2078
- 10.
What is hashing? Explain concept of hash table and hash function with example.
- 11.
What is minimum spanning tree? Explain
- 12.
Write short notes on:
- Tail recursion
- Collision resolution techniques
— The End —