Algorithms: Clear Steps
This KS3 computing lesson explores Algorithms: Sequencing, Selection and Repetition. Students learn how precise step-by-step instructions solve problems and explore the core algorithmic concepts of sequence, selection and repetition. It provides a clear introduction to the topic and can be used for classroom teaching, homework or revision.
Algorithms: Clear Steps
This KS3 computing lesson explores Algorithms: Sequencing, Selection and Repetition. Students learn how precise step-by-step instructions solve problems and explore the core algorithmic concepts of sequence, selection and repetition. It provides a clear introduction to the topic and can be used for classroom teaching, homework or revision.
Algorithms, KS3 Computing, Computer Science, Algorithmic Thinking, Flowcharts, Pseudocode, Searching Algorithms, Sorting Algorithms, Decomposition, Problem Solving, MCQs, Open Questions, Polls, Emoji Polls, Exit Tickets
Learning goal
I can describe what an algorithm is and explain simple algorithms as precise, ordered instructions for solving a problem or completing a task.
Deze slide heeft geen instructies
What words come to mind when you hear algorithm?
Use this as a prior-knowledge activation. Expect words such as steps, order, computer, instructions, recipe or directions.
What is an algorithm?
An algorithm is a set of steps.
The steps are used to solve a problem or complete a task.
In computing, a computer follows the steps exactly.
Stress that an algorithm is the plan, not the finished result. A program is one way of putting an algorithm into code.
Algorithms are precise
A person can often guess what unclear instructions mean.
A computer cannot guess well.
That is why an algorithm must be clear, exact and easy to follow.
Common misconception: students may think 'roughly right' is enough. Emphasise that computers need unambiguous instructions.
Algorithms solve tasks
Algorithms are used for many kinds of tasks:
getting to a place
making something
controlling a machine
solving a calculation
Link this slide to familiar routines before moving into named examples.
Computing meaning
In computing, an algorithm tells a system what to do first, next and last.
If the steps are correct, the task should work the same way each time the algorithm is followed.
You can mention that different programs can use the same underlying algorithm.
Why order matters
The order of steps changes the result.
If steps are in the wrong sequence, the task may fail, stop too early or give the wrong output.
Use a quick spoken example such as putting cereal in after pouring milk, or putting clothes away before washing them.
What is an algorithm?
a set of steps
a finished result
a computer screen
a random guess
Checks the core definition from slides 2–5. Distractors target common confusion between plan, result and device.
Complete the paragraph
An algorithm is a set of steps used to solve a problem or complete a task. In computing, the system follows the steps in the correct order so the task can work the same way each time.
The blanks echo the lesson wording: steps, task and order are the load-bearing terms in this first block.
Sequence
Sequencing means putting steps in the correct order.
Example:
Put clothes in the washing machine.
Add detergent.
Choose a cycle.
Press start.
Keep focus on sequence as a basic feature of algorithms. Students do not need formal flowcharts here.
Why clarity matters
Good algorithms avoid vague words such as soon, some, a bit or over there.
Each step should say exactly what to do.
Point out that unclear language can lead two people to do different things, which means the algorithm is not reliable.
Example: directions
Directions can be an algorithm.
Walk to the corner.
Turn left.
Go straight for 200 metres.
Enter the school gate.
Show how this example depends on both order and precision. 'Go that way' would be too vague.
Example: a recipe
A recipe is a simple algorithm.
It gives ingredients, then steps, so someone can make the same food by following the same instructions.
This is a good place to mention that recipes often include repeated actions such as stir for 2 minutes or bake until done.
Example: washing machine
A washing machine cycle also follows an algorithm.
take in settings
wash
rinse
spin
finish
Use this to show that machines follow pre-set steps and do not 'decide' the process in a human way.
Everyday and computing examples
The same idea works in computing.
A computer can follow steps to sort items, search for something, or carry out a calculation.
The task changes, but the need for clear order stays the same.
Avoid going deep into specific coding algorithms; keep it at a simple conceptual level for KS3 introduction.
Which instruction is the most precise?
Go over there
Turn left soon
Walk a bit
Go straight 200 metres
Uses the directions example and the vague-word slide. Students should spot that exact distance makes the step clear.
Why does order matter in an algorithm?
Expected elements: a correct answer should explain that order matters because changing the sequence can change the result or make the task fail. Accept everyday examples such as recipe steps, washing clothes or directions.
Inputs and outputs
An algorithm often starts with an input and ends with an output.
Input: what goes in
Output: what comes out
Example: dirty clothes in → clean clothes out
You can also give a computing example aloud: numbers in → answer out.
Repeated steps
Sometimes an algorithm repeats a step.
This is called iteration.
Example: stir the sauce 10 times, or keep washing until the cycle is complete.
At this level, iteration just means repeating steps. No need to introduce loop syntax.
Basic features together
Many simple algorithms include:
sequence: steps in order
input: what is needed to start
output: the result at the end
iteration: steps that repeat
This is the summary slide for the lesson's core features. Keep terminology consistent from here on.
In dirty clothes in → clean clothes out, what is the output?
dirty clothes
washing machine
clean clothes
cotton cycle
Tests input/output using the washing machine example from the nearby slides.
Complete the summary
Many simple algorithms include sequence, which means steps in order. They may begin with an input and end with an output. Some also use iteration, which means repeated steps.
A recap of the four key features taught in slides 13–15.
Spotting problems
An algorithm may need improving if it:
misses a step
has steps in the wrong order
uses unclear words
does not say when to stop
These are the most useful checks for beginners. They connect directly to debugging later in computing.
From vague to clear
Vague: Wash the clothes and finish when they are done.
Clearer:
Put clothes in the machine.
Add detergent.
Select the cotton cycle.
Press start.
Remove clothes when the cycle ends.
Model how to improve an algorithm by replacing vague words with exact actions and a clear ending point.
Improving an algorithm
To improve an algorithm:
put the steps in the right sequence
make each instruction precise
include the input and output if needed
show any repeated steps clearly
Frame this as a practical checklist students can apply when reading or writing simple algorithms.
Which is a sign that an algorithm needs improving?
clear ending
correct order
unclear words
same result
Checks the problem-spotting checklist from slide 16 before students think about improvements.
How can you improve a vague algorithm?
Expected elements: students should suggest making the instruction more exact, adding missing steps if needed, putting steps in order, and saying clearly when to stop or finish.
Do you feel you understand algorithms now?
Deze slide heeft geen instructies
Glossary
algorithm - a set of precise, ordered steps used to solve a problem or complete a task
sequence - the correct order of steps in an algorithm
input - the information or items that go into an algorithm
output - the result produced by an algorithm
iteration - the repetition of one or more steps in an algorithm
precise - clear and exact, with no confusion about what to do
ambiguous - unclear, so it can be understood in more than one way
Deze slide heeft geen instructies