International University

MICRO-PROCESSING
SYSTEM
Lecture 3:
ALGORITHMS AND FLOWCHARTS

Vo Minh Thanh, M.Eng

School Of Electrical Engineering
1
 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
 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
 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
Basic
Name Symbol Use in Flowchart

Oval Denotes the beginning or end of the program

Parallelogram Denotes an input operation

Rectangle Denotes a process to be carried out

e.g. addition, subtraction, division etc.

Diamond Denotes a decision (or branch) to be made.

The program should continue along one of
two routes. (e.g. IF/THEN/ELSE)

Hybrid Denotes an output operation

Flow line Denotes the direction of logic flow in the program

 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 Y
IS
GRADE<50

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.

15
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.

16
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.

17
Flowchart – sequence control structure

Statement 1

Statement 2

Statement 3

18
Flowchart – selection control structure

No Yes
Condition

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

19
Flowchart – repetition control structure

yes Loop
Condition
Statement(s)

no

20
Flowchart – example 1
Begin

Read birth date

Calculate
Age = current year – birth date

Display
age

End

21
Flowchart – example 2
Begin

Read age

YES Age > 55? NO

print “young” print “old”

End

22
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

23
Exercise 3: For Loop

AVR Assembler Code

; For loop - count from 0 to 5

LDI R16, 0 ; Initialize counter
ForLoop:
CPI R16, 5 ; Compare counter with 5
BGE End ; Branch to End if counter >= 5
INC R16 ; Increment counter
RJMP ForLoop ; Repeat loop
End:

Flow Solution

1. Start
2. Initialize counter to 0
3. Compare counter with 5
4. If counter >= 5, go to End
5. Increment counter
6. Repeat loop
7. End

Function

Counts from 0 to 5 using a for loop.

Exercise 1: Simple If-Else

AVR Assembler Code

; Check if a number is greater than 5

LDI R16, 6 ; Load 6 into R16
LDI R17, 5 ; Load 5 into R17
CP R16, R17 ; Compare R16 and R17
BGT Greater ; Branch if R16 > R17
; Else
; R16 is not greater
Greater:

Flow Solution

1. Start
2. Load 6 into R16
3. Load 5 into R17
4. Compare R16 and R17
5. If R16 > R17, go to Greater
6. R16 is not greater
7. End

Function

Checks if the number (6) is greater than another number (5).