MCS
-
021
I
No. of Printed Pages : 3
MCA (Revised) / BCA (Revised)
Term-End Examination
December, 2018
C.19 e,3
:FA
MCS-021 :
DATA AND FILE STRUCTURES
Time : 3 hours
Maximum Marks : 100
(Weightage : 75%)
Note : Question number 1 is compulsory. Attempt any
three questions from the rest. All algorithms
should be written nearer to 'C' language.
1.
(a) Describe big 0 notation and S2 notation.
10
(b)
Explain the process of converting a tree
into a binary tree.
10
(c)
Write an algorithm to implement stack,
using array.
10
(d) What is linear search ? Write linear search
algorithm and find its time complexity.
10
1
P.T.O.
MCS-021
