Tribhuvan University
Bachelor of Computer Application
Semester 3 · TU Board 2023
Course Title: Data Structures And Algorithms (CACS201)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to answer the question in their own words as far as possible.
Group B
Attempt any SIX question.(6 × 5 = 30)
- 2.5
Define stack. Why stack is considered as an ADT? List any four applications of stack.
- 3.5
Evaluate the following postfix expression using the stack: 4 5 + 7 3 - 2 + *
- 4.5
What is tower of Hanoi problem? How recursion can be used of Hanoi problem?
Answer comingAlso asked in 2025
- 5.5
Define hashing. Explain how to resolve collisions during hashing using open addressing.
- 6.5
What is binary search? Trace the algorithm of binary search to search a key 12 in the data: 11, 19, 5, 2, 7, 21, 8, 21, 12
- 7.5
What is big-oh notation? Explain about divide and conquer strategy with example.
- 8.5
What are the depth and degree of a node in a tree? Perform pre-order, in-order and post-order traversal of the following tree: [figure in the original paper]
Group C
Attempt any TWO questions(2 × 10 = 20)
- 9.10
How dynamic implementation of the queue can be done? Explain with algorithm. Also explain how insertion and deletion of a node can be done at the end of a singly linked list with algorithm.
- 10.10
Define complete binary tree and skewed tree. Write a function to implement heap sort and sort the following data using heap sort: 12, 9, 1, 13, 16, 24, 21, 5
- 11.10
How breadth first traversal and depth first traversal can be used for traversing a graph? Explain with example. Use Dijkstra's algorithm to find the shortest path from node A to all other nodes for the following graph. [figure in the original paper]
— The End —