← GCSE Computer Science

P04 3.2.2 Definite (count-controlled) iteration (FOR)

Currently Developing · last touched 2026-10-21

Total version traced and written cold in a later session.

Every change

WhenChangeEvidenceSession
2026-10-21Developing → Developingpaper #10 Q8: 0/1, loss=technique — total+i over 1 TO 5 answered 13; loop rewritten in Python instead of traced; running-total trace from session 117 still owedsession 127
2026-10-20Developing → Developing19 Oct: count = count + 1 inside the loop unprompted; with one hint wrote count = count + x for a running total. Trace of the total version not run.session 117
2026-09-28Developing → DevelopingPlacement paper 1 Q7, 27 Sep: range(2, 9, 3) → 2,3,4,5,6,7,8,8,7,6,5,4 — the step argument not understood, 0/2. Status unchanged (developing): two-argument range and the accumulator loop are held; three-argument range untaught.standalone
2026-09-28Developing → DevelopingPlacement Q7: range(2, 9, 3) → wrote 2,3,4,5,6,7,8,8,7,6,5,4 — the step argument not understood. 0/2, 27 Sep. Three-argument range untaught.session 52
2026-09-25Gap → DevelopingCorrection (parent, 25 Sep): the 22 Sep audit reversion to gap misapplied the promotion rule — gap and notstarted share level 0, so session 41's notstarted → developing was one level, not two. Session 41 evidence stands: fresh 4-mark running-total exit ticket 4/4 unaided, handwritten copy same logic, two production checks passed; 24 Sep starter trace 1,3,6 and spot-the-error unaided. Developing bar met.standalone
2026-09-24Gap → Gap24 Sep starter, no notes: running-total for-loop trace values '1, 3, 6' correct; spotted both errors in `for i in range[1, 6]` (square brackets, missing colon) unaided.session 45
2026-09-22Developing → Gapaudit: session 41 moved P04 notstarted→developing, a two-level jump breaching the single-level-per-session rule (P17/P03 precedent, 11/15 Sep). Reverted to gap; the session's evidence — exit ticket 4/4 unaided, handwritten copy same logic, two production checks passed — stands as a proposed developing, to confirm in a later session.standalone
2026-09-22Not started → Developing22 Sep exit ticket, fresh 4-mark task (sponsored walk): cost = 0 / for i in range(1,8): / money = int(input()) / cost = cost + money / print(cost), unprompted, first attempt, no hint; then handwritten and photographed, same logic. 4/4 on logic. Gap check 2 (count = count + 1) after two narrowings. Starter 2/2 unaided. Developing bar met: taught 17–21 Sep, supported practice, exit ticket passed. Secure needs an independent retest on a different loop task later.session 41
2026-09-21Not started → Not started21 Sep: starter prediction 6, 9, 12 unaided. Accumulator built on paper line by line: wrote jar = held + jar unprompted (+, not *); traced i = 3 → 6, 12 once narrowed to numbers; chose print-after-loop from an A/B pair after two 'I don't know's; wrote total = score + total unprompted in gap check 1. Gap check 2 and the fresh handwritten exit ticket not run — stopped at her request. Proposed developing; not moved: exit ticket not yet passed.session 36
2026-09-18Not started → Not started18 Sep: 'Add them up' reported 3/3 ("all"); trace of total over range(2, 5) → 2, 5, 9 and "line 4 and 9" unaided; handwritten exit ticket 2/4 over 3 attempts (~30 min): for i in range(1, 11):, indentation and print-after-loop correct ×3, × self-corrected to *; running total never produced — Money = Save * i, then save = save * i twice after the + pattern was displayed; total = 0 never written. Model shown at the close. Proposed developing for the loop construct; accumulator not yet produced.session 33
2026-09-17Not started → Not startedTaught 17 Sep from zero: worked example for i in range(1, 6) line by line; say-back 'it shows numbers in a range' corrected; listed 1–5 unaided; predictions 2/2 unaided (range(3,7) → 3 4 5 6; i*10 → 10 20 30); Code Lab 'Times table' 3 runs no hint (run 30); running-total trace 1,3,6 unaided; 'Add them up' wrote total = n + i, fixed after a side-by-side compare, verdict unseen. No exit ticket, no handwritten code. Proposed developing; not moved.session 29

In papers

AttemptPaperQMarksNote
Exam practice — week 43 · lang, lit, cs — GCSE Computer Science sectionexam-skills #1080/113 (R). Working is a Python rewrite, no trace table, no row before the loop, total never tracked; 1+2+3+4+5 never written though she restated the loop correctly. loss=technique (no trace).
Placement — Computer Science paper 1 (Python) — GCSE Computer Science sectionexam-skills #170/2'2, 3, 4, 5, 6, 7, 8, 8, 7, 6, 5, 4' — three-argument range not understood; no partial pattern matches the scheme. 0/2.

Materials

