pdf, 279.02 KB
pdf, 279.02 KB
pdf, 238.72 KB
pdf, 238.72 KB

A complete, exam-style worksheet pack covering iteration and selection for AS/A Level Computer Science — ideal for classwork, homework, or revision.

What’s included:

Student Worksheet (5 pages) — 15 real-world programming tasks covering FOR loops, WHILE loops, MOD, compound conditions, accumulators, counters, and CASE statements, with clear scenarios
Teacher Answer Booklet (10 pages) — full pseudocode model answers written in standard AS Level pseudocode conventions (FOR…TO…NEXT, IF…THEN…ELSE…ENDIF, CASE OF…OTHERWISE…ENDCASE, MOD, UCASE()), plus a detailed point-by-point marking scheme for every question (77 marks total) with a mark summary table

Topics covered:

Count-controlled and condition-controlled iteration
Simple and compound selection
The MOD operator (odd/even, divisibility tests)
Accumulators and running totals
Finding maximum/minimum values
Multi-way selection using CASE statements
Combined tasks integrating iteration, selection, and counters

Why teachers will like it:

Progresses from simple loops through to combined iteration + selection + CASE challenges
Each question includes clear success criteria so students know exactly what to include
Ready-to-mark answer scheme saves prep time — perfect for self-marking, peer-marking, or quick teacher assessment
Editable Word format (.docx) — easy to adapt tasks, swap the target language, or adjust difficulty
Great for exam-board pseudocode practice (transferable to Python, VB, or written exam pseudocode)

Suitable for: AS/A Level Computer Science (Years 12–13), also useful as extension/challenge material for GCSE higher-ability students.

Format: 2 x Word documents (.docx)

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

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