WA Computer Science ATAR Unit 1 Word Scramble: Pseudocode and Algorithm Design to Standard Algorithms (Modules 100–314)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
NEN(ILP) == 4
A length check compares len() of the text with a required length or limit, such as exactly 4 characters for a PIN, to accept or reject the input.
2
TEAAMRERP
The name in a function definition that receives a value, like name in def greet(name). The value passed in the call, like greet('Ava'), is the argument.
3
EISD FFCEET
A change a function makes outside itself, like printing, editing a global or changing a passed-in list. A pure function has no side effects and only returns a result from its inputs.
4
DIM ← (WOL + IGHH) VDI 2
Each row of a binary search trace table updates low, high and mid. The range halves each step until the target is found or low becomes greater than high.
5
ACTER AELBT
A table of the array after each selection sort pass: the minimum of the unsorted part is swapped to the left, so the sorted part grows by one each pass.
6
OLG2 N
Worst-case comparisons for binary search: it halves a sorted range, so 1000 items need about 10 steps. Linear search needs up to n, so 1000 items could need 1000 comparisons.
Answer Key
WA Computer Science ATAR Unit 1 · Modules 100–314
1NEN(ILP) == 4 → len(pin) == 4 — A length check compares len() of the text with a required length or limit, such as exactly 4 characters for a PIN, to accept or reject the input.
2TEAAMRERP → parameter — The name in a function definition that receives a value, like name in def greet(name). The value passed in the call, like greet('Ava'), is the argument.
3EISD FFCEET → side effect — A change a function makes outside itself, like printing, editing a global or changing a passed-in list. A pure function has no side effects and only returns a result from its inputs.
4DIM ← (WOL + IGHH) VDI 2 → mid ← (low + high) DIV 2 — Each row of a binary search trace table updates low, high and mid. The range halves each step until the target is found or low becomes greater than high.
5ACTER AELBT → trace table — A table of the array after each selection sort pass: the minimum of the unsorted part is swapped to the left, so the sorted part grows by one each pass.
6OLG2 N → log2 n — Worst-case comparisons for binary search: it halves a sorted range, so 1000 items need about 10 steps. Linear search needs up to n, so 1000 items could need 1000 comparisons.