IGCSE Computer Science Paper 2 Word Scramble: 8.2 Arrays (Modules 459–468)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
ROF XDNIE ← 0 OT 92
For ARRAY[0:29], the loop must start at the lower bound 0 and end at the upper bound 29. It then visits all 30 elements and never goes outside the array.
2
PUNIT IMNN[DEEXA]
Inside a FOR loop, ______ stores each value the user types into the next array element, because Index changes every time the loop repeats.
3
ATLTO ← OTTAL + SIMKN[AXRDE]
Adds the current element to the running total on each loop pass. Set Total ← 0 before the loop first, or the answer will be wrong. Divide by the number of elements for the average.
4
SLERGTA ← KS1MA[R]
Start by assuming the first element is the largest, then compare every other element and replace Largest when a bigger one is found.
5
RLNEIA AECRHS
A loop checks every element against the wanted value. On a match, set Found to TRUE and record the index. If Found is still FALSE at the end, OUTPUT a not found message.
6
LLPLAREA SRARYA
Two or more arrays of the same size where the same index holds related data, e.g. StudentNames[3] and Marks[3] both describe the same student.
7
CTRAE LTBAE
A table that records the loop variable, index and array contents after each pass of a loop, so you can predict the final OUTPUT and spot errors such as off-by-one.
8
D2 RYARA
A table of rows and columns held in one variable. Each element needs two indexes: the first is the row (across), the second is the column (down), e.g. Marks[2, 3].
Answer Key
IGCSE Computer Science Paper 2 · Modules 459–468
1ROF XDNIE ← 0 OT 92 → FOR Index ← 0 TO 29 — For ARRAY[0:29], the loop must start at the lower bound 0 and end at the upper bound 29. It then visits all 30 elements and never goes outside the array.
2PUNIT IMNN[DEEXA] → INPUT Name[Index] — Inside a FOR loop, INPUT Name[Index] stores each value the user types into the next array element, because Index changes every time the loop repeats.
3ATLTO ← OTTAL + SIMKN[AXRDE] → Total ← Total + Marks[Index] — Adds the current element to the running total on each loop pass. Set Total ← 0 before the loop first, or the answer will be wrong. Divide by the number of elements for the average.
4SLERGTA ← KS1MA[R] → Largest ← Marks[1] — Start by assuming the first element is the largest, then compare every other element and replace Largest when a bigger one is found.
5RLNEIA AECRHS → linear search — A loop checks every element against the wanted value. On a match, set Found to TRUE and record the index. If Found is still FALSE at the end, OUTPUT a not found message.
6LLPLAREA SRARYA → parallel arrays — Two or more arrays of the same size where the same index holds related data, e.g. StudentNames[3] and Marks[3] both describe the same student.
7CTRAE LTBAE → trace table — A table that records the loop variable, index and array contents after each pass of a loop, so you can predict the final OUTPUT and spot errors such as off-by-one.
8D2 RYARA → 2D array — A table of rows and columns held in one variable. Each element needs two indexes: the first is the row (across), the second is the column (down), e.g. Marks[2, 3].