IGCSE Computer Science Paper 2 Word Scramble: 7d Standard Methods of Solution (Modules 286–295)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
FI UMN > AXM EHNT AMX ← UNM
Keep the largest value seen so far in Max. Start Max with the first value, then replace it whenever a later value is larger. Starting at 0 can fail if all values are negative.
2
FI UBRNEM > RSGLATE NTEH
In a trace table, Largest only changes on rows where this test is true. If Number is equal or smaller, the Largest cell stays the same as the row above. Smallest uses < instead.
3
VAEGERA ← OLATT / OUTNC
The average is the total of the values divided by how many values there are. It needs both a total and a count, can be a REAL, and is not allowed when the count is zero.
4
LGSEIN SAPS
One loop visits each item once, updating the total, count, maximum and minimum together. The average is worked out after the loop ends, as Total / Count.
5
RNAEIL EHSCAR
Checks each item in a list in turn, from the start, until the target is found or the end of the list is reached. It works on unsorted data.
6
ONFDU ← SLAEF
Sets a BOOLEAN flag to FALSE before a FOR loop. The loop sets Found to TRUE if an element equals the target. After the loop, Found shows whether the target was seen.
Answer Key
IGCSE Computer Science Paper 2 · Modules 286–295
1FI UMN > AXM EHNT AMX ← UNM → IF Num > Max THEN Max ← Num — Keep the largest value seen so far in Max. Start Max with the first value, then replace it whenever a later value is larger. Starting at 0 can fail if all values are negative.
2FI UBRNEM > RSGLATE NTEH → IF Number > Largest THEN — In a trace table, Largest only changes on rows where this test is true. If Number is equal or smaller, the Largest cell stays the same as the row above. Smallest uses < instead.
3VAEGERA ← OLATT / OUTNC → Average ← Total / Count — The average is the total of the values divided by how many values there are. It needs both a total and a count, can be a REAL, and is not allowed when the count is zero.
4LGSEIN SAPS → single pass — One loop visits each item once, updating the total, count, maximum and minimum together. The average is worked out after the loop ends, as Total / Count.
5RNAEIL EHSCAR → linear search — Checks each item in a list in turn, from the start, until the target is found or the end of the list is reached. It works on unsorted data.
6ONFDU ← SLAEF → Found ← FALSE — Sets a BOOLEAN flag to FALSE before a FOR loop. The loop sets Found to TRUE if an element equals the target. After the loop, Found shows whether the target was seen.