Craig'n'Dave: The three basic programming constructs
Count-controlled iteration (FOR). Pair with Code Lab p04-table and p04-sum.
video
notes
PMT: Programming (notes, flashcards, questions)
Free, no login. Retrieval layer after teaching.
practice
AQA 8525 specification v1.3 (first teaching Sept 2025, exams June 2027 onwards)
THE document to teach to. Sections 3.1–3.8 are the syllabus; the right-hand 'additional information' column gives the depth limits. Verified 5 Sep 2026.
notes
AQA Summary of changes (8525), June 2025 — what was removed for 2027
Removed: Von Neumann as a named model, optical storage, LAN topologies, Ethernet, Wi-Fi, UDP, FTP, alternative link-layer names. Void these questions on any 2022–2026 paper.
notes
AQA 8525 overview page (specs, teaching guides, sample papers)
Stable entry point if any file link below dies. Lists both spec versions and the 2027 sample materials.
other
AQA subject-specific vocabulary (first exam 2027)
The terminology examiners expect. Use for retrieval starters and to check definitions in written answers.
notes
AQA Notes and guidance: Pseudo-code (8525/1)
Every algorithm in a question paper uses this pseudo-code. She must READ it fluently; she need not write in it.
notes
AQA Notes and guidance: Python (8525/1)
The exact Python style AQA uses in question papers and mark schemes. Use if Python 3 is the chosen language.
notes
AQA Notes and guidance: C# (8525/1)
The exact C# style AQA uses in question papers and mark schemes. Use if C# is the chosen language.
notes
AQA Notes and guidance: VB.NET (8525/1)
The exact VB.NET style AQA uses in question papers and mark schemes. Use if VB.NET is the chosen language.
notes
AQA Notes and guidance: 8525/1 Marking guidance (coded solutions)
FOR THE MARKER. AQA's examiner rulebook: logic over syntax, indentation rules per language, design marks, meaningful variable names, typing rules, records. Read before marking any code question. Verified 5 Sep 2026.
notes
Specimen Paper 1 (Python) 8525B/1 — sample assessment materials
Official specimen, 90 marks, 2h. Paper 1 content unchanged for 2027, so fully usable. Handwrite the code answers.
paper
Specimen Paper 1 (VB.NET) 8525C/1 — sample assessment materials
VB.NET variant of the same specimen. The C# variant (8525A/1) is on the AQA assessment-resources page.
paper
Specimen Paper 1 mark scheme (all three languages) 8525/1
Mark against the section for her language only. Shows the 'Mark A/B/C' feature-marking and 'max N if any errors' caps.
paper
Sample Paper 2 question paper — Sample set 1 (first exam 2027) 8525/2
The ONLY official Paper 2 on the 2027 content. Use as the first full Paper 2 mock. 90 marks, 1h45.
paper
Sample Paper 2 mark scheme — Sample set 1 (first exam 2027) 8525/2
Contains the level-of-response band descriptors and flags the Von Neumann question as no longer asked from 2027.
paper
June 2023 Paper 2 question paper 8525/2 (legacy spec)
LEGACY: void any question on Von Neumann, optical storage, topologies, Ethernet, Wi-Fi, UDP, FTP and reduce the maximum before marking.
paper
June 2023 Paper 1 (VB.NET) question paper 8525/1C (legacy spec)
Paper 1 is unaffected by the 2027 changes. The 1A (C#) and 1B (Python) variants of the same paper are on the AQA past-paper finder.
paper
June 2023 Paper 1 mark scheme 8525/1 (all languages)
Covers 1A, 1B and 1C. Note the examiner 'I.' (ignore) lists — the compile tolerance in practice.
paper
June 2023 Paper 1 examiner report 8525/1
What real candidates got wrong. Key lines: design marks exist even for wrong code; attempt every coding question; the indentation grids are misused.
notes
June 2022 Paper 1 mark scheme 8525/1 (all languages)
Legacy but Paper 1 content is unchanged. Question paper via the past-paper finder.
paper
AQA past-paper finder (2022–2024 papers, mark schemes, examiner reports, modified papers)
Search 8525. The most recent series (2025, 2026) are login-gated for about a year — ask the exam centre. 2027 is the first series on the new content.
other
AQA 8525 assessment resources page
The file list renders in-browser only. Filter by 'Sample papers' for the C# specimen (8525A/1).
other
AQA GCSE grade boundaries — June 2024 (contains 8525A/B/C rows, out of 180)
Legacy proxy only. The tracker holds the 8525C row. Look up 8525A or 8525B here once the language is chosen. No 2027 boundaries exist until August 2027.
other
AQA GCSE subject grade boundaries — June 2025
Most recent legacy series. Directional only.
other
AQA GCSE exam timetable May/June 2027 (version 1.0)
8525/1A/1B/1C Monday 10 May 2027 am; 8525/2 Wednesday 19 May 2027. Confirm with the centre.
other
AQA private candidates page
PARENT: the centre must sign the Practical Programming Statement (spec 5.1) and declare the Paper 1 language at entry. Confirm both in writing early.
other