TRANSFORMING
OPPORTUNITY
ACROSS SUB-SAHARAN
AFRICA
Introduction to Lecturer: Ms. Onalethata Matlhape
Programming BSc (Hons) Software Engineering
MEng Computer Engineering
Languages
Introduction to ALGORITHM
Programming DESIGN AND
Languages PROBLEM
SOLVING
LECTURE OUTLINE
• Fundamentals of algorithm development for engineering
tasks
• Problem decomposition and logic formulation
• Representation using pseudocode and flowcharts
• Case studies: algorithm design for sensor data handling,
voltage control, or system monitoring
ALGORITHMS AND FLOWCHARTS
• A typical programming task can be divided into two phases:
• Problem solving phase
o produce an ordered sequence of steps that describe solution of
problem
o this sequence of steps is called an algorithm
• Implementation phase
o 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.
o Information system flowcharts show how data flows from source documents through
the computer to final distribution to users.
o 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.
11
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.
Example
START
Input Step 1: Input M1,M2,M3,M4
M1,M2,M3,M4
Step 2: GRADE (M1+M2+M3+M4)/4
GRADE(M1+M2+M3+M4)/4
Step 3: if (GRADE <50) then
Print “FAIL”
N IS Y
GRADE<50
else
PRINT PRINT Print “PASS”
“PASS” “FAIL”
endif
STOP
Example 2
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 2
Algorithm START
• Step 1: Input W,L
• Step 2: A L x W Input
W, L
• Step 3: Print A
ALxW
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
:
Flowchart – selection control structure
No Yes
Condition
else- then-
statement(s) statement(s)
Flowchart – repetition control structure
yes Loop
Condition Statement(s)
no
Flowchart – example 1
Begin
Read birth date
Calculate
Age = current year – birth date
Display
age
End
Flowchart – example 2
Begin
Read age
YES Age > 65? NO
print “Pension” print “Keep working”
End
Flowchart – example 3
Begin
sum = 0
current_number = 1
current_number <= 10? NO
print sum
YES
End
sum = sum + current_number
current_number = current_number + 1
Example 4: Sensor Data Handling
Case Study:
A temperature sensor sends readings every second. You are required to
design an algorithm that collects 10 temperature readings, calculates the
average temperature, and displays an alert if any reading exceeds 40°C.
Task:
• Write a pseudocode algorithm that:
o Collects 10 readings from a temperature sensor
o Calculates the average of the readings
o Displays "High Temperature Alert!" if any individual reading exceeds 40°C
Example 4: Sensor Data Handling
Algorithm (Pseudocode):
START
Set counter = 0
Set total = 0
REPEAT 10 times:
Read temperature
Add reading to total
If reading > 40:
Display "High Temperature Alert!"
END REPEAT
Compute average = total / 10
Display average
Example 5: Voltage Control System
Case Study:
A voltage monitoring device must keep the voltage within a safe operating range (210V to 230V). If
the voltage goes below 210V, the system should increase it. If it goes above 230V, the system should
decrease it. Otherwise, it should display that the voltage is normal.
Task:
• Write a pseudocode algorithm that:
o Reads the current voltage value
o Takes action based on the value: increase, decrease, or maintain
o Displays the appropriate message based on the voltage level
Example 5: Voltage Control System
Algorithm (Pseudocode):
START
Read voltage value
IF voltage < 210:
Increase voltage
Display "Voltage too low – Adjusting"
ELSE IF voltage > 230:
Decrease voltage
Display "Voltage too high – Adjusting"
ELSE:
Display "Voltage normal"
Example 6: System Monitoring and Logging
Case Study:
A machine status logger records whether a machine is ON or OFF every 5 seconds.
After 1 minute (12 readings), the system must report how many times the machine
was ON and how many times it was OFF.
Task:
• Write a pseudocode algorithm that:
o Collects 12 status readings over 1 minute
o Counts how many times the status was ON and how many times it was OFF
o Displays the final count of ON and OFF states
Assignment 1
1. Create flowcharts for examples 4 and 5 in the lecture slides.. For example 6 create
both the algorithm and a flowchart.
2. Create an algorithm and a flowchart that will accept/read two numbers and then
display the bigger number.
3. Create an algorithm and a flowchart that will compute the area of a circle.
4. 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.
5. Create an algorithm and a flowchart that will output the largest number among the
three numbers.
Summary
• Fundamentals of algorithm development for engineering tasks
• Problem decomposition and logic formulation
• Representation using pseudocode and flowcharts
• Case studies: algorithm design for sensor data handling, voltage
control, or system monitoring
Thank you Onalethata
Matlhape
www.bothouniversity.com
