ACARA Digital Technologies Years 9–10 — Algorithms with Logical Operators
Designing algorithms that combine conditions, in flowcharts and pseudocode.
Modules (60)
1
Relational operators: = and <>
2
Relational operators: <, <=, > and >=
3
Writing precise conditions (7c)
4
IF…THEN…ENDIF (8.1b)
5
IF…THEN…ELSE…ENDIF (8.1b)
6
The standard flowchart symbols
7
Flowchart for IF ... THEN ... ELSE
8
Logical operator AND
9
Logical operator OR
10
Logical operator NOT
11
Truth tables for AND, OR and NOT
12
Combining AND, OR and NOT with brackets
13
Turning a worded rule into AND, OR and NOT
14
Writing a range condition precisely
15
Negating compound conditions
16
Error: wrong logical operator
17
IF with a compound condition
18
Logical operators in a flowchart decision
19
Drawing AND as two decisions in a row
20
Drawing OR as two decisions sharing one outcome
21
Several alternatives with IF inside ELSE
22
Nested selection: an IF inside an IF
23
Drawing a nested decision in a flowchart
24
Choosing nested IFs or one compound condition
25
FOR…TO…NEXT count-controlled loop
26
WHILE…DO…ENDWHILE pre-condition loop
27
REPEAT…UNTIL post-condition loop
28
Choosing count-controlled, pre-condition or post-condition loops
29
Flowchart for a WHILE loop
30
Flowchart for a REPEAT loop
31
Flowchart for a FOR loop
32
A WHILE loop with a compound condition
33
A REPEAT…UNTIL loop with two ways to stop
34
Converting between WHILE and REPEAT…UNTIL
35
Drawing a loop with a compound exit condition in a flowchart
36
Input validation with REPEAT…UNTIL
37
Error: loop that never ends
38
Selection inside a loop (8.1b)
39
Drawing a decision inside a loop in a flowchart
40
Counting in a loop (8.1b)
41
Counting items that meet a compound condition
42
Combining sequence, selection and iteration in one algorithm
43
Tracing an IF statement
44
Tracing WHILE and REPEAT loops
45
Tracing a compound condition step by step
46
Tracing counting and totalling
47
Explaining a flowchart
48
Working out the purpose from a trace
49
The purpose of an algorithm
50
Reading a problem to plan an algorithm
51
Building a flowchart from a problem
52
Writing an algorithm in pseudocode from a problem
53
Converting pseudocode to a flowchart
54
Converting a flowchart to pseudocode
55
Designing an algorithm that uses logical operators with selection and iteration
56
Test cases: input, expected output, actual output
57
Choosing test data for compound conditions
58
Finding errors in an algorithm
59
Suggesting a correction
60
Amending an algorithm
Smaller journeys, one per content description
The same modules, split up so a class can take just the content description it's working on.
12
ACARA 9-10 Digital Technologies: Conditions, selection and logical operators — AC9TDI10P05
Students learn to write precise conditions, use IF/ELSE and flowchart symbols, and combine conditions with AND, OR and NOT using truth tables and brackets.
12
ACARA 9-10 Digital Technologies: Compound conditions and nested selection — AC9TDI10P05
Students turn worded rules into compound conditions and draw them in flowcharts, then choose between nested IFs and a single compound condition.
18
ACARA 9-10 Digital Technologies: Iteration with logical operators — AC9TDI10P05
Students write and draw FOR, WHILE and REPEAT loops with compound exit conditions, then combine loops with selection, counting and sequence in one algorithm.
13
ACARA 9-10 Digital Technologies: Following and designing algorithms — AC9TDI10P05
Students trace and explain given algorithms, then plan and design their own using logical operators with selection and iteration, as flowcharts and pseudocode.
5
ACARA 9-10 Digital Technologies: Testing, correcting and amending algorithms — AC9TDI10P05, AC9TDI10P06
Students choose test cases for compound conditions, compare expected and actual output, and find, correct and amend errors in algorithms.
Printables for this journey
Every module above has its own free printable worksheet with an answer key. These crosswords and word searches cover the same terms:
✎
VCE Software Development U3O1 Crossword: Errors and debugging and Testing modules (Modules 168–177)
10 clues · Debugging a program with print() and trace tables, Setting a breakpoint, Stepping through code and watching variables, Tracing nested loops and more
🔎
VCE Software Development U3O1 Word Search: Errors and debugging to Artificial intelligence in programming (Modules 168–193)
20 words to find · Debugging a program with print() and trace tables, Setting a breakpoint, Stepping through code and watching variables, Tracing nested loops and more
✎
Years 7–8 Creating Digital Solutions Crossword: Defining and decomposing problems and Designing and tracing algorithms (Modules 3–47)
10 clues · Interviewing a user, Decomposing a problem into sub-problems, Decomposition diagrams, Non-functional requirements and more
🔎
Years 7–8 Creating Digital Solutions Word Search: Defining and decomposing problems to Evaluating digital solutions (Modules 3–125)
21 words to find · Interviewing a user, Decomposing a problem into sub-problems, Decomposition diagrams, Non-functional requirements and more
✎
Years 9–10 Creating Digital Solutions Crossword: Defining and decomposing problems to Evaluating solutions, impact and innovation (Modules 6–132)
10 clues · Decomposing a problem into a hierarchy chart, Prioritising requirements, Truth tables for AND, OR and NOT, Logical operators in a flowchart decision and more
🔎
Years 9–10 Creating Digital Solutions Word Search: Defining and decomposing problems to Evaluating solutions, impact and innovation (Modules 6–132)
20 words to find · Decomposing a problem into a hierarchy chart, Prioritising requirements, Truth tables for AND, OR and NOT, Logical operators in a flowchart decision and more
✎
IGCSE Computer Science Paper 2 Crossword: 7a Program Development Life Cycle (Modules 83–92)
10 clues · Recording user prompts and INPUT values in a trace table, Tracing assignments and arithmetic, Tracing an IF statement, Tracing a FOR loop and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 146–155)
10 clues · Writing literals in pseudocode, DECLARE a variable (7c), CONSTANT, Assignment with ← (7c) and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 156–165)
10 clues · Logical operators AND, OR and NOT, Writing a range condition precisely, INPUT, OUTPUT and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 176–187)
10 clues · Selection inside a loop (7c), Declaring a 1D array, Using an array element, Looping through an array with FOR (7c) and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 188–213)
10 clues · Writing statements inside flowchart symbols, Flowchart for IF ... THEN ... ELSE, Flowchart for a WHILE loop, Flowchart for a REPEAT loop and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 216–231)
10 clues · FOR ... TO as range() in Python, REPEAT ... UNTIL as while True with break, Pseudocode array to Python list, The purpose of an algorithm and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 232–241)
10 clues · Explaining a flowchart, Finding errors in an algorithm, Error: = used instead of ←, Error: missing ENDIF, NEXT, ENDWHILE or UNTIL and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts (Modules 242–253)
10 clues · Error: wrong data type or undeclared variable, Errors in a flowchart, Suggesting a correction, Totalling in pseudocode and more
✎
IGCSE Computer Science Paper 2 Crossword: 7c Pseudocode and Flowcharts and 7d Standard Methods of Solution (Modules 254–264)
10 clues · Reading a problem to plan an algorithm, Writing an algorithm in pseudocode from a problem, Writing an algorithm as a flowchart from a problem, Amending an algorithm and more
✎
IGCSE Computer Science Paper 2 Crossword: 8.1b Sequence, Selection and Iteration (Modules 358–368)
6 clues · INPUT and OUTPUT statements, Indentation and comments in pseudocode, Writing a sequence in Cambridge pseudocode, Arithmetic operators including DIV and MOD and more
✎
IGCSE Computer Science Paper 2 Crossword: 8.1b Sequence, Selection and Iteration (Modules 369–378)
10 clues · IF…THEN…ENDIF (8.1b), IF…THEN…ELSE…ENDIF (8.1b), IF with a compound condition, Several alternatives with IF inside ELSE and more
✎
IGCSE Computer Science Paper 2 Crossword: 8.1b Sequence, Selection and Iteration (Modules 379–388)
9 clues · Using the FOR counter inside the loop, WHILE…DO…ENDWHILE pre-condition loop, A WHILE loop ended by a rogue value, REPEAT…UNTIL post-condition loop and more
✎
IGCSE Computer Science Paper 2 Crossword: 8.1b Sequence, Selection and Iteration and 8.1c Procedures and Functions (Modules 389–398)
10 clues · Nested selection: an IF inside an IF, Nested selection with CASE and IF, Selection inside a loop (8.1b), Iteration inside selection and more
🔎
IGCSE Computer Science Paper 2 Word Search: 7a Program Development Life Cycle (Modules 71–92)
21 words to find · Normal test data, Abnormal test data, Extreme test data, Boundary test data and more
🔎
IGCSE Computer Science Paper 2 Word Search: 7c Pseudocode and Flowcharts (Modules 146–165)
20 words to find · Writing literals in pseudocode, DECLARE a variable (7c), CONSTANT, Assignment with ← (7c) and more
🔎
IGCSE Computer Science Paper 2 Word Search: 7c Pseudocode and Flowcharts (Modules 166–187)
20 words to find · OTHERWISE in a CASE statement (7c), Choosing between CASE and IF, FOR ... TO ... NEXT, FOR loop with STEP (7c) and more
🔎
IGCSE Computer Science Paper 2 Word Search: 7c Pseudocode and Flowcharts (Modules 188–231)
21 words to find · Writing statements inside flowchart symbols, Flowchart for IF ... THEN ... ELSE, Flowchart for a WHILE loop, Flowchart for a REPEAT loop and more
🔎
IGCSE Computer Science Paper 2 Word Search: 7c Pseudocode and Flowcharts (Modules 232–253)
21 words to find · Explaining a flowchart, Finding errors in an algorithm, Error: = used instead of ←, Error: missing ENDIF, NEXT, ENDWHILE or UNTIL and more
🔎
IGCSE Computer Science Paper 2 Word Search: 7c Pseudocode and Flowcharts and 7d Standard Methods of Solution (Modules 254–274)
21 words to find · Reading a problem to plan an algorithm, Writing an algorithm in pseudocode from a problem, Writing an algorithm as a flowchart from a problem, Amending an algorithm and more
🔎
IGCSE Computer Science Paper 2 Word Search: 8.1b Sequence, Selection and Iteration (Modules 358–378)
21 words to find · INPUT and OUTPUT statements, Indentation and comments in pseudocode, Writing a sequence in Cambridge pseudocode, Arithmetic operators including DIV and MOD and more
🔎
IGCSE Computer Science Paper 2 Word Search: 8.1b Sequence, Selection and Iteration and 8.1c Procedures and Functions (Modules 379–398)
21 words to find · Using the FOR counter inside the loop, WHILE…DO…ENDWHILE pre-condition loop, A WHILE loop ended by a rogue value, REPEAT…UNTIL post-condition loop and more
✎
Crossword: Algorithms with Logical Operators (Modules 492–534)
10 clues · Turning a worded rule into AND, OR and NOT, Drawing AND as two decisions in a row, Drawing OR as two decisions sharing one outcome, Choosing nested IFs or one compound condition and more
✎
Crossword: Algorithms with Logical Operators and Testing and Validating Programs (Modules 536–590)
10 clues · Choosing test data for compound conditions, What it means to validate an algorithm or program, Working out the expected output before you run the code, Edge cases with lists and strings and more
🔎
Word Search: Entities, Relationships and Queries and Algorithms with Logical Operators (Modules 459–534)
22 words to find · Pattern matching with LIKE, % and _, BETWEEN and IN in a WHERE clause, Why a query over two tables needs a join, Writing the ON condition: foreign key equals primary key and more
🔎
Word Search: Algorithms with Logical Operators and Testing and Validating Programs (Modules 536–622)
20 words to find · Choosing test data for compound conditions, What it means to validate an algorithm or program, Working out the expected output before you run the code, Edge cases with lists and strings and more
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?
This curriculum is aligned to the Australian Curriculum (ACARA) and Victorian Curriculum, spanning roughly Years 3 to 10 — from first sequencing and variables through to object-oriented programming and advanced data structures. Start wherever matches your class's current level; each module builds on the last.
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 module sequence is mapped to the Australian Curriculum (ACARA) and Victorian Curriculum, and a class's progress is reported back against those curriculum bands (e.g. ACARA Years 5–6 sequencing and iteration, Years 7–8 functions and data structures), not just a generic difficulty scale.
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 ACARA Digital Technologies Years 9–10 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.
For Teachers
Add this journey to your class and track every student in real time.
Create a free teacher account →No credit card. No setup fee. Make a class and invite students in under three minutes.
For Students
Start this journey on Cloodit — track progress, earn badges, and play live sprints with your class.
Start Learning Free →