http://www.onlineBU.

com

AF-3106
BCA (Part - I)
Term End Examination, 2017-18

DATA STRUCTURE

Time : Three Hours] [Maximum Marks : 100

http://www.onlineBU.com

[Minimum Pass Marks : 33

m
co
Note : Answer all questions. The figures in the right-

u.
eb
hand margin indicate marks.

in
nl
.o
w
1. Answer the following questions in short : 2×10

w
w
://
tp
(a) What is Data Structure ?

ht
(b) Write about data types.
(c) What is the concept of linked list ?
(d) What is the need of header node ?
(e) What do you mean by stack ?
(f) What is Binary tree ?
(g) What is Linear search ?
(h) What is Selection sort ?
(i) What is average case analysis ?
(j) What is space complexity of algorithms ?

370_BSP_(3) (Turn Over)

m
co
u.
eb
in
nl
.o
w
w
w
://
tp
ht
 http://www.onlineBU.com

(2)

2. Write an algorithm to insert a given element

in the one-dimension array. Give a suitable
example. 15

OR

What is Array ? Describe all the operations

performing in the array.

3. Describe the applications of linked list. 15

OR
http://www.onlineBU.com

m
Write an algorithm for insertion in linked list

co
u.
with giving suitable example.

eb
in
nl
4. Evaluate the following prefix expression using

.o
w
w
stack

w
15

://
/ * A + BCD

tp
ht
OR

Describe trees traversal algorithms.

5. Write the algorithm of selection sort and solve

the given example with selection sort
techniques : 15
65, 45, 21, 60, 15, 25, 5

OR

What is Merge sort ? Write its algorithm with

giving suitable example.

370_BSP_(3) (Continued)
m
co
u.
eb
in
nl
.o
w
w
w
://
tp
ht
 http://www.onlineBU.com

(3)

6. Describe the complexity of algorithms. 15

OR

Describe the asymptotic notation.

———
http://www.onlineBU.com

m
co
u.
eb
in
nl
.o
w
w
w
://
tp
ht

370_BSP_(3) 2,260
m
co
u.
eb
in
nl
.o
w
w
w
://
tp
ht