Data Structures Question Paper of 3rd Semester BCA Download Previous Years Question Paper 2

Roll No.

Total No. of Questions : 07

BCA (Sem.–3rd)

DATA STRUCURES

Subject Code : BSBC-302

Paper ID : [B0229]

Time : 3 Hrs.      

INSTRUCTION TO CANDIDATES :

1. Section-A is compulsory.

2. Attempt any Four questions form Section-B.

SECTION-A

Q. 1.

(a) Define problem analysis?

(b) What is use of Big O notations?

(c) Write an algorithm to insert an element in a linked list.

(d) Define time space trade of.

(e) List various uses of tree data structure.

(f) What is need of doubly linked list?

(g) List various aplications of queue data structure.

(h) Define an array? How it is represented in memory?

(i) Discus how an array is different from linked list.

(j) What is dynamic storage management? Discus its need.

Section-B

Q. 2. What is data structure? Discus different types of data structures with their characteristics     

         features.

Q. 3. Write notes on the following:-

        

         (a) Recursion

         (b) Priority queue and its uses.

Q. 4. What is bubble sort? Write and explain an algorithm for bubble sort. Sort he following list of              numbers using bubble sort:

        14, 31, 76, 12, 52, 15, 35, 6, 1, 98, 62

Q. 5. What is binary search? What are its advantages over linear search? Write and explain an        

         algorithm for searching an element using binary search.

Q. 6. Define tree and binary tree. Explain preorder and postorder tree traversal algorithm by taking 

         suitable examples.

Q. 7. Define stack. How it is different from queue. Write an algorithm to implement stack using 

         linked list.