ALGORITHMS AND

FLOWCHARTS
 ALGORITHMS AND FLOWCHARTS
 A typical programming task can be divided into
two phases:
 Problem solving phase
 produce an ordered sequence of steps that describe
solution of problem
 this sequence of steps is called an algorithm

 Implementation phase
 implement the program in some programming
language
 ALGORITHM AND FLOW CHART
What is Algorithm?

Algorithm can be defined as: “A sequence

of activities to be processed for getting
desired output from a given input.”
PROPERTIES OF ALGORITHM
Donald Ervin Knuth has given a list
of five properties for an algorithm,
these properties are:
1)FINITENESS
2)DEFINITENESS
3)INPUT
4)OUTPUT
5)EFFECTIVENESS
PROPERTIES OF ALGORITHM
1) FINITENESS:
An algorithm must always terminate
after a finite number of steps. It
means after every step one reach
closer to solution of the problem and
after a finite number of steps algorithm
reaches to an end point.
PROPERTIES OF ALGORITHM
2) DEFINITENESS
Each step of an algorithm must be
precisely defined. It is done by well
thought actions to be performed at
each step of the algorithm. Also the
actions are defined unambiguously for
each activity in the algorithm.
PROPERTIES OF ALGORITHM
3) INPUT
Any operation you perform need some
beginning value/quantities associated
with different activities in the
operation. So the value/quantities are
given to the algorithm before it begins.
 PROPERTIES OF ALGORITHM
4) OUTPUT:
One always expects output/result
(expected value/quantities) in terms of
output from an algorithm. The result may
be obtained at different stages of the
algorithm. If some result is from the
intermediate stage of the operation then it
is known as intermediate result and result
obtained at the end of algorithm is known
as end result. The output is expected
value/quantities always have a specified
relation to the inputs.
PROPERTIES OF ALGORITHM

5) EFFECTIVENESS:
Algorithms to be developed/written
using basic operations. Actually
operations should be basic, so that
even they can in principle be done
exactly and in a finite amount of
time by a person, by using paper
and pencil only.
 Steps in Problem Solving
 First produce a general algorithm (one can use
pseudocode)
 Refine the algorithm successively to get step by
step detailed algorithm that is very close to a
computer language.
 Pseudocode is an artificial and informal
language that helps programmers develop
algorithms. Pseudocode is very similar to
everyday English.
 Pseudocode & Algorithm
 Example 1: Write an algorithm to
determine a student’s final grade and
indicate whether it is passing or failing.
The final grade is calculated as the
average of four marks.
 Pseudocode & Algorithm
Pseudocode:
 Input a set of 4 marks
 Calculate their average by summing and dividing
by 4
 if average is below 50

Print “FAIL”
else
Print “PASS”
 Pseudocode & Algorithm
 Detailed Algorithm
 Step 1: Input M1,M2,M3,M4
Step 2: GRADE  (M1+M2+M3+M4)/4
Step 3: if (GRADE < 50) then
Print “FAIL”
else
Print “PASS”
endif
Write an algorithm to find the largest among three different numbers
entered by the user
• Step 1: Start
• Step 2: Declare variables a,b and c.
• Step 3: Read variables a,b and c.
• Step 4: If a > b
If a > c
Display a is the largest number.
Else
Display c is the largest number.
Else
If b > c
Display b is the largest number.
Else
Display c is the greatest number.
Step 5. Stop
 The Flowchart
 (Dictionary) A schematic representation of a sequence of
operations, as in a manufacturing process or computer
program.
 (Technical) A graphical representation of the sequence
of operations in an information system or program.
 Information system flowcharts show how data flows from source
documents through the computer to final distribution to users.
 Program flowcharts show the sequence of instructions in a
single program or subroutine. Different symbols are used to
draw each type of flowchart.
 The Flowchart
A Flowchart
 shows logic of an algorithm
 emphasizes individual steps and their
interconnections
 e.g. control flow from one action to the next
Flowchart Symbols
Terminal symbol - indicates the beginning and
end points of an algorithm.

Process symbol - shows an instruction other than

