Years 5–6 Creating Digital Solutions
These are free worksheets for the Creating Digital Solutions strand of the Victorian Curriculum Digital Technologies, Levels 5–6: defining a problem, designing an algorithm and an interface, building it as a visual program, and evaluating the result.
The 74 modules are grouped by content description. Defining problems covers user needs, problem statements, functional requirements and success criteria. Designing algorithms covers sequence, variables, branching with IF … THEN … ELSE, iteration with REPEAT and REPEAT UNTIL, and flowcharts. Designing user interfaces covers interface elements, layout, consistency and readability, and sketching, annotating and evaluating designs. Building visual programs covers events, motion and looks blocks, variables, ask and answer, if and if-else blocks, loops, testing and debugging in a block-based editor. Evaluating covers checking a solution against its requirements and its impact on the community. Each module includes real practice questions and a full answer key.
Teachers can assign the whole strand as one journey, or just the content description they're teaching — each section below can be added to a class on its own — with progress tracking, class sprints and badges.
Add this whole curriculum to your class, or just the modules your unit needs — Cloodit tracks who's stuck automatically.
Defining problems and requirements — VC2TDI6C01 (7 modules)
1
What is a problem a digital system can solve?
Something difficult or annoying for someone. Some problems can be solved or made easier by a digital system, like an app, but others need something non-digital, like a tool.
2
User need
Something a user must be able to do or have to finish a task or fix their problem. A need is not just a want. We write it as: The user needs to...
3
Writing a problem statement
A problem statement is one sentence that names the user, says the task they need to do, and gives the reason why it matters. It turns a vague idea into a clear problem.
4
Functional requirements
Starts a functional requirement: one thing a digital solution must do. It says what the solution does, not how, and covers one action. Example: The solution must show the score.
5
Co-developing requirements with a teacher or user
Work with your teacher, the user and classmates to ask questions, list what the solution must do, and agree on a final list of requirements.
6
Success criteria for a solution
A checkable statement about what a solution must do for the user, like 'The user can log in.' You check it with yes or no to see if the solution works.
7
Keeping a problem simple
Breaking a big problem into smaller parts, so each part is simple enough to solve in a few steps. You can then choose one part to solve first.
Just this content description: the Defining problems and requirements journey · Add VC2TDI6C01 to a class →
Designing algorithms with branching and iteration — VC2TDI6C02 (22 modules)
8
Algorithm
A set of clear steps, in order, that solves a problem or completes a task, like a recipe or morning routine. Each step must be precise so a person or computer can follow it.
9
Sequence: steps in order
Steps that run one after another in a set order. Changing the order, leaving a step out or adding an extra step can change the result.
10
Writing an algorithm as numbered steps
A written algorithm step. Each line has one number and one action, and starts with a command word like Get, Add or Show. Steps go 1, 2, 3 in order.
11
Following an algorithm step by step
To carry out each step exactly as written, in order, without skipping steps or guessing. You can track values on paper, check the final result, or act it out with a partner.
12
Variables in an algorithm
A variable is a named place that stores a value. SET gives it a value, like 0, and later steps can change it, such as ADD 1 to score, so it works as a counter.
13
Input and output in an algorithm
ASK is an input step: it asks the user for a value and stores it in a variable. SHOW is an output step: it displays a result, like a message, on the screen.
14
Condition
A question about the situation that can only be answered true or false (yes or no), like 'Is it raining?' or 'Is the score above 10?'. It helps an algorithm decide what to do.
15
Branching with IF ... THEN
Runs the indented action only when the condition is true. If the condition is false, the action is skipped. Write IF and THEN in capitals, indent the action, and finish with END IF.
16
Branching with IF ... THEN ... ELSE
Chooses between two paths. If the condition is true, action1 runs. If it is false, the ELSE path runs action2 instead. Exactly one of the two paths runs.
17
Choosing between several paths
Checks another condition when the first one is false, so an algorithm can pick from more than two paths. Conditions are checked in order and only one path runs.
18
Iteration: repeating steps
Repeating a set of steps instead of writing them out again and again. The repeated steps are called the loop body. Loops save effort.
19
REPEAT a set number of times
Runs the indented steps under it exactly n times, then moves on to the next step. Use END REPEAT to show where the loop stops. Example: REPEAT 5 TIMES.
20
REPEAT UNTIL a condition is true
A loop that keeps repeating its steps until a condition becomes true. Use it when you don't know how many times. Make sure the condition can happen, or the loop never stops.
21
Branching inside a loop
An IF placed inside a REPEAT is checked again on every repetition, so each pass through the loop can take a different path.
22
Algorithms that use sequence, branching and iteration together
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.
23
Drawing a sequence in a flowchart
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.
24
Drawing a decision in a flowchart
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.
25
Drawing several alternatives in a flowchart
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.
26
Drawing a loop in a flowchart
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.
27
Turning a flowchart into written 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.
28
Finding and fixing a mistake in an algorithm
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.
29
Designing an algorithm for a known user's need
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.
Just this content description: the Designing algorithms with branching and iteration journey · Add VC2TDI6C02 to a class →
Designing user interfaces — VC2TDI6C03 (14 modules)
30
What is a 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.
31
Interface element: buttons
An interface element the user clicks or taps to make something happen. It needs a clear label, should do one action, and must be big enough to press easily.
32
Interface elements: text boxes and labels
A text box lets the user type in an answer. A label is words on the screen that tell the user what to type (prompt text) or show the result (output text).
33
Interface elements: menus, sliders and checkboxes
Interface elements that let the user pick from set options instead of typing: a menu lists choices, a slider picks a value on a range, a checkbox turns an option on or off.
34
Layout and grouping on a screen
Where items are placed on a screen. Good layout groups related items together, lines them up and leaves space between them, so the screen is easy to scan.
35
Consistency in an interface
Consistency means similar things look and work the same way on every screen, like buttons with the same style and a menu in the same place, so users always know what to do.
36
Readable text and colour choices
How different the text colour is from the background colour. High contrast, like black text on white, with large enough text, makes words easy to read.
37
Different users, different needs
One digital system can suit one user well and fail another, because users differ in age, ability and experience. Features like read-aloud and large text help.
38
Generating several interface design ideas
Small, quick drawings of different design ideas. Make several, compare them, then choose the best one to build.
39
Sketching a screen layout
A simple drawing of a screen. It has an outline, then a box or shape for each button, text box or label, drawn where it will go. You draw one sketch for each screen.
40
Annotating an interface design
A short note on a design that says what an element does or what happens when it is used, like a label on a button or an arrow showing which screen opens next.
41
Communicating a design to others
To show your sketch, explain how each part helps the user, and ask others for feedback. Listen to what they say so you can improve your design.
42
Evaluating an interface design
To check a design against criteria, like easy to read, easy to use and meets the requirements, using a checklist, user feedback and evidence to show if each one is met.
43
Modifying an interface design
Change one thing in your design, like size, position or wording, because of feedback. Then check it again. Change one thing at a time and save each version.
Just this content description: the Designing user interfaces journey · Add VC2TDI6C03 to a class →
Building visual programs — VC2TDI6C04 (24 modules)
44
The visual programming editor: stage, sprites and scripts
A screen where you build programs by snapping blocks together. It has a stage that shows the program, sprites that act, a block palette and a script area.
45
Event block: when green flag clicked
An event block that starts the script stacked under it. It is a hat block that sits at the top, and the program begins when you click the green flag.
46
Event block: when key pressed
An event block that waits for a key to be pressed. Each time you press the key you chose, the blocks stacked under it run. You can pick a different key from the drop-down list.
47
Looks blocks: say and think
The say block makes a sprite show a speech bubble with text, so the program can give output to the user. Say for 2 seconds hides it after a time. Use join to add a variable.
48
Motion blocks: move and turn
A motion block that moves a sprite forward 10 steps in the direction it faces. Other motion blocks, like turn 15 degrees and go to x y, change which way it faces or where it is.
49
Stacking blocks in sequence
Blocks snapped under one another run from top to bottom, one at a time, so the order of the blocks changes what the sprite does.
50
Making a variable
A block button that creates a named box to store a value, like a score. You choose a clear name, and a tick box shows or hides the variable on the stage.
51
Set and change variable blocks
A variable block that stores a starting value in score. Use change score by 1 to add to it, or by -1 to take away, so the score counts up or down.
52
Input with ask and answer
A block that shows a question and waits. The user types a reply, and it goes into the answer block. You can use answer straight away or save it in a variable.
53
Comparison blocks: >, < and =
A comparison block checks two values and reports true or false. This one is true when the score variable is greater than 10. Use < for less than and = for equal to.
54
Combining conditions with and, or, not
Blocks that combine or flip true/false conditions. And needs both to be true, or needs at least one to be true, and not reverses true to false and false to true.
55
The if block
A block that runs the blocks inside it only when its condition is true. If the condition is false, it skips them. The condition goes in the hexagon slot.
56
The if-else block
A block that runs the blocks in the first part if the condition is true, and the blocks in the else part if it is false. Two paths, but only one runs.
57
Multiple alternatives with nested if blocks
An if-else block placed inside the else part of another if-else block. The program checks one condition at a time, in order, so it can choose between three or more alternatives.
58
The repeat block
A block that runs the blocks inside it 10 times, then moves on. Change the number to set how many times. It saves you from stacking the same blocks again and again.
59
The forever block
A block that repeats the blocks inside it again and again until the program is stopped, for example with stop all. You can put an if block inside it to keep checking something.
60
The repeat until block
A loop block that keeps running the blocks inside it again and again, checking the condition each time, and stops only when the condition becomes true.
61
Using a variable as a counter in a loop
A counter is a variable that goes up by 1 each time a loop repeats, so it counts how many times something happened. Set it to 0 before the loop starts.
62
Decisions inside loops in a visual program
An if block placed inside a loop is checked again on every repeat, so the program makes a new decision each time round, like in forever or repeat until.
63
Building a button with 'when this sprite clicked'
An event block that starts its script when the user clicks that sprite, so the sprite works like a button. Add a label to the sprite and a colour change to show it can be clicked.
64
Switching screens with backdrops and show/hide
A Looks block that changes the stage picture. With show and hide blocks it gives a program several screens, like a start screen and a results screen, and hides sprites not needed.
65
Turning an algorithm into a visual program
Turn each algorithm step into a matching block: SET becomes set, ASK becomes ask and wait, IF becomes if, REPEAT becomes repeat. Then run it to check it does what the algorithm says.
66
Testing a visual program
Running your program with chosen test inputs and comparing what happens to the result you expected. Test every path, so each branch of the program gets checked.
67
Debugging a visual program
Finding the block that causes a wrong result in a program and fixing it, such as a block in the wrong order or a wrong condition.
Just this content description: the Building visual programs journey · Add VC2TDI6C04 to a class →
Evaluating digital solutions and their impact — VC2TDI6C05 (7 modules)
68
Checking a solution against the requirements
A list of every functional requirement and success criterion. You test the solution against each one, then record yes or no and note your evidence, such as what you saw or a screenshot.
69
Judging how well a system meets a need
To judge how well a system meets a user's need by checking it against criteria like easy to use, quick and reliable, then rating each one and giving a reason with evidence.
70
Evaluating an existing digital solution
To test a solution the way its user would, then compare what it does with the requirements to find what works well and what is missing.
71
Limits and improvements of an existing system
A change that helps when a system does not meet a user's need. Find the gap, suggest one new feature, and give your feedback in a kind, respectful way.
72
Evaluating your own solution
To check how well your solution works by testing it against the requirements, asking users to try it, and deciding what to improve. Be honest about any problems.
73
Community impact of a digital solution
How a digital solution affects other people, not just its user. It can help (benefits), cause problems (harms), or leave some people out.
74
Describing how a system satisfies a user's need
A good discussion names the user, then their need, then the feature that meets it, and ends with the reason it works. Starters like 'The system helps because...' can help.
Just this content description: the Evaluating digital solutions and their impact journey · Add VC2TDI6C05 to a class →
Printable Years 5–6 Creating Digital Solutions Crosswords & Word Searches
Built from the key terms of each block of modules, every one with a full answer key. All free printables →
✎
Crossword: Defining problems and requirements and Designing algorithms with branching and iteration (Modules 1–10)
10 clues · What is a problem a digital system can solve?, User need, Writing a problem statement, Functional requirements and more
✎
Crossword: Designing algorithms with branching and iteration (Modules 11–20)
10 clues · Following an algorithm step by step, Variables in an algorithm, Input and output in an algorithm, Condition and more
✎
Crossword: Designing algorithms with branching and iteration and Designing user interfaces (Modules 21–30)
10 clues · Branching inside a loop, Algorithms that use sequence, branching and iteration together, Drawing a sequence in a flowchart, Drawing a decision in a flowchart and more
✎
Crossword: Designing user interfaces (Modules 31–40)
10 clues · Interface element: buttons, Interface elements: text boxes and labels, Interface elements: menus, sliders and checkboxes, Layout and grouping on a screen and more
✎
Crossword: Designing user interfaces and Building visual programs (Modules 41–50)
10 clues · Communicating a design to others, Evaluating an interface design, Modifying an interface design, The visual programming editor: stage, sprites and scripts and more
✎
Crossword: Building visual programs (Modules 51–60)
10 clues · Set and change variable blocks, Input with ask and answer, Comparison blocks: >, < and =, Combining conditions with and, or, not and more
✎
Crossword: Building visual programs and Evaluating digital solutions and their impact (Modules 61–74)
10 clues · Using a variable as a counter in a loop, Decisions inside loops in a visual program, Building a button with 'when this sprite clicked', Switching screens with backdrops and show/hide and more
🔎
Word Search: Defining problems and requirements and Designing algorithms with branching and iteration (Modules 1–20)
20 words to find · What is a problem a digital system can solve?, User need, Writing a problem statement, Functional requirements and more
🔎
Word Search: Designing algorithms with branching and iteration and Designing user interfaces (Modules 21–40)
20 words to find · Branching inside a loop, Algorithms that use sequence, branching and iteration together, Drawing a sequence in a flowchart, Drawing a decision in a flowchart and more
🔎
Word Search: Designing user interfaces to Evaluating digital solutions and their impact (Modules 41–74)
20 words to find · Communicating a design to others, Evaluating an interface design, Modifying an interface design, The visual programming editor: stage, sprites and scripts and more
Journeys using these modules
5-6 Digital Technologies Vic Curric - Creating Digital Solutions, VCE Applied Computing - U1O1 - Data analysis, VCE Applied Computing - U1O1 - Data analysis, VCE Software Development - U3O1 - Programming, VCE Software Development - U3O2 - Analysis and Design, VCE Data Analytics - U3O1 - Data Analytics, VCE Data Analytics - U3O2 - Analysis and Design, VCE Data Analytics - U4O1 - Development and Evaluation, 7-8 Digital Technologies: Using digital tools and conventions, 7-8 Digital Technologies: Sharing online and managing projects, 7-8 Digital Technologies: Defining and decomposing problems, 7-8 Digital Technologies: Designing and tracing algorithms, 7-8 Digital Technologies: Designing user interfaces and experiences, 7-8 Digital Technologies: Evaluating digital solutions, 9-10 Digital Technologies: Interactive content with emerging tools, 9-10 Digital Technologies: Defining and decomposing problems, 9-10 Digital Technologies: Designing and validating algorithms, 9-10 Digital Technologies: Designing user interfaces and experiences, 9-10 Digital Technologies: Evaluating solutions, impact and innovation, VCE Applied Computing U1O2 Programming: Requirements and design tools, VCE Applied Computing U1O2 Programming: Control structures, IGCSE Computer Science 0478 — 4.1 Types of Software and Interrupts, IGCSE Computer Science 0478 — 7a Program Development Life Cycle, IGCSE Computer Science 0478 — 7b Decomposition and Sub-systems, IGCSE Computer Science 0478 — 7c Pseudocode and Flowcharts, IGCSE Computer Science 0478 — 7d Standard Methods of Solution, IGCSE Computer Science 0478 — 8.1b Sequence, Selection and Iteration, ACARA Digital Technologies Years 5–6 — Algorithms with Branching and Repetition, ACARA Digital Technologies Years 7–8 — Algorithms, Flowcharts and Pseudocode, ACARA Digital Technologies Years 7–8 — Tracing and Debugging Algorithms, ACARA Digital Technologies Years 9–10 — Testing and Validating Programs, QCE Digital Solutions Unit 1 — Understanding Digital Problems, QCE Digital Solutions Unit 1 — User Experiences and Interfaces, QCE Digital Solutions Unit 1 — Algorithms and Programming Techniques, QCE Digital Solutions Unit 1 — Programmed Solutions, QCE Digital Solutions Unit 2 — Data-Driven Problems and Solution Requirements, QCE Digital Solutions Unit 2 — Data and Programming Techniques, QCE Digital Solutions Unit 2 — Prototype Data Solutions, QCE Digital Solutions Unit 3 — Interactions Between Users, Data and Digital Systems, QCE Digital Solutions Unit 3 — Real-World Problems and Solution Requirements, QCE Digital Solutions Unit 3 — Innovative Digital Solutions, QCE Digital Solutions Unit 4 — Complex Digital Data Exchange Problems and Solution Requirements, WA Computer Science ATAR Year 11 — Pseudocode and Algorithm Design, WA Computer Science ATAR Year 11 — Control Structures and Data Types
Frequently Asked Questions
Are these worksheets free?
Yes — every worksheet and its answer key is free to view, download, and print, with no account required to access any individual module.
Do I need an account?
No account is needed to view or print a worksheet. A free teacher account adds extras like assigning modules to a class and tracking progress automatically — it takes under three minutes to set up and doesn't need a credit card.
What year level is this for?
Years 5 and 6 — the modules follow Victorian Curriculum Digital Technologies, Levels 5–6.
Can I print them?
Yes — every module has a one-click Print Worksheet button that generates a printable page with the practice questions and a full answer key.
Is this aligned to a curriculum?
Yes — the modules are grouped by the Levels 5–6 Creating Digital Solutions content descriptions of the Victorian Curriculum Digital Technologies (VC2TDI6C01–VC2TDI6C05), and each section below can be added to a class on its own.
Can students use this without a teacher?
Yes — students can start any module and practice directly, no class or account required. Joining a teacher's class with a class code adds progress tracking, class badges, and live Sprints, but isn't needed to work through the worksheets or modules solo.
Do I need to know Years 5–6 Creating Digital Solutions myself to teach this?
No — every module comes with a full worked answer key, and Cloodit tracks who's stuck automatically, so you don't need to solve each exercise yourself before assigning it or be able to debug a student's work line by line.
Cloodit turns curriculum-aligned coding content into journeys students work through one biome at a time.
Students earn collectable badges
Over 100 of them, across seven natural biomes.
Study Buddy
Students build a real study resource
Turns their work into revision material ready for Flash Cards and Exam study.
Students lock in with Sprints
Live, competitive practice for the start of the lesson or a teacher-led lesson finisher.
Custom printable certificates
Honour your top performers, or encourage a student who's trying hard — ready to print in seconds.
For Teachers
Set this curriculum for your class and see who needs help, automatically.
Create a free teacher account →No credit card. No setup fee. Make a class and invite students in under three minutes.
For Students
Practice this topic interactively, track progress, and unlock badges.
Start Learning Free →