END TERM EXAMINATION
SECOND SEMESTER [BCA] MAY- JUNE 2015
Paper Code: BCA-108
Subject: Data Structure using C(Batch- 2011 onwards)
Time: 3 Hours Maximum Marks: 75
Note: Attempt any five questions including Q.No 1 which is compulsory.
Question 1: Answer the following questions:— (5x5=25)
(a) Explain the working of insertion sort with suitable example.
(b) What do you mean by binary search tree? How is it different from conventional binary tree?
(c) What is circular queue and how is it different from linear queue?
(d) Explain the differences between linear and non linear data structures.
(e) Write a C function for addition of an element in 1 D array.