Algorithm Algorithm Defination An Algorithm is a finite
![Algorithm Algorithm](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-1.jpg)
![Algorithm Defination An Algorithm is a finite set of instructions that if followed accomplishes Algorithm Defination An Algorithm is a finite set of instructions that if followed accomplishes](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-2.jpg)
![](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-3.jpg)
![Characteristics of an Algorithm Finiteness Definiteness Effectiveness Input Output Characteristics of an Algorithm Finiteness Definiteness Effectiveness Input Output](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-4.jpg)
![Algorithm design tools Name of the algorithm and an introductory Comment. Steps Comments Assignments Algorithm design tools Name of the algorithm and an introductory Comment. Steps Comments Assignments](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-5.jpg)
![Name of the algorithm and an introductory Comment. LINEAR_SEARCH(A, N, KEY) [ ALGORITHM TO Name of the algorithm and an introductory Comment. LINEAR_SEARCH(A, N, KEY) [ ALGORITHM TO](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-6.jpg)
![](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-7.jpg)
![COMMENTS [ ] Comments are written in brackets COMMENTS [ ] Comments are written in brackets](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-8.jpg)
![Assignments Statements Dot and equal to O= Var o= 45 Assignments Statements Dot and equal to O= Var o= 45](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-9.jpg)
![Exit Statement Exit / finished / end Exit Statement Exit / finished / end](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-10.jpg)
![Variable Name In capital Eg : - VAR 1 VAR 2 Variable Name In capital Eg : - VAR 1 VAR 2](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-11.jpg)
![OPERATORS LOGICAL OPERATOR (AND &&, OR ||, NOT !) RELATIONAL OPERATOR (<, >, <=, OPERATORS LOGICAL OPERATOR (AND &&, OR ||, NOT !) RELATIONAL OPERATOR (<, >, <=,](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-12.jpg)
![Input and Output Statements Read : VAR (SCANF() ) ---- ACCEPT DATA FROM USER Input and Output Statements Read : VAR (SCANF() ) ---- ACCEPT DATA FROM USER](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-13.jpg)
![Flow Chart Flow Chart](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-14.jpg)
![Types Of algorithm Brute Force Divide and Conquer Dynamic Programming Greedy Algorithm Types Of algorithm Brute Force Divide and Conquer Dynamic Programming Greedy Algorithm](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-15.jpg)
![Performance Analysis Space Complexity It is the amount of memory required for that particular Performance Analysis Space Complexity It is the amount of memory required for that particular](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-16.jpg)
![Space Complexity. void { main() int a; float b, c; c = a+b; printf(“Result Space Complexity. void { main() int a; float b, c; c = a+b; printf(“Result](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-17.jpg)
![Time Complexity void { } main() int a; -------- 1 float b, c; -------- Time Complexity void { } main() int a; -------- 1 float b, c; --------](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-18.jpg)
![Time Complexity void { { } main() int a, n; -------- 1 float b, Time Complexity void { { } main() int a, n; -------- 1 float b,](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-19.jpg)
![Big ‘O’ Notation Provides asympostotic upper bound for a given functions Max (O(1), O(n+1), Big ‘O’ Notation Provides asympostotic upper bound for a given functions Max (O(1), O(n+1),](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-20.jpg)
- Slides: 20
![Algorithm Algorithm](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-1.jpg)
Algorithm
![Algorithm Defination An Algorithm is a finite set of instructions that if followed accomplishes Algorithm Defination An Algorithm is a finite set of instructions that if followed accomplishes](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-2.jpg)
Algorithm Defination An Algorithm is a finite set of instructions that if followed accomplishes a particular task.
![](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-3.jpg)
![Characteristics of an Algorithm Finiteness Definiteness Effectiveness Input Output Characteristics of an Algorithm Finiteness Definiteness Effectiveness Input Output](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-4.jpg)
Characteristics of an Algorithm Finiteness Definiteness Effectiveness Input Output
![Algorithm design tools Name of the algorithm and an introductory Comment Steps Comments Assignments Algorithm design tools Name of the algorithm and an introductory Comment. Steps Comments Assignments](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-5.jpg)
Algorithm design tools Name of the algorithm and an introductory Comment. Steps Comments Assignments Statements Exit Statement Variable Name Operators Input and Output Statements Flow Chart
![Name of the algorithm and an introductory Comment LINEARSEARCHA N KEY ALGORITHM TO Name of the algorithm and an introductory Comment. LINEAR_SEARCH(A, N, KEY) [ ALGORITHM TO](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-6.jpg)
Name of the algorithm and an introductory Comment. LINEAR_SEARCH(A, N, KEY) [ ALGORITHM TO PERFORM LINEAR SEARCH]
![](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-7.jpg)
![COMMENTS Comments are written in brackets COMMENTS [ ] Comments are written in brackets](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-8.jpg)
COMMENTS [ ] Comments are written in brackets
![Assignments Statements Dot and equal to O Var o 45 Assignments Statements Dot and equal to O= Var o= 45](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-9.jpg)
Assignments Statements Dot and equal to O= Var o= 45
![Exit Statement Exit finished end Exit Statement Exit / finished / end](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-10.jpg)
Exit Statement Exit / finished / end
![Variable Name In capital Eg VAR 1 VAR 2 Variable Name In capital Eg : - VAR 1 VAR 2](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-11.jpg)
Variable Name In capital Eg : - VAR 1 VAR 2
![OPERATORS LOGICAL OPERATOR AND OR NOT RELATIONAL OPERATOR OPERATORS LOGICAL OPERATOR (AND &&, OR ||, NOT !) RELATIONAL OPERATOR (<, >, <=,](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-12.jpg)
OPERATORS LOGICAL OPERATOR (AND &&, OR ||, NOT !) RELATIONAL OPERATOR (<, >, <=, >=) ARTHEMATIC OPERATOR (+, -, *, /)
![Input and Output Statements Read VAR SCANF ACCEPT DATA FROM USER Input and Output Statements Read : VAR (SCANF() ) ---- ACCEPT DATA FROM USER](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-13.jpg)
Input and Output Statements Read : VAR (SCANF() ) ---- ACCEPT DATA FROM USER Write Message (Printf() --- print data on the screen
![Flow Chart Flow Chart](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-14.jpg)
Flow Chart
![Types Of algorithm Brute Force Divide and Conquer Dynamic Programming Greedy Algorithm Types Of algorithm Brute Force Divide and Conquer Dynamic Programming Greedy Algorithm](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-15.jpg)
Types Of algorithm Brute Force Divide and Conquer Dynamic Programming Greedy Algorithm
![Performance Analysis Space Complexity It is the amount of memory required for that particular Performance Analysis Space Complexity It is the amount of memory required for that particular](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-16.jpg)
Performance Analysis Space Complexity It is the amount of memory required for that particular algorithm. Time Complexity Deals with the computing time.
![Space Complexity void main int a float b c c ab printfResult Space Complexity. void { main() int a; float b, c; c = a+b; printf(“Result](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-17.jpg)
Space Complexity. void { main() int a; float b, c; c = a+b; printf(“Result = %d”, c) } Space Required = 2+4+4 = 10 bytes.
![Time Complexity void main int a 1 float b c Time Complexity void { } main() int a; -------- 1 float b, c; --------](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-18.jpg)
Time Complexity void { } main() int a; -------- 1 float b, c; -------- 1 c = a+b; -------- 1 printf(“Result = %d”, c); ---- 1 Total Frequency count = 1+1+1+1 = 4
![Time Complexity void main int a n 1 float b Time Complexity void { { } main() int a, n; -------- 1 float b,](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-19.jpg)
Time Complexity void { { } main() int a, n; -------- 1 float b, c; -------- 1 n=3 for(i=0; i<=n; i++) ----- n c = a+b+i; -------- n printf(“Result = %d”, c); ---- n } Total Frequency count = 1+1+n+n+n = 11
![Big O Notation Provides asympostotic upper bound for a given functions Max O1 On1 Big ‘O’ Notation Provides asympostotic upper bound for a given functions Max (O(1), O(n+1),](https://slidetodoc.com/presentation_image/be7940cd97851943835460f7039f920d/image-20.jpg)
Big ‘O’ Notation Provides asympostotic upper bound for a given functions Max (O(1), O(n+1), O(n^2)
Void defination
Learning objectives for finite and non finite verbs
Learning objectives for finite and non finite verbs
Finite and nonfinite verbs examples
Finite subordinate clause
Finite and non finite
Defination of algorithm
Definition of algorithm
Historical development of community
Plaque defination
Definition allusion
A research problem
Defination of atp
Recruitment policy meaning
Bullying defination
Define communication objectives
Director defination
Legal pluralism
Trade definition
Defination of epidemiology
Menstrual cycle defination