Reg. No.

SENGUNTHAR COLLEGE OF ENGINEERING, TIRUCHENGODE – 637 205

B.E./B.Tech. INTERNAL 1 EXAMINATION / EVEN SEM 2021-2022

Fourth Semester

IT/RA/ MEE

CS8451– DESIGN AND ANALYSIS OF ALGORITHMS

(Regulation 2017)

Time: 90 Mins Max. Marks: 50

Date & Session: 11.03.2022

Answer ALL questions.

PART A – (5 x 2 = 10)

1. Define best,worst,average case time complexity

2. Prove that the if f n o g n and g(n)=o(f(n) then f(n)=θ(g(n)

3. Define algorithm with its properties

4. Give the Euclid’s algorithm for computing gcd of two numbers.

5. Write down the properties of asymptotic notations

PART B – (2 x 13 = 26)

1. Explain the importance of asymptotic analysis for running time of an

algorithm with an example (13m)

2. (i) Explain the steps involved in problem solving (6m)

(ii) What are the rules of manipulate Big-oh Expressions and about the
typical growth rate of algorithms? (7m)

PART C – (1 x 14 = 14)

1. Briefly explain the mathematical analysis for recursive and non-recursive

algorithm (14m)

FACULTY INCHARGE HOD

[G.SARANYA & AP / IT] [Mr.M.Karthikeyan, HOD/IT]
****************************************All the best*****************************************