ÌÇÐÄVlog

Please consent to cookies to view content.

' ); iframeDoc.close(); } } } } } const observer = new MutationObserver(switchSrc); observer.observe(document.documentElement, { childList: true, subtree: true, }); })();

ÌÇÐÄVlog

Last updated

10 November 2026

pptx, 249.32 KB
pptx, 249.32 KB
pptx, 242.37 KB
pptx, 242.37 KB

Standalone AQA GCSE algorithms work booklet written in AQA pseudocode: 9 lessons, worked examples, extension tasks, exam-style questions and full answers.

A 58-page booklet that students can work through on their own or alongside your lessons. Every lesson uses the same six colour-coded pages, so students always know what comes next. It suits normal lessons, cover lessons, homework, catch-up and revision.

9 lessons

  • Computational Thinking (decomposition, abstraction, algorithmic thinking)
  • Flowcharts
  • Writing Algorithms (sequence, selection, iteration)
  • Trace Tables
  • Linear Search
  • Binary Search
  • Bubble Sort
  • Merge Sort
  • Comparing Algorithms (efficiency)

Every lesson has six pages

  • Learn: “Today I will…â€� goals, a “What you need to knowâ€� explanation with the key terms in bold, and a key words table
  • Example: a “Watch meâ€� worked example with numbered notes, the two most common mistakes, and an exam tip
  • Practise: fill the gaps from a word bank, choose the answer (tick one box), and finish the code, flowchart or trace table
  • Apply: put the steps or lines of code in order, then “Have a go!â€� with a tick-box checklist of steps and a hint
  • Review: spot the mistake, finish a sentence to explain the idea, match the key words, and a “How did I do?â€� traffic light
  • Extend: extra independent practice: four quick-fire questions, an exam-style question with marks, and a challenge task. Ideal for homework, early finishers and revision.

Written for AQA 8525
All code uses AQA pseudocode (�, =, ≠, IF…THEN…ENDIF, FOR…ENDFOR, WHILE…ENDWHILE, USERINPUT, LEN())
Covers the two sorting algorithms AQA requires, bubble sort and merge sort, plus a full lesson on comparing the efficiency of searching and sorting algorithms
Designed so students can learn independently
Each topic is explained in short, clear sentences before students attempt any tasks

  • Searches and sorts are shown step by step with highlighted number boxes
  • Flowcharts are drawn with the correct symbols
  • Trace tables are completed row by row
  • “Spot the mistakeâ€� tasks cover the errors students really make, such as starting a loop at index 1, binary searching an unsorted list, or stopping a bubble sort after one pass
  • 9 original exam-style questions, with the answer booklet showing where each mark is earned
  • Key word glossary and a “What can I do now?â€� checklist at the back

What’s included

  • Student booklet (editable PowerPoint, A4, 58 pages, prints as a folded booklet)
  • Student booklet (PDF)
  • Teacher answer booklet, with every answer in red

Every answer has been checked step by step, including each sort pass, search midpoint and trace table value.

Teaching OCR? An OCR version written in OCR Exam Reference Language is also available. Search “Logic Page� on TES.

Want more? Logic Page also makes complete GCSE Computer Science units: lessons, work booklets, homework and assessments, all with answers. Search “Logic Page� on TES.

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

to let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.