This document summarizes a presentation on algorithms and flowcharts. It defines an algorithm as a step-by-step solution to a problem and provides an example algorithm for adding two numbers. It describes the properties of algorithms including inputs, outputs, definiteness, effectiveness and finiteness. The document then defines a flowchart as the graphical representation of an algorithm using standard symbols. It discusses the complexity, merits and demerits of algorithms and flowcharts before concluding that a flowchart pictorial represents an algorithm.

1. PRESENTATION 0N
ALGORITHM AND
FLOWCHART
UNDERTHE GUIDANCE OF
PROF.MR.PRAKASH DEHURI
DEPARTMENT OF MCA
PRESENTED BY
BIJAY KUMAR BEHERA
1stYEAR,MCA
ARYAN INSTITUTEOF ENGENEERINGANDTECHNOLOGY,BBSR

2. ALGORITHM AND FLOWCHART

3. CONTENT :
 What is Algorithm ?
 Propertiesof Algorithm
 What is flowchart
 Complexity
 Merits of flowchart
 Demerit of flowchart
 Conclusion

4. What is an algorithm ?
• The step by step solution for solving a problem is called an
algorithm.
• It is a finite set of instruction which is used for a particular
task.
• An algorithm is defined as computational procedure that
takes some input value or set of input values and produce the
output.
• A sequential solution of any problem
• Written in human understandable form

5. EXAMPLE :
Algorithm for sum of two numbers
Step 1 : Start
Step 2 : Enter two numbers in a and b
Step 3 : Add a and b and store in c
Step 4 : Display c
Step 5 : End

6. Properties of algorithm :
Input
There are some input data which are supplied to an algorithm to perform a task.
Output
There will be at least one output as a result.
Definiteness
Each instruction of the algorithm may be clear and unambiguous(error free).
Effectiveness
The instruction of an algorithm should be simple so that the output can be
found in a effective manner.
Finiteness
The algorithm should be terminate after a finite number of step.

7. What is flowchart ?
o The Graphical representation or pictorial
representation of an algorithm is called as flowchart.
o It contain some symbols for execution of the
flowchart.
o An important programming tool
o Solving a problem using figures
o Different figures having different functions

8. Complexity :
 It is defined as the amount of time and space needed for
Execution of a program is known as Complexity.
 It is two types 1.Time complexity
2.Space complexity
1.Time complexity :
 it is an algorithm defined as the amount of time needed for
execute or to run a program.
2.Space complexity :
 it is an algorithm defined as the amount of space needed for
execute or to run a program.

9. Flowchart symbols :

11. Merits of flowchart :
 Easy to explain program logic
 Makes coding effective and faster
 Different symbols used
 Effective communication
 Easy to detect ,locate and remove bugs in a
program

12. Demerits of flowchart :
 Difficult to maintain
 Occupies space while documentation
Translation to computer program is difficult
Time consuming and monotonous job

13. Conclusion :
From the above, we can come to the conclusion
that a flowchart is a pictorial representation of
an algorithm, an algorithm can be expressed
and analyzed through a flowchart.

14. THANK YOU