input, output or selection.

Input-output symbol - shows an input or an output

operation.

Disk storage I/O symbol - indicates input from or output to

disk storage.

Printer output symbol - shows hardcopy printer

output.

17
Flowchart Symbols cont…
Selection symbol - shows a selection process
for two-way selection.

Off-page connector - provides continuation of a

logical path on another page.

On-page connector - provides continuation

of logical path at another point in the same
page.

Flow lines - indicate the logical sequence of

execution steps in the algorithm.

Principles of Programming - NI July

2005 18
 Example
START
Step 1: Input M1,M2,M3,M4
Step 2: GRADE  (M1+M2+M3+M4)/4
Input
M1,M2,M3,M4
Step 3: if (GRADE <50) then
Print “FAIL”
else
GRADE(M1+M2+M3+M4)/4 Print “PASS”
endif
N IS Y
GRADE<5
0

PRINT PRINT
“PASS” “FAIL”

STOP
 Example 2
 Write an algorithm and draw a flowchart to
convert the length in feet to centimeter.
Pseudocode:
 Input the length in feet (Lft)
 Calculate the length in cm (Lcm) by
multiplying LFT with 30
 Print length in cm (LCM)
 Example 2
Flowchart
Algorithm START

 Step 1: Input Lft

Input

 Step 2: Lcm  Lft x 30

Lft

 Step 3: Print Lcm Lcm  Lft x 30

Print
Lcm

STOP
 Example 3
Write an algorithm and draw a flowchart that
will read the two sides of a rectangle and
calculate its area.
Pseudocode
 Input the width (W) and Length (L) of a rectangle
 Calculate the area (A) by multiplying L with W
 Print A
Example 3
Algorithm START

 Step 1: Input W,L Input

W, L
 Step 2: AL x W
 Step 3: Print A ALxW

Print
A

STOP
Flowcharts
 Flowcharts is a graph used to depict or
show a step by step solution using
symbols which represent a task.
 The symbols used consist of geometrical
shapes that are connected by flow lines.
 It is an alternative to pseudocoding;
whereas a pseudocode description is
verbal, a flowchart is graphical in nature.
Flowchart – sequence control structure

Statement 1

Statement 2

Statement 3

25
Flowchart – selection control structure

No Yes
Condition

else- then-
statement(s) statement(s)

26
Flowchart – repetition control structure

yes Loop
Condition
Statement(s)

no

Principles of Programming - NI July

2005 27
Flowchart – example 1
Begin

Read birth date

Calculate
Age = current year – birth date

Display
age

End

28
Flowchart – example 2
Begin

Read age

YES Age > 55? NO

print “Pencen” print “Kerja lagi”

End

29
Flowchart – example 5
Begin

sum = 0
current_number = 1

NO
current_number <= 10? print sum

YES
End
sum = sum + current_number
current_number = current_number + 1

30
Example 4
 Write an algorithm and draw a flowchart that
will calculate the roots of a quadratic equation
ax 2  bx  c 0
 Hint: d = sqrt ( b 2  4ac ), and the roots are:
x1 = (–b + d)/2a and x2 = (–b – d)/2a
Exercises: Algorithm &
Flowchart
1.) Create an algorithm and a flowchart that
will accept/read two numbers and then
display the bigger number.
Exercises: Algorithm &
Flowchart
2.) Create an algorithm and a flowchart that
will compute the area of a circle.
Exercises: Algorithm &
Flowchart
3.) Create an algorithm and a flowchart that
will compute the sum of two numbers. If
the sum is below or equal to twenty, two
numbers will be entered again. If the sum
is above 20, it will display the sum.
Lab Activity: Algorithm &
Flowchart
4) Create an algorithm and a flowchart that
will output the largest number among the
three numbers.
 Assignment 1
1. Create an algorithm and a flowchart that will output for g.c.d.
2. Create an algorithm and a flowchart that will output the factorial of a
given number.
3. Create an algorithm and a flowchart that will output the Fibonacci
series up to a given number.
4. Create an algorithm and a flowchart that will output all the prime
numbers between 2 numbers.