Algorithms and Flowcharts

Algorithms and Flowcharts

This GCSE computing lesson explores Algorithms and Flowcharts. Students design, read and improve flowcharts using standard symbols to represent sequence, selection, iteration, input, output and processing. It supports KS4 classroom teaching, independent study and exam revision using clear, subject-specific vocabulary.

1 / 27
volgende
Slide 1: Slide
newEditorComputingUpper Secondary (Key Stage 4)GCSE

In deze les zitten 27 slides, met interactieve quizzen en tekstslides.

time-iconLesduur is: 55 min
Dit is niet oké

Onderdelen in deze les

Algorithms and Flowcharts

This GCSE computing lesson explores Algorithms and Flowcharts. Students design, read and improve flowcharts using standard symbols to represent sequence, selection, iteration, input, output and processing. It supports KS4 classroom teaching, independent study and exam revision using clear, subject-specific vocabulary.

Flowcharts, KS4 Computer Science, GCSE Computer Science, Flowchart Symbols, Algorithms, Process, Decision, Input/Output, Start/Stop, Terminals, Pseudocode, Algorithm Design, Control Flow, Problem Solving, MCQs, Open Questions, Polls, Emoji Polls, Exit Tickets

Learning goal

I can understand what algorithms and flowcharts are, and represent a simple problem-solving process using standard flowchart symbols and logical sequence.

Deze slide heeft geen instructies

What everyday tasks use step-by-step instructions?

Use this to activate prior knowledge. Expect ideas such as recipes, directions, getting dressed, sorting items, or game rules. Link student answers to the idea of algorithms before moving on.

What is an algorithm?

An algorithm is a precise, step-by-step set of instructions for solving a problem or completing a task.


It must tell the user exactly what to do, in the correct order, so the same process can be followed each time.

Emphasise that an algorithm is not only for computers. It can describe human tasks too, as long as the instructions are exact.

Algorithms in everyday life

  • following a recipe

  • sorting items into groups

  • deciding what to wear if it is raining

  • giving directions from one place to another

Use these examples to show that algorithms are familiar before linking them to computing.

What makes a good algorithm?

  • Clear: each step is easy to understand

  • Ordered: steps are in the correct sequence

  • Unambiguous: each instruction has one meaning only

  • Complete: the task can be finished by following the steps

Students often write vague instructions such as 'do it properly' or 'sort them'. Point out that a computer cannot interpret unclear wording.

Why precision matters

If an algorithm is vague or out of order, it may fail.


For example, "put the cake in the oven" only works if earlier steps explain the mixture, the tin, and the oven temperature. Small mistakes in sequence can change the result completely.

Link this to computing: computers follow instructions literally, so missing or unclear steps lead to wrong outputs.

Simple decision algorithms

Some algorithms include a choice.


Example:

Check the weather → if it is raining, take a coat → if it is not raining, do not take a coat.


This is still step-by-step, but the next step depends on a condition.

This slide prepares students for branching in flowcharts. Stress that a decision changes the path through the algorithm.

Which feature is most important in a good algorithm?

A

Bright colours

B

Clear steps

C

Long sentences

D

Fancy symbols

Tests the core idea from slides 2-6 that algorithms must be clear, ordered, unambiguous and complete. Distractors are plausible because students may confuse presentation with quality.

Complete the summary

An algorithm is a precise, step-by-step set of instructions. A good algorithm is ordered so the steps happen in the correct sequence. It should also be unambiguous, so each instruction has only one meaning. Some algorithms include a decision that changes the next step.

algorithm
ordered
unambiguous
decision
flowchart
random
rectangle
arrow

The blanks target the load-bearing terms from the first subtopic. Students should use meaning, not guesswork, to place each term.

Why can a vague algorithm fail?

Expected elements: an answer should mention that vague instructions can be misunderstood, steps may happen in the wrong order, and the task may fail or give the wrong result because computers follow instructions exactly.

What is a flowchart?

A flowchart shows an algorithm visually.


