Tribhuvan University
Bachelor of Computer Application
Semester 3 · TU Board 2020
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? Explain different operations to be performed on data structure.
- 3.5
Define Greedy Algorithm and heuristic algorithm. Briefly explain Big-Oh Notation.
- 4.5
What is circular queue? Write an algorithm to insert an item in circular queue.
- 5.5
How does AVL tree differ from BST? Construct an AVL tree from following data: 35, 56, 68, 65, 44, 41, 31, 49, 20.
Answer comingAlso asked in 2024, 2020, 2019
- 6.5
What is B-tree? Create a B-Tree of order 4 using following data: 6, 4, 22, 10, 2, 14, 3, 8, 11, 13, 5, 9.
Answer comingAlso asked in 2024, 2020, 2019
- 7.5
What is binary search? Write an algorithm to search an item using binary search.
Answer comingAlso asked in 2022
- 8.5
What is graph? Explain Kruskal's algorithm to construct minimum spanning tree with example.
Group C
Attempt any TWO questions(2 × 10 = 20)
- 9.10
Define stack. List the applications of stack. Trace the algorithm to convert infix to postfix with following infix expression: ((A + B) - C * D/E)*(H-I)*F+G and evaluate the obtained postfix expression with following values: A = 4, B = 2, C = 4, D = 3, E = 8, F = 2, G = 3, H = 5, I = 1.
- 10.10
What is double linked list? How does it differ from circular linked list? Write an algorithm or function to add a node at the beginning and end of double linked list.
Answer comingAlso asked in 2019
- 11.10
What is heap? Differentiate between min heap and max heap. Sort the following data in ascending order by heap sort method: 2, 9, 3, 12, 15, 8, 11.
— The End —