PseudoStudio Logo PRACTICE HUB
START SOLVING →
CAMBRIDGE IGCSE 0478 / 0984 A-LEVEL 9618 AUTOMATED GRADING

Pseudocode Practice Questions & Custom Test Builder

Assemble your custom Cambridge exam practice test. Select your syllabus, target topics, and difficulty level to solve interactive coding exercises with instant compiler grading and step-by-step trace tables.

01 SELECT SYLLABUS
IGCSE Computer Science (0478/0984)
A-Level Computer Science (9618)
General Pseudocode Practice
02 PRACTICE MODE
💻 Pseudocode Coding & Verification
📊 Trace Table Dry Runs
03 SELECT PRACTICE TOPICS (CLICK TO TOGGLE)
FOR / WHILE / REPEAT Loops
Variables & Constants
IF / CASE Statements
1D & 2D Arrays
Functions & Procedures
String Manipulation
Input Validation
Sorting Algorithms
File Handling
Trace Tables
04 DIFFICULTY LEVEL
Easy (Foundational)
Medium (Standard)
Hard (Advanced)
Exam Paper Challenge
05 NUMBER OF QUESTIONS
3 Questions
5 Questions
10 Questions
CUSTOM TEST SUMMARY

Practice Session Ready

IGCSE 0478/0984

25 Marks

ESTIMATED SCORE

18 Mins

TARGET DURATION

2 TOPICS SELECTED
FOR / WHILE / REPEAT Loops Variables & Constants

🔒 Free 1-click Google Sign-in to unlock and save progress

EXAM PREVIEW

Cambridge Practice Question Samples

Explore real exam-style pseudocode questions available in our interactive bank.

LOOPS & ARRAYS MEDIUM • 6 MARKS

Array Sum & Average Calculation

Write a pseudocode algorithm that declares an array Scores of 10 integers. Prompt the user to input 10 scores, calculate the total sum and average score, and output the total count of scores greater than 50.

DECLARE Scores : ARRAY[1:10] OF INTEGER DECLARE Total, Count, I : INTEGER DECLARE Average : REAL Total ← 0 Count ← 0 FOR I ← 1 TO 10 OUTPUT "Enter score ", I, ":" INPUT Scores[I] Total ← Total + Scores[I] IF Scores[I] > 50 THEN Count ← Count + 1 ENDIF NEXT I Average ← Total / 10 OUTPUT "Total:", Total OUTPUT "Average:", Average OUTPUT "Scores > 50:", Count
⚡ Solve in Compiler →
TRACE TABLES EXAM PAPER 2 • 8 MARKS

Dry Run Trace Table for Loop Algorithm

Complete the trace table for the given algorithm when the input values are 14, 27, 8, 32, -1.

Count ← 0 Sum ← 0 INPUT Value WHILE Value <> -1 DO IF Value MOD 2 = 0 THEN Sum ← Sum + Value Count ← Count + 1 ENDIF INPUT Value ENDWHILE OUTPUT "Even Sum:", Sum
⚡ Solve Trace Table →

How to Excel in Cambridge Computer Science Pseudocode (0478/9618)

1. UPPERCASE Keywords

Cambridge mark schemes strictly require keywords to be formatted in ALL CAPS: DECLARE, INPUT, OUTPUT, IF ... THEN ... ELSE ... ENDIF, FOR ... TO ... NEXT.

2. Arrow Assignment (←)

In Cambridge pseudocode, variable assignment uses ← (or <-), never =. The = sign is reserved strictly for equality comparison in IF conditions.

3. 1-Based Array Indexing

Unlike Python or Java, Cambridge pseudocode arrays are indexed starting from 1 by default: DECLARE StudentNames : ARRAY[1:30] OF STRING.

FAQ

Frequently Asked Questions

How can I practice Cambridge pseudocode online for free? ▼
PseudoStudio provides a free online IDE, compiler, and practice test builder designed specifically for Cambridge IGCSE (0478/0984) and A-Level (9618) Computer Science students. You can build custom tests, execute code in the browser, and practice trace tables.
What is the difference between Paper 2 pseudocode and programming languages? ▼
Pseudocode is a high-level algorithmic language designed for human readability and exam grading. Unlike Python or Java, Cambridge pseudocode requires mandatory keyword capitalization, arrow assignment (←), explicit variable declarations with types, and 1-indexed arrays.
How are trace table practice questions evaluated? ▼
PseudoStudio dry-runs your pseudocode and generates the canonical step-by-step state matrix. When you complete a trace table practice exercise, our system automatically compares every single cell value and provides instant column-by-column grading.