Write pseudocode the way the Cambridge IGCSE Computer Science (0478) exam expects it, then run it. Your code is checked strictly against the pseudocode section of the 0478 syllabus:
- every variable is declared before it's used (
DECLARE Total : INTEGER), and every value has to suit its data type: / always gives a REAL, so a whole-number answer needs DIV;
- assignment uses the arrow, ←: type
<--, or press the ← button;
- keywords are in capitals, and the IGCSE forms are used:
IF … THEN … ELSE … ENDIF, CASE OF … OTHERWISE … ENDCASE, FOR … TO … STEP … NEXT, REPEAT … UNTIL, WHILE … DO … ENDWHILE, DIV(…) and MOD(…), LENGTH, SUBSTRING, UCASE, LCASE, ROUND, RANDOM, procedures, functions and files.
Errors are listed under your code, and the program won't run until they're fixed. Style notes are how the IGCSE writes things (such as THEN on its own line): your program still runs, but it's worth matching the exam's style.
Run runs your program in the run window: OUTPUT appears there, and INPUT asks you for a value. Step runs one statement at a time, highlighting it. The trace table fills in as it runs, a new row whenever a variable changes again, as in the exam's trace tables.
Check answer runs your program on the question's tests, including some you can't see, so it has to work for any input, not just the example. Messages you show before an INPUT (prompts) aren't marked, and capitals, spaces and punctuation in the output don't matter. If it's not right, you're told which test it failed and what that suggests, never the answer. Stuck? Hint halves the question's marks; Show me shows a program that works, and the question scores nothing. Playground, in the title bar, is a free editor to try anything.
Signed in, your code is saved as you go. Topics your teacher has set come up first.
Objective: Cambridge IGCSE Computer Science 0478 (2026–2028), section 8 Programming and section 7 Algorithm design: write and test algorithms in pseudocode using variables, constants, data types, input and output, sequence, selection, iteration, totalling, counting, string handling, arithmetic, logical and Boolean operators, nested statements, procedures, functions, library routines, arrays and files.
Where this fits
- Cambridge: Cambridge IGCSE Computer Science (0478)