No.

of Printed Pages – 3 CA107(CP)

Roll No.

B.C.A.
SECOND SEMESTER EXAMINATION, 2021-22
DATA STRUCTURE USING 'C'

Time: 3:00 hrs. Max. Marks: 40

Note : (i) The question paper contains Three Sections.
(ii) Section-A is compulsory, Section-B and C contains internal
choice.

SECTION-A
1. Attempt ALL parts of the following questions: 1 x 10 =
10
(a) What is Data Structure? Write various types of data structure.
[BT-1,
CO-1, PO-2]

(b) Discuss non-linear data structure with example. [BT-2, CO-1, PO-1]

(c) Write algorithm to insert an element at the beginning of

linked
list. [BT-2, CO-2, PO-1]

(d) What are the advantages and disadvantages of linked

list? [BT-1, CO-2, PO-2]

(e) What is a stack? Explain it with its applications. [BT-2, CO-3, PO-3]

(f) Distinguish between stack and queue. [BT-2,

CO-3, PO-2]

(g) Define binary tree. [BT-1, CO-4, PO-1]

(h) What is complete binary tree? [BT-1,

CO-4, PO-2]

(i) What do you understand by hash searching? [BT-1,

CO-5, PO-2]
 (j) Differentiate between searching and sorting. [BT-2,

CO-5, PO-4]

1 P.T.O.

CA107(CP) CA107(CP)
SECTION-B (b) Evaluate the following Postfix expression using stack: [BT-5,

CO-3, PO-7]
2. Attempt any Two of the following questions: 5 x 2 =
2, 3, 10, +, *, 8, 2, /, -
10
(a) What is algorithm? Discuss the complexity of algorithm with
6. Attempt any One of the following questions: 4x1=
example. [BT-4, CO-1, PO-3]
4
(b) What do you mean by Traversing? Write the algorithm of
(a) What is spanning tree? Give any one algorithm for finding the
traversing of a singly linked list.
[BT-3, CO-2, PO-4] minimum spanning tree. [BT-4, CO-4, PO-6]

(c) What do you mean by stack? What are the operations (b) Traverse the following binary tree in Pre, Post, Inorder and
performs over stack? Write the algorithm of push and pop
 operation. [BT-4, CO-3, PO-5] level order. [BT-6, CO-4, PO-5]

(d) Write short notes on following: [BT-3, CO-4, PO-6]

(i) AVL Tree (ii) BFS

SECTION-C
3. Attempt any One of the following questions: 4x1=
4 7. Attempt any One of the following questions: 4x1=
(a) What is Asymptotic Notation? Explain all the types of 4
asymptotic notation. (a) Explain selection sort with an example given below. Suppose
[BT-4, CO-1, PO-5]
an Array A contains 8 elements as follows: 77, 33, 44, 11, 88,
(b) What do you understand by Character String? Briefly explain
22, 66, 55. [BT-6, CO-5, PO-5]
the string handling functions. [BT-6,

CO-1, PO-3]
(b) What is quick sort? Write the algorithm of quick sort. [BT-5,

CO-5, PO-3]

4. Attempt any One of the following questions: 4x1=

4
(a) Explain concept of circular link list with examples. [BT-5,

CO-2, PO-2]

(b) Briefly explain the term Garbage collection and

compaction. [BT-6, CO2, PO-3]

5. Attempt any One of the following questions: 4x1=

4
(a) Write an algorithm to evaluate a given infix expression into
postfix expression. [BT-4,

CO-3, PO-6]

2 3