VCE Pseudocode Definitions Worksheet: if-then-else block to Reading and tracing complex pseudocode (Modules 11–28)
Name:
Date:
Class:
✎
Key terms
Write what each term means, in your own words.
1
IF-THEN-ELSE
2
ELSE IF
3
FOR i FROM 1 TO n
4
Nested FOR loop
5
WHILE condition DO
6
REPEAT ... UNTIL condition
7
Mixed iteration
8
define
9
return
10
addNumbers(3, 4)
11
addNumbers(a: INTEGER, b: INTEGER): INTEGER
12
scores[1]
13
student.name
14
Linear Search
15
Binary Search
16
Selection Sort
17
Trace table
18
Execution order
Answer Key
VCE Pseudocode · Modules 11–28 · Student wording will vary for definitions
1IF-THEN-ELSE — A selection structure that runs one set of instructions if a condition is true, and a different set if it is false
2ELSE IF — A keyword that adds another condition to check if the previous IF or ELSE IF condition was false
3FOR 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
4Nested FOR loop — A FOR loop placed entirely inside another FOR loop, so the inner loop runs fully for every repetition of the outer loop
5WHILE condition DO — A loop that repeats its instructions for as long as the given condition remains true, checked before each repetition
6REPEAT ... UNTIL condition — A loop that repeats its instructions and checks the condition after each repetition, so the body always runs at least once
7Mixed iteration — Nesting one loop type inside a different loop type, such as a FOR loop inside a WHILE loop
8define — A keyword that starts a function definition, naming the function and listing the parameters it accepts
9return — A keyword that sends a value back from a function to where it was called, ending the function's execution at that point
10addNumbers(3, 4) — Calling a function by writing its name followed by arguments in brackets, running its instructions and possibly producing a value
11addNumbers(a: INTEGER, b: INTEGER): INTEGER — A function header specifying the function's name, its typed parameters, and the data type of its return value
12scores[1] — Accesses the array element at index 1, using square brackets to specify the position.
13student.name — Accesses the name field of the student record, using a dot to connect the record to its field.
14Linear 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.
15Binary Search — An algorithm that repeatedly halves a sorted array to quickly find a target value.
16Selection Sort — An algorithm that repeatedly finds the smallest remaining element and swaps it into its correct position.
17Trace table — A table that records the value of each variable at every step of an algorithm, used to check its logic by hand.
18Execution order — The exact sequence in which an algorithm's lines run, followed step by step to trace its behaviour.