Years 7–8 Creating Digital Solutions Word Scramble: Defining and decomposing problems and Designing and tracing algorithms (Modules 3–47)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
RINEVTIWE
A conversation where you ask one user questions and listen to their answers to learn about their problem.
2
OCDPMEOISTION
Splitting a big problem into smaller sub-problems, such as input, process and output. Each part can be solved on its own, then the solutions are combined.
3
OTSIIONOCMEDP AADMIRG
A tree with the whole problem at the top and boxes below for its smaller sub-problems. Each level adds detail, and you stop splitting when a part is simple.
4
SENETD FI
An if block written inside another if block. The inner condition is only checked when the outer condition is true. Indent the inner block and give each if its own end if.
5
FI X > 0 EHTN RFO I MRFO 1 OT X
A loop written inside an if branch only runs when that branch's condition is true. If the condition is false, the loop is skipped. An else branch can hold a loop too.
6
AAEAGRMLLPOLR
The flowchart shape for an input or output step, like getting a name from the user or showing a result. Write the action and variable inside, e.g. Input age.
7
DENETS SIOCEIDN
A diamond placed on the Yes or No path of another diamond, so the second question is only asked after the first answer. Every path still ends at the End shape.
8
IDIOECNS EIIDSN A OPLO
A diamond on the loop path is asked on every pass. Both its Yes and No branches rejoin, then go back to the loop test, usually after the counter update.
9
CETRA NA FI
Check the condition using the current values, record TRUE or FALSE in the trace table, then follow only the branch that is true and skip the other branch.
Answer Key
Years 7–8 Creating Digital Solutions · Modules 3–47
1RINEVTIWE → interview — A conversation where you ask one user questions and listen to their answers to learn about their problem.
2OCDPMEOISTION → decomposition — Splitting a big problem into smaller sub-problems, such as input, process and output. Each part can be solved on its own, then the solutions are combined.
3OTSIIONOCMEDP AADMIRG → decomposition diagram — A tree with the whole problem at the top and boxes below for its smaller sub-problems. Each level adds detail, and you stop splitting when a part is simple.
4SENETD FI → nested if — An if block written inside another if block. The inner condition is only checked when the outer condition is true. Indent the inner block and give each if its own end if.
5FI X > 0 EHTN RFO I MRFO 1 OT X → if x > 0 then for i from 1 to x — A loop written inside an if branch only runs when that branch's condition is true. If the condition is false, the loop is skipped. An else branch can hold a loop too.
6AAEAGRMLLPOLR → parallelogram — The flowchart shape for an input or output step, like getting a name from the user or showing a result. Write the action and variable inside, e.g. Input age.
7DENETS SIOCEIDN → nested decision — A diamond placed on the Yes or No path of another diamond, so the second question is only asked after the first answer. Every path still ends at the End shape.
8IDIOECNS EIIDSN A OPLO → decision inside a loop — A diamond on the loop path is asked on every pass. Both its Yes and No branches rejoin, then go back to the loop test, usually after the counter update.
9CETRA NA FI → trace an if — Check the condition using the current values, record TRUE or FALSE in the trace table, then follow only the branch that is true and skip the other branch.