Reg. No.

T 3607
APRILA{AY2008. DEGREEEXAMINATION, B.E./B.Tech.
Fourth Semester Computer Scienceand Engineering CS 1201- DESIGN AND ANALYSIS OF ALGORITHMS (Candidatesadmitted in 2006 oniy) (Regulat'on 2004) Time : Three hours

1. 2. 3. 4. 5. 6. 7. 8. 9. 10.

Define Big oh notation.

How will you measure Input size of algorithms? What is the averagecasecomplexity of linear search algorithm? Write the procedurefor selection sort. Define depth first searching technique' What is the fundamental philosophy of transform and conquer method? What is AVL tree? State if backtracking always producesoptimal solution. Explain briefly branch and bound technique for solving problems.

ww

w.

Enumerate some important types of problems.

aa na

PARTA-(10 x2=20 marks)

va

Answer ALL qustions'

N.

co m

Maximum : 10Q marks

PARTB-(5x16=80marks) 11. (a) (i) (ii) Define the asymptotic notations used for best case average case and worst case analysis of algorithms. Write an algorithm for finding maximum element of an array) perform best, worst and average case complexity with appropriate order notations.

Or (b) Write an algorithm to find mean and variance of an array perform best, worst and average case compiexity, defining the notations used for each type of analysis. Derive the recurrence equation for Fibonnocci series. Perform complexity analysis for the same. Or

12. (a)

13. (a)

Explain in detail quick sorting method. Provide a complete analysis of ouick sort. Or

L4. (a)

Apply Prim's algorithm and Kruskal algorithm to the graph to obtain minimum spanning tree. Do these algorithms always generate same output - Justify. Or (b) Solve the foliowing instance of the single-sourceshortest-paths problem with vertex a as the source :

Write the algorithm, for the aboveproblem.

ww

w.

**-t

aa na

va

(b)

Explain in detail merge sort. Illustrate the algorithm rvith a numeric example. Provide complete anaiysis of the same.

N.

co m

(b)

Explain in detail, the techniques for algorithm visulization.

T 3607

15.

(a)

Explain l/-queens problem with an algorithm. Explain why back tracking is defined as a default procedure of last resort for solving problems. ( 1 0+ 6 )

Or
(b) Jobl Person g "( I Job2 Job3 Job 2 7 8

bl

"l dt

6 5 7

4 8 6

3 1 e

7 8 4

Consider the above matrix for assignment problem involving persons and jobs. Expiain in detaii how branch and bound technique is useful is solving assignment problems.

ww

w.

aa na

va

N.
T 3607

co m