AQA GCSE Computer Science (8525) 3.1 Fundamentals of Algorithms + Mark Scheme
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:
Examiner-style definitions of algorithm, decomposition and abstraction
AQA standard pseudo-code reference, with side-by-side pseudo-code, Python and flowchart examples
Step-by-step mechanics of linear search, binary search, bubble sort and merge sort
Worked trace tables and algorithm comparison tables
25+ exam-style questions in the AQA house style
Stretch & Challenge boxes for top-grade extension
Full 50-mark, 45-minute end-of-section mock paper
Complete mark schemes with model answers
Ideal for: revision lessons, homework, intervention, mock prep and independent study.
Fully editable A4 Word (.docx) file.
