← All printables
IGCSE Computer Science Paper 2 · Modules 296–306

Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.

A free printable IGCSE Computer Science Paper 2 definitions worksheet with 10 key terms, built from the key terms of 7d Standard Methods of Solution (Modules 296–306) — Outputting the result of a linear search, Tracing a linear search, Bubble sort: how it works, Swapping two values with a temporary variable, One pass of a bubble sort, Bubble sort with nested FOR loops and more. Print it or save it as a PDF — the answer key starts on its own page. No login needed.

IGCSE Computer Science Paper 2 Definitions Worksheet: 7d Standard Methods of Solution (Modules 296–306)

Name:
Date:
Class:

Key terms

Write what each term means, in your own words.

1
IF Found = TRUE THEN OUTPUT "Found at ", Index ELSE OUTPUT "Not found" ENDIF
2
trace table
3
bubble sort
4
Temp ← Marks[Index]
5
IF Marks[Index] > Marks[Index + 1] THEN
6
FOR Pass ← 1 TO n - 1
7
UNTIL Swapped = FALSE
8
bubble sort trace
9
logic error
10
key words

Answer Key

IGCSE Computer Science Paper 2 · Modules 296–306 · Student wording will vary for definitions
1IF Found = TRUE THEN OUTPUT "Found at ", Index ELSE OUTPUT "Not found" ENDIF — After the search loop, check the Found flag: if TRUE, output the position (Index) where the target was found, otherwise output a not-found message. Covers first, last and missing items.
2trace 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.
3bubble 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.
4Temp ← 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.
5IF Marks[Index] > Marks[Index + 1] THEN — One pass: a FOR loop compares each item with its neighbour and swaps them if the first is larger, so the biggest value moves to the end.
6FOR 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.
7UNTIL 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.
8bubble 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.
9logic 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 <.
10key 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.

Modules this definitions worksheet covers

Every module has its own free printable worksheet with an answer key, and students can practise the same terms interactively on Cloodit.

Part of: IGCSE Computer Science 0478 — 7d Standard Methods of Solution, WA Computer Science ATAR Year 11 — Standard Algorithms

More IGCSE Computer Science Paper 2 printables

This printable is free — no login needed.

Free classroom tools, no account: Hangman · Random Team Generator · Random Name Picker Wheel · Seating Plan Maker

Make a free class, give it a journey, and you also get:

Create a free teacher account →

No credit card. No setup fee. Make a class and invite students in under three minutes.