AQA GCSE Computer Science 3.1 Flowcharts

AQA GCSE Computer Science 3.1 flowcharts lesson: all symbols, reading, tracing and drawing flowcharts. 32 slides with challenges, quiz and answers.

A complete, ready-to-teach lesson for AQA GCSE Computer Science (8525) 3.1.1, taking students from their first flowchart to drawing their own.

What’s included (32 editable slides)

• Learning objectives and a sequencing Do Now with answers
• Algorithms and flowcharts: what they are and how they connect
• One clear slide for each symbol: terminal, process, decision, input/output and flow line
• “Name That Symbol” check with answers
• Reading a flowchart: a worked example traced step by step
• “Trace It”: students find the output for different inputs, including a boundary value
• Group challenge: spot the four mistakes in a flowchart, with answers
• 10 differentiated challenges with drawn answer flowcharts for every one
• Four-question multiple-choice quiz with answer reveals

Teacher notes on every slide, including misconceptions, teaching suggestions and ways to check understanding.

Uses no programming language, so it can be taught before students learn to code. This is lesson 2 of 5 in the AQA 3.1 Algorithms unit, which is also available as a complete bundle with booklets, homework and assessments.