AQA GCSE Computer Science 3.1 Algorithms Homework Booklet

AQA GCSE Computer Science 3.1 Algorithms homework booklet: 5 homeworks students can do at home with no notes. Type or print. PDF and full answers included.

A ready-to-set homework booklet for AQA GCSE Computer Science (8525) 3.1 Fundamentals of Algorithms, designed so every student can complete it at home, whatever device they have.

5 homeworks, one per lesson (about 25 to 30 minutes each)

1. Computational Thinking: key terms, writing an algorithm, decomposition and abstraction
2. Flowcharts: choosing symbols, tracing a flowchart and drawing one
3. Tracing Algorithms: trace tables and spotting the purpose of an algorithm
4. Searching Algorithms: linear search, true or false, binary search stages
5. Sorting Algorithms: bubble sort pass by pass and merge sort

Designed for home learning

• Each homework starts with a “Remember” box of key facts, so no class notes are needed
• Every answer space is a box students can type into in PowerPoint or Google Slides, or write in on paper
• A PDF version for students who only have a phone
• Page 2 explains three ways to complete it: on paper, on a computer, or on a phone
• A homework tracker with due dates, and a confidence check at the end of each homework
• Exam-style questions in every homework

What’s included

• Student booklet (editable PowerPoint, A4, 16 pages)
• Student booklet (PDF)
• Full answer booklet with answers in red

Uses pseudocode only, so no programming knowledge is needed. Part of the AQA 3.1 Algorithms unit, also available as a complete bundle.