Tribhuvan University
Bachelor of Computer Application
Semester 3 · TU Board 2021
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 its importance.
- 3.5
Write an algorithm to convert infix expression to postfix.
- 4.5
Write a recursive program to generate Fibonacci number up to nth terms.
- 5.5
What is insertion sort? Trace and sort the following data using insertion sort: 90, 57, 80, 10, 22, 21, 45, 9, 78
- 6.5
What is hashing? Explain with example the collision resolution method open hashing.
Answer comingAlso asked in 2025, 2022
- 7.5
Write the difference between serial and parallel algorithm with example.
- 8.5
Write a program to implement basic operation in queue.
Group C
Attempt any TWO questions(2 × 10 = 20)
- 9.10
What is circular linked list? Write a function to delete the node from linked list.
- 10.10
What do you mean by Huffman Algorithm? Explain with example. Construct the B tree of order 5 using following data: 20, 10, 26, 55, 80, 11, 9, 60, 67, 55, 22, 76, 56, 45, 34, 100, 150
- 11.10
What do you mean by MST? Explain Kruskal's algorithm with example.
— The End —