IGCSE Computer Science Paper 2 Crossword: 7d Standard Methods of Solution (Modules 286–295)
Name:
Date:
Class:
✎
Crossword
Read each clue and write the matching term in the grid. Numbers in brackets show the letters in each word.
1
2
3
4
5
6
7
8
9
Across
- 3. Keep the largest value seen so far in ______. Start ______ with the first value, ______ replace it whenever a later value is larger. Starting at 0 can fail if all values are negative. Word 3 of: IF Num > ___ ____ ___ ← Num (3)
- 5. Inside a loop, this compares each item with ______ and replaces ______ when a lower value is found. Start ______ as Marks[1], not 0, so the minimum is correct. Word 4 of: IF Marks[_____] < ________ ____ ________ ← Marks[_____] ENDIF (8)
- 7. 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. Word 2 of: ______ ______ (6)
- 8. Used inside a loop to compare each mark with Largest. If the mark is bigger, it replaces Largest. When the loop ends, Largest holds the biggest value in the array. Word 3 of: IF Marks[_____] > Largest ____ Largest ← Marks[_____] ENDIF (5)
- 9. Word 1 of the term in 7 Across: ______ ______ (6)
Down
- 1. The ______ is the ______ of the values divided by how many values there are. It needs both a ______ and a count, can be a REAL, and is not allowed when the count is zero. Word 2 of: _______ ← _____ / Count (5)
- 2. 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. Word 2 of: ______ ____ (4)
- 4. Word 1 of the term in 1 Down: _______ ← _____ / Count (7)
- 6. Word 4 of the term in 3 Across: IF Num > ___ ____ ___ ← Num (4)
- 7. Word 1 of the term in 2 Down: ______ ____ (6)
Answer Key
IGCSE Computer Science Paper 2 · Modules 286–295
1T
2P
O
3M
4A
X
A
T
V
5S
M
A
L
L
E
S
T
S
L
R
6T
7S
E
A
R
C
H
I
G
E
8I
N
D
E
X
N
G
9L
I
N
E
A
R
E
Across
3MAX — Keep the largest value seen so far in ______. Start ______ with the first value, ______ replace it whenever a later value is larger. Starting at 0 can fail if all values are negative. Word 3 of: IF Num > ___ ____ ___ ← Num
5SMALLEST — Inside a loop, this compares each item with ______ and replaces ______ when a lower value is found. Start ______ as Marks[1], not 0, so the minimum is correct. Word 4 of: IF Marks[_____] < ________ ____ ________ ← Marks[_____] ENDIF
7SEARCH — 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. Word 2 of: ______ ______
8INDEX — Used inside a loop to compare each mark with Largest. If the mark is bigger, it replaces Largest. When the loop ends, Largest holds the biggest value in the array. Word 3 of: IF Marks[_____] > Largest ____ Largest ← Marks[_____] ENDIF
9LINEAR — Word 1 of the term in 7 Across: ______ ______
Down
1TOTAL — The ______ is the ______ of the values divided by how many values there are. It needs both a ______ and a count, can be a REAL, and is not allowed when the count is zero. Word 2 of: _______ ← _____ / Count
2PASS — 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. Word 2 of: ______ ____
4AVERAGE — Word 1 of the term in 1 Down: _______ ← _____ / Count
6THEN — Word 4 of the term in 3 Across: IF Num > ___ ____ ___ ← Num
7SINGLE — Word 1 of the term in 2 Down: ______ ____