Part - | [DESIGN] IT 202 DESIGN AND ANALYSIS OF ALGORITHMS I KTU B TECH QUESTIONS FOR SECOND YEAR [S4] STUDENTS | QUESTION BANK


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY 
DESIGN ANALYSIS OF ALGORITHMS I S4 KTU
 QUESTION PAPERS

Part - | [DESIGN] IT 202 DESIGN AND ANALYSIS OF ALGORITHMS I KTU B TECH QUESTIONS FOR SECOND YEAR [S4] STUDENTS | QUESTION BANK



PART A (Answer All Questions, 4 x 1 = 4 Marks)

1. What is performance analysis.

2. What is time complexity.

3. What is best case analysis.

4. What is average case analysis.

PART A (Answer All Questions, 3 x 2 = 6 Marks)

5. What is step table. Write an algorithm for finding sum of n numbers using recursion and give its step table.

6. Solve recurrence relation using substitution method.T(1)=4,T(n)=2T(n/2)+4n

7. Solve recurrence relation using recurrence tree method.T(n)=T(n/3)+T(2n/3)+cn

PART A (Answer All Questions, 2 x 5 = 10 Marks)

8. What is algorithm. What are the properties of an algorithm.

9. What is amortized analysis. Explain different methods.

10. Explain profiling.

11. Explain about asymptotic notations.

RELATED


No comments:

Powered by Blogger.