AQA GCSE Computer Science 3.1 Algorithms Unit

Complete AQA GCSE Computer Science 3.1 Algorithms unit: 5 lessons, work booklet, homework, assessments & answers. Flowcharts, tracing, searching & sorting.

Everything you need to teach AQA GCSE Computer Science (8525) section 3.1 Fundamentals of Algorithms, ready to use straight away. Every lesson, booklet and assessment comes with full answers, and all files are fully editable.

5 complete lessons (PowerPoint)

1. Computational Thinking: algorithms, decomposition and abstraction, including why an algorithm is not a computer program
2. Flowcharts: the flowchart symbols, reading, tracing and drawing flowcharts
3. Tracing Algorithms: trace tables and visual inspection to determine the purpose of simple algorithms
4. Searching Algorithms: linear and binary search, with step-by-step animations
5. Sorting Algorithms: bubble sort and merge sort, with worked examples of every pass

Every lesson follows the same clear structure:

• Learning objectives and a retrieval Do Now
• Clear explanations with worked examples (I do, we do, you do)
• Differentiated independent practice (green, amber and red challenges)
• Exam-style questions with mark schemes
• Detailed teacher notes on every slide, including misconceptions and teaching suggestions

Work booklet (A4, printable)
A 16-page student workbook covering the whole unit, with a key terms glossary and an end-of-unit RAG checklist. Full answer booklet included.

Homework booklet
Five homeworks, one per lesson, designed to be completed at home with no class notes needed. Each starts with a “Remember” box of key facts, and every answer box can be typed into on screen or written on paper. Supplied as PowerPoint and PDF, with a full answer copy.

Assessments

• Mid-unit written paper (40 marks) and end-of-unit written paper (60 marks), each with a detailed mark scheme
• Two multiple-choice quizzes (20 and 30 questions)
• Self-marking quizzes: a ready-made Google Apps Script builds each quiz in Google Forms for you, with answers, marks and feedback already set up. Step-by-step instructions for Microsoft Forms are also included.
• A teacher guide with answer keys

Additional activities

• 30 progressive Python trace table tasks (green to red), with answers
• Tracing Algorithms worksheet with answers
• Pseudocode to Python activity (13 tasks) with answers
• Python programs for bubble sort, merge sort, linear search and binary search

Why teachers will love it

• Matched to the AQA 8525 specification wording, including exam-board-style pseudocode
• 3.1 lessons use pseudocode only, so they can be taught before students learn to program
• Consistent, professional design across every resource
• Saves hours of planning and marking

Spec coverage (AQA 8525 3.1): algorithms, decomposition, abstraction, flowcharts, pseudocode, trace tables, determining the purpose of algorithms, comparing algorithm efficiency, linear search, binary search, bubble sort and merge sort.