Read the map from the bottom. Year 7 starts on the left, and the line climbs through Years 8 and 9 into IGCSE, then on to IB in the sixth form.
Dashed rings mark this half-term's units. Taught half-terms are ticked in the year plans.
When each Year 7–9 unit is taught. Select a unit to see its lessons.
Cambridge IGCSE Computer Science (0478) across Years 10 and 11, 3 lessons a week. Select a topic to see what it covers and open its lessons.
IB Diploma Computer Science for the 2027 exams, across Years 12 and 13, 4 lessons a week. It follows the IB's suggested order: A1 to A3 and then programming (B1 to B3) in Year 12; the internal assessment, A4 Machine learning and the Paper 1 case study in Year 13. HL extensions are taught alongside each topic.
New free lessons, worksheets and revision sheets for Computer Science, sent to your inbox.
Total ← 0
Count ← 0
FOR i ← 1 TO 4
INPUT Mark
IF Mark >= 50 THEN
Count ← Count + 1
ENDIF
Total ← Total + Mark
NEXT i
OUTPUT Total, Count| i | Mark | Count | Total | OUTPUT |
| 0 | 0 | |||
Found ← FALSE
Index ← 1
WHILE Found = FALSE AND Index <= 5 DO
IF Scores[Index] = Target THEN
Found ← TRUE
ELSE
Index ← Index + 1
ENDIF
ENDWHILE
IF Found = TRUE THEN
OUTPUT "Found at ", Index
ELSE
OUTPUT "Not found"
ENDIF| Index | Scores[Index] | Found | OUTPUT |
| 1 | FALSE | ||
FOR i ← 1 TO 4
IF Nums[i] > Nums[i + 1] THEN
Temp ← Nums[i]
Nums[i] ← Nums[i + 1]
Nums[i + 1] ← Temp
ENDIF
NEXT i| i | Temp | Nums[1] | Nums[2] | Nums[3] | Nums[4] | Nums[5] |
| 6 | 3 | 7 | 1 | 5 | ||
INPUT N Result ← 1 WHILE N > 1 DO Result ← Result * N N ← N - 1 ENDWHILE OUTPUT Result
| N | Result | OUTPUT |
| 4 | 1 | |