← All Journeys

IGCSE Computer Science 0478 — 7d Standard Methods of Solution

The standard algorithms every programmer reuses.

Modules (50)

1 Algorithm 2 Cambridge 0478 pseudocode conventions 3 DECLARE and data types 4 Assignment with ← (7d) 5 INPUT and OUTPUT 6 Arithmetic operators in Cambridge pseudocode 7 Comparison operators 8 AND, OR and NOT 9 IF…THEN…ENDIF (7d) 10 IF…THEN…ELSE…ENDIF (7d) 11 FOR…TO…NEXT loop (7d) 12 WHILE…DO…ENDWHILE loop (7d) 13 REPEAT…UNTIL loop (7d) 14 Choosing FOR, WHILE or REPEAT 15 One-dimensional arrays 16 Reading and changing array elements 17 Looping through an array with FOR (7d) 18 Trace Tables 19 Standard methods of solution 20 Totalling: how it works 21 Totalling in Cambridge pseudocode 22 Tracing a totalling algorithm 23 Counting: how it works 24 Counting in Cambridge pseudocode 25 Counting only items that meet a condition 26 Tracing a counting algorithm 27 Finding the maximum: how it works 28 Finding the maximum in Cambridge pseudocode 29 Finding the minimum in Cambridge pseudocode 30 Tracing maximum and minimum algorithms 31 Average: how it works 32 Calculating an average in Cambridge pseudocode 33 Total, count, maximum, minimum and average in one loop 34 Linear search: how it works 35 Linear search with a FOR loop and a Found flag 36 Linear search that stops when the target is found 37 Outputting the result of a linear search 38 Tracing a linear search 39 Bubble sort: how it works 40 Swapping two values with a temporary variable 41 One pass of a bubble sort 42 Bubble sort with nested FOR loops 43 Bubble sort that stops when no swaps are made 44 Tracing a bubble sort 45 Choosing test data for an algorithm 46 Spotting common mistakes in standard algorithms 47 Identifying the standard method a problem needs 48 Writing an algorithm for a described problem 49 Completing a partly written algorithm 50 Dry-running an algorithm and giving its output

Smaller journeys, one per content description

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

IGCSE Computer Science 0478: Pseudocode foundations Students learn what an algorithm is and how to write variables, assignment, input, output and operators in Cambridge 0478 pseudocode.

IGCSE Computer Science 0478: Selection, loops and arrays Students learn to write IF statements, FOR, WHILE and REPEAT loops, and one-dimensional arrays in Cambridge 0478 pseudocode.

IGCSE Computer Science 0478: Totalling and counting Students learn to use trace tables and to write, trace and apply the standard methods of totalling and counting.

IGCSE Computer Science 0478: Maximum, minimum and average Students learn to find the largest, smallest and average values in a set of data, write each in pseudocode and trace them.

IGCSE Computer Science 0478: Linear search and bubble sort Students learn how linear search and bubble sort work, write each in Cambridge pseudocode and trace them on sample data.

IGCSE Computer Science 0478: Testing and applying standard methods Students learn to choose test data, spot errors, match a problem to a standard method, and write, complete and dry-run exam-style 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 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

Years 5–6 Creating Digital Solutions 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

Years 5–6 Creating Digital Solutions 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

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

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

Crossword: 7d Standard Methods of Solution (Modules 265–274) 10 clues · Arithmetic operators in Cambridge pseudocode, Comparison operators, AND, OR and NOT, IF…THEN…ENDIF (7d) and more

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

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

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

Crossword: 7d Standard Methods of Solution and 8.1a Data Types and Variables (Modules 307–316) 10 clues · Writing an algorithm for a described problem, Completing a partly written algorithm, Dry-running an algorithm and giving its output, What a variable is and more

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

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

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

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 IGCSE Computer Science Paper 2 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?