BCA 3rd Semester

Data Structures And Algorithms 2024 Board Question Paper

Tribhuvan university logo

Tribhuvan university

Bachelor In Computer Application

Course Title: Data Structures And Algorithms

Code No:CACS 201

Semester:III

2024

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.

Differentiate between stack and queue. What are the general applications of a stack?

12.

What is a linked list? How doubly linked list is different from circular linked list? Explain with example.

13.

What is recursion and recursive function? Write a recursive function to compute Fibonacci number.

14.

How does collision occur during hashing? Explain any two hashing functions.

15.

What is an AVL tree? Create an AVL tree from the following data:
18, 12, 14, 8, 5, 25, 31, 24, 27

16.

What are deterministic and non-deterministic algorithms? Explain the use of Big Oh notation to measure the complexity of an algorithm with an example.

17.

Implement the quick sort to sort the following data items:
12, 1, 14, 7, 2, 10, 4, 7, 22, 6, 15

Group C

Attempt any TWO questions

[2x10=20]
18.

What are the differences between linear queue and circular queue? Write an algorithm to enqueue and dequeue data elements in a circular queue.

19.

What is B-tree? How insertions and deletions of elements can be done in a B-tree.

20.

Explain the different ways to represent a graph. For the following graph use Prim’s algorithm to find a minimum spanning tree stating from the node 'A':
dsa-2024 qn 20 picture