Years 5–6 Creating Digital Solutions Word Scramble: Designing algorithms with branching and iteration and Designing user interfaces (Modules 21–30)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
FI NIIEDS TARPEE
An IF placed inside a REPEAT is checked again on every repetition, so each pass through the loop can take a different path.
2
NUEECQSE, ACHRBN, OPLO
Most algorithms mix steps in order (sequence), decisions (branch) and repeats (loop). When you read an algorithm, you can label each part and explain it in your own words.
3
AOWHRFLCT UNEESECQ
A line of rectangles joined by arrows from the Start oval to the End oval, with one arrow in and one arrow out of each step. Each step is a short action phrase.
4
SENCODII ODDANMI
A diamond shape in a flowchart that holds a yes/no question. One arrow labelled Yes and one labelled No lead to different steps, and the paths can join up again later.
5
HIACEND SSCNOIIDE
Putting one decision diamond after another, so a No arrow leads to the next diamond. This lets a flowchart choose between three or more paths, and every path reaches End.
6
ALCFWOHTR OPLO
An arrow that goes back to an earlier shape, usually from a decision diamond, so the steps repeat until the exit condition is met and the exit arrow is followed.
7
OATCRFWHL OT ETPSS
Changing a flowchart into written steps: a diamond becomes IF or a loop condition, a back arrow becomes REPEAT, then check both versions do the same thing.
8
UBG
A mistake in an algorithm. Follow the steps until the result goes wrong, then fix that step. It might be in the wrong order, missing, or unclear.
9
SGNEDI NA HTLOIGMAR
Start with the user's problem, list the steps the solution must do, then add any decisions and repeats. Think about what the user puts in and needs out, and test the steps with them.
10
SURE TNECREFIA
The part of a digital system that you see and use. You give input by touching, clicking or typing, and the screen shows you output.
Answer Key
Years 5–6 Creating Digital Solutions · Modules 21–30
1FI NIIEDS TARPEE → IF inside REPEAT — An IF placed inside a REPEAT is checked again on every repetition, so each pass through the loop can take a different path.
2NUEECQSE, ACHRBN, OPLO → sequence, branch, loop — Most algorithms mix steps in order (sequence), decisions (branch) and repeats (loop). When you read an algorithm, you can label each part and explain it in your own words.
3AOWHRFLCT UNEESECQ → flowchart sequence — A line of rectangles joined by arrows from the Start oval to the End oval, with one arrow in and one arrow out of each step. Each step is a short action phrase.
4SENCODII ODDANMI → decision diamond — A diamond shape in a flowchart that holds a yes/no question. One arrow labelled Yes and one labelled No lead to different steps, and the paths can join up again later.
5HIACEND SSCNOIIDE → chained decisions — Putting one decision diamond after another, so a No arrow leads to the next diamond. This lets a flowchart choose between three or more paths, and every path reaches End.
6ALCFWOHTR OPLO → flowchart loop — An arrow that goes back to an earlier shape, usually from a decision diamond, so the steps repeat until the exit condition is met and the exit arrow is followed.
7OATCRFWHL OT ETPSS → flowchart to steps — Changing a flowchart into written steps: a diamond becomes IF or a loop condition, a back arrow becomes REPEAT, then check both versions do the same thing.
8UBG → bug — A mistake in an algorithm. Follow the steps until the result goes wrong, then fix that step. It might be in the wrong order, missing, or unclear.
9SGNEDI NA HTLOIGMAR → design an algorithm — Start with the user's problem, list the steps the solution must do, then add any decisions and repeats. Think about what the user puts in and needs out, and test the steps with them.
10SURE TNECREFIA → user interface — The part of a digital system that you see and use. You give input by touching, clicking or typing, and the screen shows you output.