WA Computer Science ATAR Unit 1 Definitions Worksheet: Pseudocode and Algorithm Design to Standard Algorithms (Modules 100–314)
Name:
Date:
Class:
✎
Key terms
Write what each term means, in your own words.
1
external documentation
2
len(pin) == 4
3
code.isdigit() and len(code) == 4
4
in
5
parameter
6
side effect
7
internal vs external documentation
8
mid ← (low + high) DIV 2
9
trace table
10
log2 n
Answer Key
WA Computer Science ATAR Unit 1 · Modules 100–314 · Student wording will vary for definitions
1external documentation — Documents supplied with a program: user documentation guides users to operate it; technical documentation records design (pseudocode, flowcharts, test results) for developers.
2len(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.
3code.isdigit() and len(code) == 4 — A format check tests that text follows an expected pattern, such as 4 digits for a postcode, using string methods like isdigit(), isalpha(), slicing and len().
4in — A list check uses in to accept a value only if it appears in a list of allowed values, e.g. choice in ['a', 'b']. Use not in to reject a value that is missing.
5parameter — 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.
6side 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.
7internal vs external documentation — Internal documentation is inside the code (comments, docstrings). External is separate, like a user guide or technical document covering each module's purpose, inputs and outputs.
8mid ← (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.
9trace 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.
10log2 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.