AQA GCSE Computer Science 3.1 Searching Algorithms Lesson

AQA GCSE Computer Science 3.1 lesson: linear and binary search with animations, pseudocode trace tasks, exam questions and answers. 22 editable slides.

A complete, ready-to-teach lesson for AQA GCSE Computer Science (8525) 3.1.3 Searching algorithms, including the comparison of efficiency from 3.1.2.

What’s included (22 editable slides)

• Learning objectives and a retrieval Do Now with answers
• Animated linear search demonstration, plus the steps of the algorithm
• Fill-in-the-blanks consolidation with answers
• Linear search pseudocode with a trace task and full trace table answer
• Animated binary search demonstration, showing every midpoint calculation
• Binary search steps and fill-in-the-blanks with answers
• Binary search pseudocode with a trace task and full trace table answer
• Comparison table of benefits and drawbacks
• Extended writing task with a model answer
• Exam-style questions with a mark scheme

Teacher notes on every slide, including the card-flip demonstration, misconceptions and teaching suggestions.

This is lesson 4 of 5 in the AQA 3.1 Algorithms unit, which is also available as a complete bundle with booklets, homework and assessments.