Instead of writing only words, it uses standard symbols and arrows to show the steps, the order, and any decisions in the process.

Make the link explicit: an algorithm is the instructions; a flowchart is one way to represent those instructions.

Key flowchart symbols

  • Start/End: oval

  • Process: rectangle

  • Input/Output: parallelogram

  • Decision: diamond

Students do not need advanced symbols here. Keep to the four named in the lesson goal and ensure they can match symbol to purpose.

What each symbol means

  • Start/End marks where the algorithm begins or finishes

  • Process shows an action or instruction

  • Input/Output shows data being entered or results being shown

  • Decision asks a yes/no question

If useful, give quick examples: 'Enter age' for input, 'Display total' for output, 'Is age over 18?' for decision.

Arrows and control flow

Arrows show control flow: the direction the algorithm follows.


They connect symbols in sequence, showing what happens next. Without arrows, the order of the steps may be unclear.

Use the term control flow clearly and reuse it later. Students should understand arrows as more than decoration: they show direction and sequence.

Branching in a flowchart

A decision symbol creates branching.


One arrow is labelled Yes and the other No. Each branch leads to a different next step, depending on the answer to the question.

Common misconception: students may write a statement instead of a yes/no question inside the diamond. Model a proper question form.

Which symbol shows a yes/no question?

A

Rectangle

B

Diamond

C

Oval

D

Parallelogram

Checks recognition of the decision symbol after slides 7-11. Common confusion is between process and decision.

Complete the flowchart description

A flowchart shows an algorithm visually. The oval marks the start or end. A rectangle shows a process, and arrows show the control flow through the steps. A decision creates branching with Yes and No paths.

flowchart
oval
rectangle
control flow
algorithm
diamond
sequence
input

Reinforces the meaning of symbols and the term control flow. Each blank has one clear position from context.

From algorithm to flowchart

To turn an algorithm into a flowchart:

  • identify the start

  • place each action in order

  • mark any input or output

  • add decision points where choices happen

  • connect everything with arrows

Keep the conversion method practical and simple. This is the bridge from written steps to visual representation.

Example: choosing a coat

  • Start

  • Check weather

  • Is it raining?

  • Yes: take a coat

  • No: do not take a coat

  • End

This is the plain-language algorithm that could be drawn as a flowchart. Keep attention on sequence and the yes/no decision.

Reading a flowchart back into words

A flowchart can be interpreted as plain language by following the arrows from Start to End.


Each symbol becomes part of a sentence: actions become instructions, and decision branches become "if... then..." choices.

Students should see that representation works both ways: written algorithm to flowchart, and flowchart back to written algorithm.

Why flowcharts are useful

  • make the order of steps easy to see

  • show decisions clearly

  • help spot missing steps

  • make an algorithm easier to explain to others

You can mention that flowcharts are often used when planning programs before writing code, but keep the focus on representation, not programming syntax.

What should you do first when making a flowchart?

A

Add arrows

B

Label Yes/No

C

Find the start

D

Draw outputs

Based on slide 12. Distractors come from real steps in the process, but not the first one.

How would you say the coat flowchart in words?

Expected elements: students should describe the sequence from Start, checking weather, asking 'Is it raining?', then branching to 'take a coat' for Yes and 'do not take a coat' for No, ending at End.

Do you feel your knowledge of alogrithms and flowcharts has increased?

Deze slide heeft geen instructies

Glossary

algorithm - a precise, step-by-step set of instructions for solving a problem or completing a task

flowchart - a visual diagram that shows the steps in an algorithm

sequence - the correct order in which steps happen

unambiguous - clear and having only one meaning

process - an action or instruction shown in a rectangle

input/output - data entered into a system or results produced by it

decision - a yes/no choice shown in a diamond

Deze slide heeft geen instructies

Glossary

start/end - the beginning or finish of a flowchart, shown by an oval

control flow - the path followed through an algorithm or flowchart

branching - when a decision splits the flow into different paths

Deze slide heeft geen instructies