IGCSE Computer Science Paper 2 Word Scramble: 7a Program Development Life Cycle (Modules 83–92)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
CETAR ALBET NITUP
A prompt is written in the OUTPUT column. The value the user types for an INPUT is written in that variable's column on that step, taken from the test data.
2
UECOTNR ← TUNEOCR + 1
When tracing, work out the right side using the current values, then write the result in that variable's column. The old value is used first, then replaced by the new one.
3
FI KAMR >= 05 EHNT
To trace an IF, work out if the condition is TRUE or FALSE for the current values, then follow only the THEN or ELSE path. Skipped statements get no row in the trace table.
4
ROF NOCUT ← 1 OT 5
To trace a FOR loop, give the loop variable each value from start to end in turn, run the loop body once for each value, and record every pass in its own row of the trace table.
5
UOTCN ← TUNCO + 1
Trace table for counting and totalling: Count and Total start at 0 in the first row, change each pass (Count only if the IF is true), and the final values are output after the loop.
6
ARCET BLATE
A table for a dry run: follow the algorithm line by line with the given inputs, writing each variable, output and prompt in the order it happens, then check the final values.
7
SFTIR OGNWR LEAVU
In a trace table, the first row where a value differs from what you expected points to the faulty line of the algorithm. Look at that line, then suggest a correction.
8
LPCD
Program development life cycle: analysis, design, coding, testing. Apply it to a scenario by saying what is done at each stage and which methods and test data are used.
Answer Key
IGCSE Computer Science Paper 2 · Modules 83–92
1CETAR ALBET NITUP → Trace table INPUT — A prompt is written in the OUTPUT column. The value the user types for an INPUT is written in that variable's column on that step, taken from the test data.
2UECOTNR ← TUNEOCR + 1 → Counter ← Counter + 1 — When tracing, work out the right side using the current values, then write the result in that variable's column. The old value is used first, then replaced by the new one.
3FI KAMR >= 05 EHNT → IF Mark >= 50 THEN — To trace an IF, work out if the condition is TRUE or FALSE for the current values, then follow only the THEN or ELSE path. Skipped statements get no row in the trace table.
4ROF NOCUT ← 1 OT 5 → FOR Count ← 1 TO 5 — To trace a FOR loop, give the loop variable each value from start to end in turn, run the loop body once for each value, and record every pass in its own row of the trace table.
5UOTCN ← TUNCO + 1 → Count ← Count + 1 — Trace table for counting and totalling: Count and Total start at 0 in the first row, change each pass (Count only if the IF is true), and the final values are output after the loop.
6ARCET BLATE → trace table — A table for a dry run: follow the algorithm line by line with the given inputs, writing each variable, output and prompt in the order it happens, then check the final values.
7SFTIR OGNWR LEAVU → first wrong value — In a trace table, the first row where a value differs from what you expected points to the faulty line of the algorithm. Look at that line, then suggest a correction.
8LPCD → PDLC — Program development life cycle: analysis, design, coding, testing. Apply it to a scenario by saying what is done at each stage and which methods and test data are used.