ÌÇÐÄVlog

Please consent to cookies to view content.

' ); iframeDoc.close(); } } } } } const observer = new MutationObserver(switchSrc); observer.observe(document.documentElement, { childList: true, subtree: true, }); })();

ÌÇÐÄVlog

Last updated

4 November 2026

pdf, 7.25 MB
pdf, 7.25 MB
pdf, 509.8 KB
pdf, 509.8 KB
Cambridge IGCSE Computer Science (0478 / 0984) Pseudocode Workbook

From first steps to full mastery, with a complete answer book

This complete pseudocode course for Cambridge IGCSE Computer Science is laid out as one print-ready workbook. It takes students from their very first algorithm to full 15-mark scenario questions, in 14 sections that get harder as they go.

All code follows the Cambridge IGCSE pseudocode conventions used in the exam: � for assignment, DECLARE, ENDIF, NEXT, ENDWHILE, OPENFILE and more. Students never pick up habits that lose marks.

What’s included
  • 111-page student workbook, a print-ready A4 landscape PDF
  • 29-page answer book with model answers, completed trace tables and marking notes for every question
  • Typable PDF: students can type straight into the code lines, gaps, trace tables and tick boxes, or print it and write by hand
  • Two-page pseudocode reference card and a progress tracker
Every section follows the same structure
  1. Learn it: a clear explanation, the syntax pattern and a worked example with annotated code
  2. Fill the gaps: cloze-style code, with word banks early on that are later taken away
  3. Fix it: broken code where students find, explain and correct each error
  4. Trace it: trace tables and dry runs
  5. Write it: students write their own algorithm from a brief, with a checklist
  6. Mastery challenge: an exam-style question, a Can I…? self-assessment and a teacher sign-off
The 14 sections
  1. Thinking in algorithms
  2. Variables, constants and data types
  3. Input, output and operators (DIV, MOD, ROUND, RANDOM)
  4. Selection (IF, nested IF, CASE, AND / OR / NOT)
  5. Iteration (FOR, WHILE, REPEAT)
  6. Standard methods (totalling, counting, max, min, average)
  7. String handling
  8. Validation, verification and test data
  9. Arrays (1D and 2D)
  10. Linear search and bubble sort
  11. Procedures and functions
  12. File handling
  13. Trace tables and dry runs
  14. Exam mastery, with two full 15-mark scenario questions
Why teachers like it
  • Scaffolded to independence: support is gradually removed until students are working at exam level on their own
  • Contexts students relate to: games, phones, music, sport and food orders, while keeping exam-style wording throughout
  • Clean, professional design that prints well in colour or greyscale
  • Flexible: works for whole-class teaching, homework, revision, cover lessons and catch-up
Suitable for

Cambridge IGCSE Computer Science 0478 and 0984 (also O Level 2210), Years 10–11 / Grades 9–10.

Tip: print the workbook for each student and keep the answer book for yourself, or share the typable PDF for remote or homework use.

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

to let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.