QIN 0 E0000 PA-423001 Seat No, ——__ B. C. A. (Sem. III) Examination October / November - 2016 BCA - 301 : Data & File Structure Using C ‘Time : 2 Hours ] [ Total Marks : 60 1 (A) Attempt any five [10] 1, What are the non-linear data structures? 2. How to calculate address of n" element in a one dimensional array? 3. How efficient is binary search as compared to sequential search? 4. Which data structures follow LIFO algorithm? 5. Which data structure should be used for CPU scheduling? 6. How many children can a node have in binary tree? 7. What is a forest? 1B) Attempt any one (51 1. Write a short note on primitive and non primitive data structures. 2. Write a short note on sparse matrix. 2(A) Attempt any three 19] Write a short note on Stack. Write a short note on Queue. Explain single and double linked list. Explain priority queue. 5. Why sorting algorithms relevant? What are the applications of sorting? 2B) Attempt any one 16] 1. Describe Bubble sort. 2. Describe Binary search, Repe 3 Attempt any three 15} 1. Write a note on tree data structure. 2. What is pre-order, post-order and in-order traversal? 3. Describe threaded binary tree. 4, Describe expression tree with example. 4 Attempt any two (15) 1, Write a program for sequential search, 2. Write a program for quick sort. 3. Write a program for implementing a double linked list. 4. Write a program for implementing a queve PA-423001) [360 ]