AQA GCSE Computer Science:

Complete revision booklet for AQA GCSE Computer Science (8525), Section 3.1 Fundamentals of Algorithms.

A 38 page professionally formatted workbook covering every learning objective in spec points 3.1.1 to 3.1.4, with exam practice and full mark schemes. Designed to stretch high-achieving students targeting Grades 7–9.
Includes:

1. Examiner-style definitions of algorithm, decomposition and abstraction
2. AQA standard pseudo-code reference, with side-by-side pseudo-code, Python and flowchart examples
3. Step-by-step mechanics of linear search, binary search, bubble sort and merge sort
4. Worked trace tables and algorithm comparison tables
5. 25+ exam-style questions in the AQA house style
6. Stretch & Challenge boxes for top-grade extension
7. Full 50-mark, 45-minute end-of-section mock paper
8. Complete mark schemes with model answers

Ideal for: revision lessons, homework, intervention, mock prep and independent study.

Fully editable A4 Word (.docx) file.