ACARA Digital Technologies Years 5–6 Word Scramble: Algorithms with Branching and Repetition (Modules 120–132)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
IICNOESD MNOIDAD
A diamond shape in a flowchart that asks a yes or no question. One arrow is labelled Yes and one is labelled No, and each arrow leads to different steps.
2
OLPO RWAOR
An arrow that goes back to an earlier shape so steps repeat. The loop stops when the decision's exit arrow is followed, such as when the answer is Yes.
3
NTOUC ← TCONU + 1
A flowchart counter: set count to 0 in a step box, add 1 inside the loop, then ask count = 5? in a diamond. Yes leaves the loop, No goes round again.
4
CTREA A OLACTFHWR
Start at the oval, follow each arrow with your finger, answer every diamond using the current values, write down counter changes, and stop at the end oval to find the result.
5
EPST = EPASH
Each numbered step becomes one flowchart shape. An IF becomes a diamond, and a REPEAT becomes an arrow going back to an earlier shape. Both versions should do the same thing.
6
ETTS EASC
A chosen starting value you try in an algorithm, with the result you expect. Use one for every path and for a loop that runs zero times, then compare expected and actual results.
7
FI RO EEPRTA
Use IF when a step happens only sometimes. Use REPEAT when the same steps happen many times. Use both together when a loop needs a choice inside.
8
UZQI IMARHLGOT
An algorithm that repeats questions, adds 1 to a score variable for each right answer, and picks harder or easier questions depending on that score.
9
ETPEAR + FI + UNOCT
A finished algorithm joins steps, a decision (IF), a loop (REPEAT) and a counter to solve a school, game or recipe problem. You check it by following it step by step.
Answer Key
ACARA Digital Technologies Years 5–6 · Modules 120–132
1IICNOESD MNOIDAD → decision diamond — A diamond shape in a flowchart that asks a yes or no question. One arrow is labelled Yes and one is labelled No, and each arrow leads to different steps.
2OLPO RWAOR → loop arrow — An arrow that goes back to an earlier shape so steps repeat. The loop stops when the decision's exit arrow is followed, such as when the answer is Yes.
3NTOUC ← TCONU + 1 → count ← count + 1 — A flowchart counter: set count to 0 in a step box, add 1 inside the loop, then ask count = 5? in a diamond. Yes leaves the loop, No goes round again.
4CTREA A OLACTFHWR → trace a flowchart — Start at the oval, follow each arrow with your finger, answer every diamond using the current values, write down counter changes, and stop at the end oval to find the result.
5EPST = EPASH → step = shape — Each numbered step becomes one flowchart shape. An IF becomes a diamond, and a REPEAT becomes an arrow going back to an earlier shape. Both versions should do the same thing.
6ETTS EASC → test case — A chosen starting value you try in an algorithm, with the result you expect. Use one for every path and for a loop that runs zero times, then compare expected and actual results.
7FI RO EEPRTA → IF or REPEAT — Use IF when a step happens only sometimes. Use REPEAT when the same steps happen many times. Use both together when a loop needs a choice inside.
8UZQI IMARHLGOT → quiz algorithm — An algorithm that repeats questions, adds 1 to a score variable for each right answer, and picks harder or easier questions depending on that score.
9ETPEAR + FI + UNOCT → REPEAT + IF + count — A finished algorithm joins steps, a decision (IF), a loop (REPEAT) and a counter to solve a school, game or recipe problem. You check it by following it step by step.