Andhra University 2003 M.C.A DESIGN AND ANALYSIS OF ALGORITHMS - Question Paper

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

Time: three Hours
Max. Marks: 75

First ques. is Compulsory.
ans any 4 from the remaining ques..
All ques. carry equal marks.
ans all parts of any ques. at 1 place.

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

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

b) obtain 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

Earning:   Approval pending.