IGCSE Computer Science 0478 — 7a Program Development Life Cycle
How a program goes from a problem to tested working code.
Modules (92)
1
The program development life cycle
2
The analysis stage
3
Identifying the problem
4
Abstraction (7a)
5
Decomposing a problem into sub-problems
6
Requirements of a program
7
Inputs, processes, outputs and storage
8
The design stage
9
Decomposing a problem into a hierarchy chart
10
Cambridge flowchart symbols (7a)
11
Drawing a sequence in a flowchart
12
Input and output shapes in a flowchart
13
Drawing a decision in a flowchart
14
Drawing a loop in a flowchart
15
The coding stage
16
Iterative testing while coding
17
The testing stage
18
Matching a task to its PDLC stage
19
Pseudocode as a design method
20
Keywords in capital letters
21
Identifiers in Pascal case (7a)
22
Indentation in pseudocode
23
Comments with // (7a)
24
Data type keywords: INTEGER, REAL, CHAR, STRING, BOOLEAN
25
Writing literals in Cambridge pseudocode
26
DECLARE a variable (7a)
27
CONSTANT declarations
28
Assignment with ← (7a)
29
INPUT command
30
OUTPUT command
31
Arithmetic operators + - * / ^ (7a)
32
DIV function
33
MOD function
34
Relational operators = < <= > >= <>
35
Logical operators AND, OR, NOT
36
Writing precise conditions (7a)
37
LENGTH function
38
SUBSTRING function
39
UCASE and LCASE functions
40
IF ... THEN ... ENDIF (7a)
41
IF ... THEN ... ELSE ... ENDIF (7a)
42
Nested IF statements (7a)
43
CASE OF ... ENDCASE (7a)
44
FOR ... TO ... NEXT loop (7a)
45
FOR loop with STEP (7a)
46
WHILE ... DO ... ENDWHILE loop (7a)
47
REPEAT ... UNTIL loop (7a)
48
Choosing between FOR, WHILE and REPEAT
49
Counting in a loop (7a)
50
Totalling in a loop (7a)
51
Validation versus verification
52
Why input data is validated
53
Range check
54
Length check
55
Type check
56
Presence check
57
Format check
58
Check digit
59
Typing errors that a check digit detects
60
Re-asking for input until it is valid
61
Combining validation checks
62
What validation cannot do
63
Choosing a validation check for a field
64
Verifying data
65
Visual check
66
Double entry check
67
Double entry check in pseudocode
68
Choosing validation or verification
69
Writing a validated input algorithm in pseudocode
70
Test data
71
Normal test data
72
Abnormal test data
73
Extreme test data
74
Boundary test data
75
Extreme data compared with boundary data
76
Suggesting test data for a range check
77
Suggesting test data for length, presence and format checks
78
Test cases: input, expected output, actual output
79
Dry run of an algorithm
80
Trace Tables
81
Setting up the variable columns of a trace table
82
The OUTPUT column of a trace table
83
Recording user prompts and INPUT values in a trace table
84
Tracing assignments and arithmetic
85
Tracing an IF statement
86
Tracing a FOR loop
87
Tracing WHILE and REPEAT loops
88
Tracing counting and totalling
89
Tracing a validation algorithm
90
Completing a full trace table for a dry run
91
Using a trace table to find an error
92
Applying the program development life cycle to a scenario
Smaller journeys, one per content description
The same modules, split up so a class can take just the content description it's working on.
18
IGCSE Computer Science 0478: Life cycle stages, analysis and design
Students learn the four stages of the program development life cycle and the tasks at each, including abstraction, decomposition, requirements, structure diagrams and flowcharts.
12
IGCSE Computer Science 0478: Pseudocode basics, variables and input/output
Students learn Cambridge pseudocode conventions and how to declare variables and constants, choose data types, assign values, and use INPUT and OUTPUT.
9
IGCSE Computer Science 0478: Operators, conditions and string handling
Students use arithmetic, relational and logical operators to write precise conditions, and use LENGTH, SUBSTRING, UCASE and LCASE on strings.
11
IGCSE Computer Science 0478: Selection and iteration in pseudocode
Students write IF, CASE, FOR, WHILE and REPEAT structures, including nested selection, and use counting and totalling in loops.
19
IGCSE Computer Science 0478: Validation and verification
Students learn the validation checks (range, length, type, presence, format and check digit) and the verification checks (visual and double entry), and write a validated input algorithm.
23
IGCSE Computer Science 0478: Test data and trace tables
Students suggest normal, abnormal, extreme and boundary test data, complete trace tables for dry runs, use them to find errors, and apply the whole life cycle to a scenario.
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: 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
🔎
Years 5–6 Creating Digital Solutions 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
✎
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
✎
VCE Software Development U4O1 Crossword: Code repositories, APIs, libraries and AI assistants to Beta testing (Modules 125–171)
10 clues · Keeping API keys secure, Validation versus verification, Alpha testing, Commenting out code to isolate a bug and more
🔎
VCE Software Development U4O1 Word Search: Code repositories, APIs, libraries and AI assistants to Beta testing (Modules 115–171)
22 words to find · Branches and merging, What a library is: standard vs third-party, Random numbers with import random, The math module and more
✎
VCE Data Analytics U4O1 Crossword: Audience and developing infographics and dashboards to Data quality and testing visualisations (Modules 63–83)
10 clues · Pagination of an infographic or dashboard, Clarifying data refresh requirements, Visual hierarchy in a visualisation, Clarity of message in a visualisation and more
🔎
VCE Data Analytics U4O1 Word Search: Audience and developing infographics and dashboards to Recording and assessing project progress (Modules 63–105)
20 words to find · Pagination of an infographic or dashboard, Clarifying data refresh requirements, Visual hierarchy in a visualisation, Clarity of message in a visualisation 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 1 Crossword: 2.2 Methods of Error Detection (Modules 168–178)
10 clues · Checksum, Calculating a checksum, Checking a checksum at the receiver, What a checksum can and cannot detect and more
🔎
IGCSE Computer Science Paper 1 Word Search: 2.2 Methods of Error Detection (Modules 168–188)
21 words to find · Checksum, Calculating a checksum, Checking a checksum at the receiver, What a checksum can and cannot detect and more
✎
Crossword: 7a Program Development Life Cycle (Modules 1–16)
10 clues · The program development life cycle, The analysis stage, Identifying the problem, Abstraction (7a) and more
✎
Crossword: 7a Program Development Life Cycle (Modules 17–26)
10 clues · The testing stage, Matching a task to its PDLC stage, Pseudocode as a design method, Keywords in capital letters and more
✎
Crossword: 7a Program Development Life Cycle (Modules 27–36)
10 clues · CONSTANT declarations, Assignment with ← (7a), INPUT command, OUTPUT command and more
✎
Crossword: 7a Program Development Life Cycle (Modules 37–46)
10 clues · LENGTH function, SUBSTRING function, UCASE and LCASE functions, IF ... THEN ... ENDIF (7a) and more
✎
Crossword: 7a Program Development Life Cycle (Modules 47–57)
10 clues · REPEAT ... UNTIL loop (7a), Choosing between FOR, WHILE and REPEAT, Counting in a loop (7a), Totalling in a loop (7a) and more
✎
Crossword: 7a Program Development Life Cycle (Modules 60–70)
10 clues · Re-asking for input until it is valid, Combining validation checks, What validation cannot do, Choosing a validation check for a field and more
✎
Crossword: 7a Program Development Life Cycle (Modules 71–82)
10 clues · Normal test data, Abnormal test data, Extreme test data, Boundary test data and more
✎
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
🔎
Word Search: 7a Program Development Life Cycle (Modules 1–26)
20 words to find · The program development life cycle, The analysis stage, Identifying the problem, Abstraction (7a) and more
🔎
Word Search: 7a Program Development Life Cycle (Modules 27–46)
20 words to find · CONSTANT declarations, Assignment with ← (7a), INPUT command, OUTPUT command and more
🔎
Word Search: 7a Program Development Life Cycle (Modules 47–70)
20 words to find · REPEAT ... UNTIL loop (7a), Choosing between FOR, WHILE and REPEAT, Counting in a loop (7a), Totalling in a loop (7a) and more
🔎
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
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.
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 →