IGCSE Computer Science Paper 2 Word Scramble: 7d Standard Methods of Solution (Modules 296–306)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
CREAT BTEAL
A table that records the index, the element compared and the Found flag on each pass of a linear search, so you can follow it step by step.
2
ELBUBB RSOT
A sorting method that compares neighbouring items and swaps them if in the wrong order, repeating passes until the list is sorted. The largest value bubbles to the end each pass.
3
PETM ← DMKEI[ASXNR]
Saves the value of Marks[Index] in Temp so it is not lost. Marks[Index] can then be overwritten, and Temp is copied into Marks[Index + 1] to finish the swap.
4
ORF SPSA ← 1 OT N - 1
Outer loop of a bubble sort: it runs n - 1 passes. Inside it, an inner FOR loop compares neighbours and swaps them if out of order, so the whole array ends up sorted.
5
TNILU WESPDPA = LSAEF
A BOOLEAN flag set to FALSE before each pass and to TRUE whenever a swap happens. The bubble sort stops when a full pass leaves it FALSE, meaning no swaps were needed and the data is sorted.
6
ELBBUB RTSO CTREA
Writing out the array after every pass, showing each comparison and swap, plus the Temp and Swapped values, to see how a bubble sort puts the data in order.
7
OGLCI RROER
A mistake in an algorithm's steps that lets it run but gives wrong results, e.g. a total not set to 0, a loop going past the array end, or using > instead of <.
8
YEK RDSOW
Words in a problem, like add up, how many, highest, average, find or put in order, that show which standard method to use: totalling, counting, max/min, average, search or sort.
Answer Key
IGCSE Computer Science Paper 2 · Modules 296–306
1CREAT BTEAL → trace table — A table that records the index, the element compared and the Found flag on each pass of a linear search, so you can follow it step by step.
2ELBUBB RSOT → bubble sort — A sorting method that compares neighbouring items and swaps them if in the wrong order, repeating passes until the list is sorted. The largest value bubbles to the end each pass.
3PETM ← DMKEI[ASXNR] → Temp ← Marks[Index] — Saves the value of Marks[Index] in Temp so it is not lost. Marks[Index] can then be overwritten, and Temp is copied into Marks[Index + 1] to finish the swap.
4ORF SPSA ← 1 OT N - 1 → FOR Pass ← 1 TO n - 1 — Outer loop of a bubble sort: it runs n - 1 passes. Inside it, an inner FOR loop compares neighbours and swaps them if out of order, so the whole array ends up sorted.
5TNILU WESPDPA = LSAEF → UNTIL Swapped = FALSE — A BOOLEAN flag set to FALSE before each pass and to TRUE whenever a swap happens. The bubble sort stops when a full pass leaves it FALSE, meaning no swaps were needed and the data is sorted.
6ELBBUB RTSO CTREA → bubble sort trace — Writing out the array after every pass, showing each comparison and swap, plus the Temp and Swapped values, to see how a bubble sort puts the data in order.
7OGLCI RROER → logic error — A mistake in an algorithm's steps that lets it run but gives wrong results, e.g. a total not set to 0, a loop going past the array end, or using > instead of <.
8YEK RDSOW → key words — Words in a problem, like add up, how many, highest, average, find or put in order, that show which standard method to use: totalling, counting, max/min, average, search or sort.