Fundamentals of algorithms – AQA GCSE CS (14 lessons)

14 ready-to-teach lessons for AQA GCSE Computer Science (8525): Fundamentals of algorithms. Every lesson has editable PowerPoint slides, a student worksheet and full answers, and the bundle costs less than buying the lessons one by one. A complete, ready-to-teach bundle for AQA GCSE Computer Science (8525): Section 3.1 Fundamentals of algorithms, in 14 bespoke lessons. Every lesson comes with: - **Editable PowerPoint slides**: goals, starter, explanations, diagrams, worked examples, a quick check, a task and an exit ticket, with teacher notes - **Student worksheet (Word)**: recall, applied practice and exam-style questions with marks - **Answer sheet (Word)**: full mark-scheme style answers Worth £69.86 if bought lesson by lesson. ## What's inside - **AQ1.01** What is an algorithm? - **AQ1.02** Decomposition and abstraction - **AQ1.03** Flowcharts and AQA pseudo-code - **AQ1.04** Input, processing and output - **AQ1.16** Trace tables - **AQ1.39** Linear search - **AQ1.40** Binary search - **AQ1.41** Comparing searches - **AQ1.42** Bubble sort - **AQ1.43** Merge sort - **AQ1.44** Comparing sorts - **AQ1.45** Programming practice: search and sort - **AQ1.46** Programming practice: planning a solution - **AQ1.48** Paper 1 skills: tracing and purpose ## Why teachers use it - Mapped lesson by lesson to the specification, so coverage is easy to track - Python 3 throughout, with AQA pseudo-code alongside so students can read exam algorithms - Fully editable: adapt to your class, timings and school template - Works for teaching, revision, cover lessons and homework These are independent resources written for the AQA GCSE Computer Science specification (8525, version 1.3), for exams from 2027. They are not produced or endorsed by AQA. Spec point numbers are our own numbering of the specification statements. Last updated: November 2026.