MCA - 3101
M.C.A. DEGREE EXAMINATION
THIRD YEAR
FIRST SEMESTER
DESIGN AND ANALYSIS OF ALGORITHMS
(Effective from the admitted batch of 2000 - 2001)

Time: 3 Hours
Max. Marks: 75

First question is Compulsory.
Answer any four from the remaining questions.
All questions carry equal marks.
Answer all parts of any question at one place.

I. a) Define the term "Algorithm'
b) Explain the term the order of complexity.
c) Explain pre-order traversal of Binary tree.
d) Give the general characteristics of greedy algorithm.
e) Describe the general principle of Divide and conquer.
f) Explain the asymptotic notation.
g) Write short notes on sorting.

2. a) State and explain basic properties of an Algorithm.

b) Find the Time Complexity of the following-.

Algorith in-terns of 0-notation of n (0 (n)

i = Oj for i = I to n do for j = I to n x n n do for k=1 to n x n x n do for l = I to n x n x n x n do i = i + I i