Tribhuvan University
Bachelor of Computer Application
Semester 3 · TU Board 2019
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
What is Data Structure? Show the status of stack converting following infix expression to postfix: P + Q - (RS/T+U)-VW
- 3.5
Write binary search. Consider a hash table of size 10; insert the keys 62, 37, 36, 44, 67, 91 and 107 using linear probing.
- 4.5
What are deterministic and non-deterministic algorithms? Explain greedy algorithm.
- 5.5
Draw a BST from the string DATASTRUCTURE and traverse the tree in post order and preorder.
- 6.5
Define circular queue? How does circular queue overcome the limitation of linear queue? Explain.
Answer comingAlso asked in 2025
- 7.5
What is singly linked list? Write an algorithm to add a node at the beginning and end of Singly linked list.
Answer comingAlso asked in 2020
- 8.5
Define AVL tree. Construct AVL tree from given data set: 4, 6, 12, 9, 5, 2, 13, 8, 3, 7, 11.
Answer comingAlso asked in 2024, 2020
Group C
Attempt any TWO questions(2 × 10 = 20)
- 9.10
What is stack? List the applications of stack. Write an algorithm or procedure to perform PUSH and POP operation in stack.
Answer comingAlso asked in 2022
- 10.10
What is heap? Explain quick sort algorithm with Big-oh notation in best case, average case and worst case and trace it to sort the data: 8, 10, 5, 12, 14, 5, 7, 13.
- 11.10
Define graph and tree data structure. Explain breadth first traversal and depth first traversal with example.
— The End —