VCE Pseudo Code Hangman
Years 11–12 · VCE · 25 key terms.
Every word, shuffled.
The names stay in this browser on this computer — they are never sent to Cloodit. A random student is called for each word.
VCE Pseudo Code following VCAA standards for the 2026 Study Design. See the whole journey →
Want your own words? Free Hangman Generator →
Same words, on paper
The quiet activity after the loud one. Free to print, answer keys included.
Crosswordif-then-else block to Reading and tracing complex pseudocode · What is Pseudocode to if-then block
Word searchWhat is Pseudocode to Reading and tracing complex pseudocode
Worksheetfor any module, with answer key
When your class is on devices — Snake Break and Diamond Dash run on the same modules, with a free class.
The 25 key terms
- 1pseudocode
- A way of writing algorithms using plain English and common symbols without the rules of any specific programming language, used to plan logic before coding begins
- 2end if
- A closing keyword in VCAA pseudocode that ends an if block; every nested construct uses end followed by its matching keyword: end if, end while, end for
- 4input
- A VCAA pseudocode keyword that accepts a value from the user and stores it in a named variable. Example: input age stores the user's entered value in the variable age
- 5print
- A VCAA pseudocode keyword that outputs a value, variable or expression as a result. Example: print area displays the current value stored in the variable area
- 6Algorithm:
- The required header keyword that names a VCAA maths pseudocode algorithm. Written as Algorithm: followed by a descriptive name, it must appear as the first line before input or processing
- 7MOD
- The pseudocode operator that returns the remainder after integer division. Example: 10 MOD 3 gives 1 because 10 divided by 3 is 3 remainder 1
- 9AND
- A VCAA pseudocode boolean operator that combines two conditions. The overall result is true only when BOTH conditions are true. Example: x > 0 AND x < 10
- 11IF-THEN-ELSE
- A selection structure that runs one set of instructions if a condition is true, and a different set if it is false
- 12ELSE IF
- A keyword that adds another condition to check if the previous IF or ELSE IF condition was false
- 13FOR 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
- 14Nested FOR loop
- A FOR loop placed entirely inside another FOR loop, so the inner loop runs fully for every repetition of the outer loop
- 15WHILE condition DO
- A loop that repeats its instructions for as long as the given condition remains true, checked before each repetition
- 16REPEAT ... UNTIL condition
- A loop that repeats its instructions and checks the condition after each repetition, so the body always runs at least once
- 17Mixed iteration
- Nesting one loop type inside a different loop type, such as a FOR loop inside a WHILE loop
- 18define
- A keyword that starts a function definition, naming the function and listing the parameters it accepts
- 19return
- A keyword that sends a value back from a function to where it was called, ending the function's execution at that point
- 20addNumbers(3, 4)
- Calling a function by writing its name followed by arguments in brackets, running its instructions and possibly producing a value
- 21addNumbers(a: INTEGER, b: INTEGER): INTEGER
- A function header specifying the function's name, its typed parameters, and the data type of its return value
- 22scores[1]
- Accesses the array element at index 1, using square brackets to specify the position.
- 23student.name
- Accesses the name field of the student record, using a dot to connect the record to its field.
- 24Linear 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.
- 25Binary Search
- An algorithm that repeatedly halves a sorted array to quickly find a target value.
- 26Selection Sort
- An algorithm that repeatedly finds the smallest remaining element and swaps it into its correct position.
- 27Trace table
- A table that records the value of each variable at every step of an algorithm, used to check its logic by hand.
- 28Execution order
- The exact sequence in which an algorithm's lines run, followed step by step to trace its behaviour.
Frequently Asked Questions
Do I need an account?
No. Hangman runs straight from this page — no account, no sign-up, nothing to install. If you add your class names, they are saved in your own browser and never sent to Cloodit.
How do I play it with my class?
Put the page on your whiteboard or projector and press Play. The class calls out letters and you click or type them. Six wrong letters and the word gets away. After every word its definition appears, so each round ends on the meaning, not just the spelling.
Can I use my own words?
Yes. The free Hangman generator at cloodit.com/hangman/ takes any list: one word or phrase per line, with a definition after a dash if you want it shown at the end of the round.
Can I put my students' names in?
Yes. Add your class list and a random student is called for each word. The list stays in this browser on this computer, so it is still there next lesson.
What year level is this for?
Senior secondary: written for VCE Applied Computing and Software Development students, usually in Years 11 and 12, though the early modules suit anyone meeting pseudocode for the first time.
Is this aligned to a curriculum?
The modules follow the pseudocode conventions VCE students are expected to read and write (assignment with <-, selection, iteration, functions, arrays, records, searching and sorting, trace tables), but they are not mapped module by module to study design outcomes.
Are the worksheets free too?
Yes. Every module in this journey has a free printable worksheet with a full answer key, and there are crosswords and word searches built from the same key terms.