AQA GCSE Computer Science 3.1 Computational Thinking Lesson

AQA GCSE Computer Science 3.1 lesson on algorithms, decomposition and abstraction. 30 slides, Do Now, practice, exam questions, quiz and all answers.

A complete, ready-to-teach lesson for AQA GCSE Computer Science (8525) 3.1.1, covering the definitions students must know word for word.

What’s included (30 editable slides)

• Learning objectives and a “jam sandwich” Do Now that introduces algorithms, with an example answer
• Algorithms: the specification definition with everyday examples
• Algorithm vs computer program: why a program is an implementation of an algorithm
• True or False check with answers
• Decomposition: tree diagrams showing sub-problems broken down further
• “Decompose It” guided task with answers
• Abstraction: a train map example showing what is removed and what is kept
• “Keep or Remove?” abstraction task with answers
• Six differentiated challenges (green, amber, red) with full answers
• Exam-style questions with a mark scheme
• Interactive quiz: students click an answer and see straight away if they’re right

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 1 of 5 in the AQA 3.1 Algorithms unit, which is also available as a complete bundle with booklets, homework and assessments.