Anda di halaman 1dari 2

# tlmltI]ffiilililtlllt oB-81

## V Semester B.C.A. Examination, December 2010

(New Scheme)
COMPUTER SCIENCE
Analysis and Design of Algorithm (5 BCA 2)

SECTION _ A

## 2. Define Asymptotic Q (omega) notation. Show that 100 n + 5 A (n).

3. Write an algorithm for Bubble Sort.

## 5. What is the Control Abstraction for greedy method ?

6. What is the worst case, best case and average case of linear search ?
7. Write the difference between divide, conquer and dynamic programming.
8. Write an algorithm for binary search.

SECTION _ B

## 11. a) Write a note on Asymtotic Notations.

b) Explain Horner's method of evaluating a polynomial at a given point. (6+8)
P.T.O.
oB-81 m;ffiffi
LZ. a) Explain merge sort with an algorithm.
b) Multiply the two.mafices usiqg Strassen,s ma0jx mtltiplication.

e=[''-l"=['
L3 4)
1l
(8+6)
2) lz
13. a) ,Find the optimal solution for the given constraints using Greedy Knapask
problem.

## Profits : 2A, 40,35, 45

b) Explain Prim's Algorithm to find given directed graph. : ' :

(7+7)

## 14. a) Explain Prim's Algorithm to find minimum spanning,tree.

b) Find the optimal comb.ination of chained matrix mukiplication given.
ffit=24x13,mr=13x55
ffi3=55x72,m0=72x19
andn=4 (7+7\
15. a) Explain how backtacking is used to solve Four eueen,s problem.
b) Explain sum of subsei problem. (8+6)
16. .Write short note on the following :

## a) Optimal storage on tapes.

b) Ordered searching in compration ffees.
c) Kurskul's algorithm. l4