BCA 3rd Semester

Data Structures And Algorithms 2020 Board Question Paper

Tribhuvan university logo

Tribhuvan university

Bachelor In Computer Application

Course Title: Data Structures And Algorithms

Code No:CACS 201

Semester:III

2020

Full Marks:60 Pass Marks:24 Time:3 hours

Candidates are required to answer the question in their own words as far as possible.

Group B
Attempt any SIX question.
[6x5=30]
11.

What is Data Structure? Explain different operations to be performed on data structure.

12.

Define Greedy Algorithm and heuristic algorithm. Briefly explain Big-Oh Notation.

13.

What is circular queue? Write an algorithm to insert an item in circular queue.

14.

How does ABL tree differ from BST? Construct and AVL tree from following data: 35, 56, 68, 65, 44, 41, 31, 49, 20.

15.

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.

16.

What is binary search? Write an algorithm to search an item using binary search.

17.

What is graph? Explain Kruskal's algorithm to construct minimum spanning tree with example.

Group C

Attempt any TWO questions

[2x10=20]
18.

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.

18.

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.

18.

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.