M.Kalpana Devi, Assistant Professor,Computer Science and Engineering , Sri Ramakrishna Institute of Technology

This is useful for CSE students

1. https:// www.youtube.com/watch?v=vrILCsteFcI https:// www.youtube.com/watch?v=4keo-upf1zk https :// www.youtube.com/watch?v=EjKVorA2EyU

2. Introduction

3. Properties of Algorithm

4. Algorithm and Program Step by step procedure for solving a computational problem. Independent dependent

5. Characteristics of Algorithm Input: zero or more quantities are externally supplied. Output: At least one quantity is produced Definiteness (confidence): Each instruction is clear and unambiguous (clear cut). Finiteness: The algorithm must terminate after a finite number of steps. Effectiveness: Each instruction is very basic, so that can be carried out in a finite amount of time and it must be feasible (sufficient)

6. Time Complexity Example

7. C1=n+1 ( eg : n=10 means, it executes 11 times ) C2=n (it enters the loop when condition is true. So 10 times)

8. Dominant factor is n

9. https://www.youtube.com/watch?v=fMZ3aOR_Fnc