Algorithms as Step-by-Step Instructions
Algorithms as Step-by-Step Instructions
Lesduur is: 50 minOnderdelen in deze les
Algorithms as Step-by-Step Instructions
Open by linking algorithms to everyday routines pupils already know, such as getting dressed or brushing teeth. Emphasise that computing uses clear instructions in the right order.
Our learning goal
I can explain that an algorithm is a set of step-by-step instructions and create one in the correct order.
Deze slide heeft geen instructies
What steps do you do every morning?
Use this as a prior-knowledge activation after the learning goal. Encourage short routine words or phrases such as wake up, teeth, dressed, breakfast. Link their ideas to algorithms being everyday step-by-step instructions.
About this lesson
This KS1 computing lesson explores Algorithms as Step-by-Step Instructions. Pupils follow and create precise sequences of instructions, then predict what will happen when the order is changed. It is suitable for classroom teaching, independent practice or a clear recap of the topic.
Keep this slide exactly as written because the teacher requested the SEO introduction verbatim on its own slide.
What is an algorithm?
An algorithm is a set of instructions.
It tells us what to do and what order to do it in.
Use simple spoken examples such as making toast or lining up for lunch. For KS1, avoid technical overload and keep returning to the idea of ordered steps.
We use algorithms every day
Everyday routines can be algorithms.
wake up
get dressed
brush teeth
go to school
Stress that computers need instructions just like people do, but computers follow them exactly and do not guess missing steps.
Instructions must be in order
If the steps are in the right order, the job works.
If the order changes, the result can change too.
The order of steps is important in computing.
This is a key idea for the whole lesson. You can act out a silly mixed-up routine, such as putting on shoes before socks, to make the point memorable.
A simple algorithm
Example: washing hands
turn on the tap
wet your hands
use soap
rub your hands
rinse
dry your hands
Read the steps aloud in sequence. Point out that each step is clear and small enough to follow.
What is an algorithm?
a set of steps
a computer screen
a toy robot
a fast guess
Checks the core definition from slides 3 to 6. Distractors reflect likely confusions with computing equipment or guessing.
Complete the hand-washing algorithm
To wash our hands, we follow an algorithm with clear steps. First, turn on the tap and wet your hands. Then use soap, rinse, and dry your hands at the end.
Reinforces that an algorithm is a sequence of clear steps and revisits the exact hand-washing example from the content slide.
What can happen if steps are muddled?
Expected answer elements: because the steps are in the wrong order, the job may not work properly, and the result can change. Accept simple child-friendly answers such as 'it goes wrong' or 'it changes'.
Clear steps help us
Good algorithms are:
clear
in order
easy to follow
complete
Missing or muddled steps can cause mistakes.
Introduce the idea of precision in child-friendly language: computers need clear instructions because they only do exactly what they are told.
People and computers follow algorithms
People can follow instructions.
Computers can also follow instructions.
A computer program is built from algorithms.
Keep this rooted in computing: the point is not just routines, but that algorithms are used to make computers do jobs.
Computers need exact instructions
A person might guess what you mean.
A computer does not guess.
If an instruction is unclear, the computer may do the wrong thing or stop.
Useful misconception to address: children may think computers are ‘clever’ in the same way people are. Emphasise that computers follow instructions exactly.
Algorithms can control devices
Algorithms can tell a device what to do.
For example, a floor robot might:
move forwards
turn left
stop
Link to familiar KS1 computing experiences such as Bee-Bots or simple programmable toys. Keep examples concrete and physical.
What happens if we change the order?
Changing the order can change the result.
Example:
pour cereal
add milk
This works differently from:
add milk
pour cereal
Invite pupils to notice that both versions are possible, but the result is not the same. This prepares them to predict outcomes when steps change.
Order matters in computing
In computing, steps happen one after another.
Step 1 → Step 2 → Step 3
If one step moves, the algorithm may not work as planned.
Use the arrow notation here because the sequence itself is the concept. Keep the idea simple: one step follows the next.
Missing steps cause problems
An algorithm also needs all the important steps.
If we miss a step, the task may fail.
Example: if we forget use soap, our hand-washing algorithm is not complete.
Highlight that algorithms are not just about order; they must also include the necessary steps.
Who follows instructions exactly?
a friend
a computer
a teacher
a parent
Based on slides 8 to 13. Emphasise that people may guess, but computers do not guess.
If a step is missing, what may happen?
it grows bigger
it gets louder
the task may fail
the steps vanish
Checks understanding that algorithms need all important steps, not just the right order.
Complete the computing sentences
People and computers can follow instructions. A computer does not guess. If a step is unclear or missing, the task may not work.
Echoes the wording from slides 8 to 13 and checks the ideas of exactness and completeness.
Creating an algorithm
When we make an algorithm, we:
think about the task
break it into small steps
put the steps in order
check that they make sense
This slide sets up pupils to make their own algorithms. The phrase ‘small steps’ is important and age-appropriate.
Example: getting ready for bed
A bedtime algorithm could be:
put on pyjamas
brush teeth
choose a story
get into bed
go to sleep
Make clear that there can be more than one sensible algorithm for a familiar routine, as long as the steps are clear and ordered.
Checking an algorithm
After making an algorithm, we check:
Is each step clear?
Are the steps in order?
Is anything missing?
Will it work?
This mirrors simple debugging without introducing heavy vocabulary too early. You may mention that checking helps us fix mistakes.
Which algorithm would you like to make?
getting dressed
bedtime routine
washing hands
using a robot
Deze slide heeft geen instructies
What should you do after making an algorithm?
hide it
check it
mix it up
rush it
Based on slides 14 to 16. This supports the practical application block by reminding pupils to review clarity, order and missing steps.
Complete the making-an-algorithm steps
When we make an algorithm, we think about the task. Then we break it into small steps, put them in order, and check that they make sense.
Useful before or during a practical class task where pupils create their own simple algorithm.
Algorithms help us solve tasks
Algorithms are useful because they help us:
organise a job
give clear instructions
make computers do tasks
spot mistakes and fix them
Land the lesson by connecting everyday instructions to computing purpose: algorithms are how we plan and control actions.
What is one thing you learned today?
Reflection exit ticket. Invite pupils to name one idea such as 'algorithms are steps', 'order matters', 'computers do not guess', or 'check for missing steps'.
What helped you understand best?
Reflection exit ticket. Encourage metacognitive answers about what supported learning, for example the hand-washing example, robot example, acting out mixed-up steps, or making their own algorithm.
Glossary
algorithm - a set of step-by-step instructions
instruction - something that tells you what to do
order - the sequence that steps go in
sequence - steps arranged one after another
computer - a machine that follows instructions
program - instructions for a computer
step - one part of an algorithm
Deze slide heeft geen instructies
