VCE Pseudocode Word Scramble: if-then-else block to Reading and tracing complex pseudocode (Modules 11–28)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
TL-ESEE-NFIH
A selection structure that runs one set of instructions if a condition is true, and a different set if it is false
2
LEES FI
A keyword that adds another condition to check if the previous IF or ______ condition was false
3
RFO I RFMO 1 OT N
A loop that repeats its instructions a fixed number of times, counting the variable i from 1 up to n
4
STNDEE ORF POOL
A FOR loop placed entirely inside another FOR loop, so the inner loop runs fully for every repetition of the outer loop
5
LIHEW OTNICDNIO OD
A loop that repeats its instructions for as long as the given condition remains true, checked before each repetition
6
AREEPT ... INULT NDOICOINT
A loop that repeats its instructions and checks the condition after each repetition, so the body always runs at least once
7
DMEIX ENRTOATII
Nesting one loop type inside a different loop type, such as a FOR loop inside a WHILE loop
8
NDEIEF
A keyword that starts a function definition, naming the function and listing the parameters it accepts
9
URTNRE
A keyword that sends a value back from a function to where it was called, ending the function's execution at that point
10
DEADMSBUN3(R, 4)
Calling a function by writing its name followed by arguments in brackets, running its instructions and possibly producing a value
11
RCSEO1[S]
Accesses the array element at index 1, using square brackets to specify the position.
12
NUNADET.MTES
Accesses the name field of the student record, using a dot to connect the record to its field.
13
AINERL CRASHE
An algorithm that checks each element in an array one at a time, from the start, until the target is found or the end is reached.
14
RBNYAI CEAHSR
An algorithm that repeatedly halves a sorted array to quickly find a target value.
15
ELONIESCT OTSR
An algorithm that repeatedly finds the smallest remaining element and swaps it into its correct position.
16
ARETC EATBL
A table that records the value of each variable at every step of an algorithm, used to check its logic by hand.
17
IETENXUOC DORRE
The exact sequence in which an algorithm's lines run, followed step by step to trace its behaviour.
Answer Key
VCE Pseudocode · Modules 11–28
1TL-ESEE-NFIH → IF-THEN-ELSE — A selection structure that runs one set of instructions if a condition is true, and a different set if it is false
2LEES FI → ELSE IF — A keyword that adds another condition to check if the previous IF or ELSE IF condition was false
3RFO I RFMO 1 OT N → FOR i FROM 1 TO n — A loop that repeats its instructions a fixed number of times, counting the variable i from 1 up to n
4STNDEE ORF POOL → Nested FOR loop — A FOR loop placed entirely inside another FOR loop, so the inner loop runs fully for every repetition of the outer loop
5LIHEW OTNICDNIO OD → WHILE condition DO — A loop that repeats its instructions for as long as the given condition remains true, checked before each repetition
6AREEPT ... INULT NDOICOINT → REPEAT ... UNTIL condition — A loop that repeats its instructions and checks the condition after each repetition, so the body always runs at least once
7DMEIX ENRTOATII → Mixed iteration — Nesting one loop type inside a different loop type, such as a FOR loop inside a WHILE loop
8NDEIEF → define — A keyword that starts a function definition, naming the function and listing the parameters it accepts
9URTNRE → return — A keyword that sends a value back from a function to where it was called, ending the function's execution at that point
10DEADMSBUN3(R, 4) → addNumbers(3, 4) — Calling a function by writing its name followed by arguments in brackets, running its instructions and possibly producing a value
11RCSEO1[S] → scores[1] — Accesses the array element at index 1, using square brackets to specify the position.
12NUNADET.MTES → student.name — Accesses the name field of the student record, using a dot to connect the record to its field.
13AINERL CRASHE → Linear Search — An algorithm that checks each element in an array one at a time, from the start, until the target is found or the end is reached.
14RBNYAI CEAHSR → Binary Search — An algorithm that repeatedly halves a sorted array to quickly find a target value.
15ELONIESCT OTSR → Selection Sort — An algorithm that repeatedly finds the smallest remaining element and swaps it into its correct position.
16ARETC EATBL → Trace table — A table that records the value of each variable at every step of an algorithm, used to check its logic by hand.
17IETENXUOC DORRE → Execution order — The exact sequence in which an algorithm's lines run, followed step by step to trace its behaviour.