ASC DEGREE COLLEGE

I PREPARATORY EXAM, DECEMBER 2024

I SEMESTER BCA
DATA STRUCTURES
Duration: 150 minutes Max marks: 60

Instruction: Answer any four questions from each section

SECTION A
I. Answer any four questions. Each question carries 2 marks. (4*2=8)

1. Define an array? How it is represented in memory?

2. Define time and space complexity.
3. What is recursion?
4. What is priority queue?
5. What is B-Trees. Mention its operations.
6. Define binary tree and complete binary trees

SECTION B
II. Answer any four questions. Each question carries 5 marks. (4*5=20)

7. What are data structures? Discuss different types of data structures with their
characteristics and features.
8. Write an algorithm to sort the elements using Quick Sort.
9. Evaluate the following postfix expression-> 95+36*97-1
10. What is a binary search? Write the algorithm for searching an element using binary
search.
11. Construct BST for the given list:
56 38 10 65 72 44 50
12. Sort the following elements using Shell Sort.
38, 47, 24, 42,17.

SECTION C
III. Answer any four questions. Each question carries 8 marks. (4*8=32)

13. Construct a binary tree in given in-order & post order traversal 8
a. In-order: EACKFHDBG
b. Post-order: ECKAHBGDF
14. A) Write a C program to display sparse matrix. 4
B) Explain various types of linked lists. 4
15. A) Convert the following infix expression into its equivalent postfix expression.
(A+B) *(M/N) +(X+Y) 4
B) Explain hashing techniques and techniques for collision resolution. 4
16. Define Tree data structures. Explain various tree terminologies with a neat diagram.
17. A) Explain queue underflow and overflow. 4
B) Write an algorithm for i) Push ii) Pop operation for stack.
18. A) Explain any 4 mathematical functions. 4
B) Write a C program to sort an array using insertion sort technique. 4