← All Journeys

WA Computer Science ATAR Year 11 — Standard Algorithms

The algorithms every programmer should know.

Modules (41)

1 Arrays in pseudocode 2 Looping through an array by index 3 for loop: for i from 1 to n 4 while loop 5 if-then-else block 6 Comparison Operators in Pseudocode 7 Standard methods of solution 8 Counters and accumulators in pseudocode 9 Totalling: how it works 10 Tracing a totalling algorithm 11 Counting: how it works 12 Counting only items that meet a condition 13 Tracing a counting algorithm 14 Finding the maximum: how it works 15 Tracing maximum and minimum algorithms 16 Average: how it works 17 Total, count, maximum, minimum and average in one loop 18 Linear search: how it works 19 Linear Search algorithm in pseudocode 20 Linear search with a FOR loop and a Found flag 21 Linear search that stops when the target is found 22 Tracing a linear search 23 Binary Search algorithm in pseudocode 24 Tracing a binary search 25 Binary search in Python 26 Bubble sort: how it works 27 Swapping two values with a temporary variable 28 One pass of a bubble sort 29 Bubble sort with nested FOR loops 30 Bubble sort that stops when no swaps are made 31 Tracing a bubble sort 32 Selection Sort algorithm in pseudocode 33 Selection sort in Python 34 Tracing a selection sort 35 Worst-case comparisons: linear versus binary search 36 Comparing the number of comparisons in bubble and selection sort 37 Comparing searching and sorting algorithms 38 Identifying the standard method a problem needs 39 Applying an algorithm to a task 40 Choosing test data for an algorithm 41 Spotting common mistakes in standard algorithms

Smaller journeys, one per content description

The same modules, split up so a class can take just the content description it's working on.

WA Computer Science ATAR Year 11: Programming foundations for algorithms Students review arrays, loops, selection and comparison operators in pseudocode and learn what a standard algorithm is.

WA Computer Science ATAR Year 11: Totalling, counting, maximum, minimum and average Students write and trace the standard single-loop algorithms for totalling, counting, finding the maximum and minimum, and calculating the average.

WA Computer Science ATAR Year 11: Linear and binary search Students write and trace linear search and binary search, and learn when binary search can be used.

WA Computer Science ATAR Year 11: Sorting with bubble sort and selection sort Students learn how bubble sort and selection sort work, then write and trace both using nested loops and swaps.

WA Computer Science ATAR Year 11: Comparing and choosing algorithms Students compare searching and sorting algorithms by efficiency, choose the right standard method for a problem, and test it and check it for common mistakes.

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 Pseudocode Crossword: What is Pseudocode to if-then block (Modules 1–10) 6 clues · What is Pseudocode, Pseudocode Writing Conventions, Variable Assignment: x <- value, input keyword and more

VCE Pseudocode Crossword: if-then-else block to Reading and tracing complex pseudocode (Modules 11–28) 10 clues · if-then-else block, else if: chained selection, for loop: for i from 1 to n, Nested for loops and more

VCE Pseudocode Word Search: What is Pseudocode to Reading and tracing complex pseudocode (Modules 1–28) 20 words to find · What is Pseudocode, Pseudocode Writing Conventions, Variable Assignment: x <- value, input keyword and more

VCE Software Development U3O1 Crossword: Naming conventions and internal documentation and Pseudocode (Modules 48–71) 10 clues · Camel casing, Snake casing, Hungarian notation for variables, Hungarian notation for interface controls and more

VCE Software Development U3O1 Crossword: Pseudocode to Data structures (Modules 72–96) 10 clues · Turning pseudocode into Python, Changing a global variable with the global keyword, Functions calling other functions, Program structure with a main() function and more

VCE Software Development U3O1 Crossword: Object-oriented programming and Searching and sorting algorithms (Modules 142–155) 10 clues · OOP principle: inheritance, Calling the parent __init__ with super(), Linear search in Python, Binary search in Python and more

VCE Software Development U3O1 Crossword: Searching and sorting algorithms and Errors and debugging (Modules 156–166) 10 clues · Comparing searching and sorting algorithms, Applying an algorithm to a task, Logic errors in Python, Runtime errors in Python and more

VCE Software Development U3O1 Word Search: Requirements and design tools to Pseudocode (Modules 10–71) 21 words to find · Data dictionary, Writing a data dictionary entry, Designing classes with a class diagram, Object descriptions and more

VCE Software Development U3O1 Word Search: Pseudocode to Data sources and files (Modules 72–113) 21 words to find · Turning pseudocode into Python, Changing a global variable with the global keyword, Functions calling other functions, Program structure with a main() function and more

VCE Software Development U3O1 Word Search: Object-oriented programming to Errors and debugging (Modules 142–166) 20 words to find · OOP principle: inheritance, Calling the parent __init__ with super(), Linear search in Python, Binary search in Python and more

Years 7–8 Creating Digital Solutions Crossword: Designing and tracing algorithms to Evaluating digital solutions (Modules 50–125) 10 clues · Choosing test data for an algorithm, Storyboarding a user's path through a system, Comparing alternative designs with a criteria table, Running a Python program 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

IGCSE Computer Science Paper 2 Crossword: 7d Standard Methods of Solution (Modules 275–285) 10 clues · Reading and changing array elements, Looping through an array with FOR (7d), Standard methods of solution, Totalling: how it works and more

IGCSE Computer Science Paper 2 Crossword: 7d Standard Methods of Solution (Modules 286–295) 10 clues · Finding the maximum: how it works, Finding the maximum in Cambridge pseudocode, Finding the minimum in Cambridge pseudocode, Tracing maximum and minimum algorithms and more

IGCSE Computer Science Paper 2 Crossword: 7d Standard Methods of Solution (Modules 296–306) 10 clues · Outputting the result of a linear search, Tracing a linear search, Bubble sort: how it works, Swapping two values with a temporary variable and more

IGCSE Computer Science Paper 2 Word Search: 7d Standard Methods of Solution (Modules 275–295) 21 words to find · Reading and changing array elements, Looping through an array with FOR (7d), Standard methods of solution, Totalling: how it works and more

IGCSE Computer Science Paper 2 Word Search: 7d Standard Methods of Solution and 8.1a Data Types and Variables (Modules 296–316) 22 words to find · Outputting the result of a linear search, Tracing a linear search, Bubble sort: how it works, Swapping two values with a temporary variable and more

QCE Digital Solutions Unit 1 Crossword: Algorithms and Programming Techniques and Programmed Solutions (Modules 158–380) 10 clues · input keyword, if-then-else block, Repeat-Until loop, define: defining a function and more

QCE Digital Solutions Unit 1 Word Search: User Experiences and Interfaces to Programmed Solutions (Modules 82–380) 20 words to find · Recording pitfalls and useful solutions in an existing interface, Known user, User characteristics, Age appropriateness of information and more

Crossword: Pseudocode and Algorithm Design to Standard Algorithms (Modules 100–314) 10 clues · User and technical documentation, Length check with len(), Format check with string methods, List check with the in operator and more

Crossword: Standard Algorithms and Network Communications (Modules 315–470) 10 clues · Comparing the number of comparisons in bubble and selection sort, Peer-to-peer and client-server communication models, Purpose of layers in a network model, The OSI seven-layer model and more

Word Search: Pseudocode and Algorithm Design to Network Communications (Modules 100–470) 20 words to find · User and technical documentation, Length check with len(), Format check with string methods, List check with the in operator 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 WA Computer Science ATAR Unit 1 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.

Add to class →

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 →

Have a class code?