DSA s23
DSA s23
P. Pages : 2 GUG/S/23/13802
*2539*
Time : Three Hours Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions are compulsory.
2. All questions carry equal marks.
3. Assume suitable data wherever necessary.
OR
2. a) What is abstract data types? Explain data structure operations with the help of example? 8
OR
5. a) Explain push and pop function for stack? Write application of stack? 8
i) ( ( A + B − D ) / ( E − F) + G )
ii) ( A B C) / ( D E ( G F))
OR
i) Enqueue
ii) Dequeue
iii) Display
iv) Exit
GUG/S/23/13802 1 P.T.O
b) Write a C - program to implement circular queue? 8
7. a) What is binary search tree? Write a function for insert, delete and search operation in 8
BST?
OR
B H
C F I J
D E G
i) Degree
c) Write a short note on AVL tree? Explain types of rotations with the help of suitable 8
example?
OR
10. a) What is hashing? Solve given example by using division method with linear probing? 8
3, 2, 9, 6, 11, 13, 9, 12 m = 10
And h(k) = 2k + 3
************
GUG/S/23/13802 2