Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Illlllllilllfiffiffiiltffilillllt NP - 315

I Semester B.C.A. Degree e?r*inrtion, March/A pril2023


(NEP) \2921-22and Onwards) (F+R)
COMPUTER SCIENCE
Data Structures
Time : 2la Hours Max. Marks: 60

lnstruction : Answer all Sections.

SECTION _ A

Answer any four questions. Each question carries 2 marks : (4x2=$)

1. Define data structure. List out any two operations of data structure.

2. Write ADT of an array.


3. What is queue ? And mention its types.
4. Mention the different ways of tree traversal.

5. What is'B'Tree ? Mention its operation.

6. Define any two collision resolution in Hashing.

SECTION _ B

Answer any four questions. Each question carries'S marks : (4x5=20)

7. what is algorithm ? E*plain time and space complexity of algorithm.

8. Write an algorithm to delete a node in the queue.


9. Evaluate the following infix to prefix
Q=(A+B) /(C*D).
10. Explain AVL tree with its operation.

11. Explain DFS algorithm through stack concept.

12. Explain quick sort algorithm.


P.T.O.

I
NP - 315 iillllllt1ilil fi iltil ililtliliiilt

SECTION _ C

Answer any four questions. Each question carries 8 marks : (4x8=32)

13. a) Explain Asymptotic notation with example. 4


b) Write the 'C' program to display sparse matrix and its transpose. 4

14. a) Explain array concepts with its classification. 4


b) Write an algorithm to insert an element to the given affay
A = {10, 30, 40, 50}. lnsert element 2A at the position 2. 4

t3. What is stack ? Explain PUSH and POP operation algorithm with example. I
16. a) Write an algorithm for bubble sort. 3
b) Sort the following elements using bubble sort. 5
38 47 24 42 17

17. a) What is 'BST' ? 2


h\ (lonstrr rnt n RST fnr thp nivon lic.t ' A

56 3B 10 65 72 44 50

18. a) Define Hashing. Explain Hash table and Hash function. 3


b) Write 'C' program for Linear search. 5

,*;

You might also like