What is a trace table in Computer Science?

A trace table is a technique used to dry run an algorithm line-by-line. Columns represent variables, conditions, and outputs, while rows track changes in value as the program executes.

How are trace tables graded in Cambridge IGCSE exams?

In Cambridge Paper 2 exams, marks are awarded for correctly updated variable values under their respective column headers, recording changes only when a variable value changes.

Can I generate custom trace table practice questions on PseudoStudio?

Yes! PseudoStudio lets you generate custom trace table practice exercises based on loops, arrays, string parsing, or sorting algorithms with automated instant feedback.

DRY RUN ALGORITHMS CAMBRIDGE PAPER 2 EXAM STANDARD INSTANT GRID VERIFICATION

Trace Table Practice Questions & Interactive Generator

Master pseudocode dry-running for Cambridge IGCSE & A-Level. Customize your trace table exercises, track variable changes step-by-step, and receive instant column-by-column automated grading.

01 SELECT SYLLABUS ALIGNMENT

IGCSE Computer Science (0478/0984)

A-Level Computer Science (9618)

02 PRACTICE MODE

📊 Trace Table Dry Runs

03 SELECT ALGORITHM TYPES (CLICK TO TOGGLE)

Trace Tables & Loop Counters

FOR / WHILE Sentinel Loops

IF / ELSE Conditional Branches

1D Array Searches

Bubble & Insertion Sort Steps

String Substring Parsing

04 TRACE TABLE COMPLEXITY

Beginner (3 Variables, Single Loop)

Standard (4 Variables, Conditional Loop)

Advanced (Nested Loops & Arrays)

Paper 2 Exam Standard

05 NUMBER OF TRACE TABLES

3 Exercises

5 Exercises

8 Exercises

TRACE TABLE SESSION

Custom Dry Run Ready

IGCSE 0478/0984

20 Marks

ESTIMATED MARKS

15 Mins

TARGET TIME

2 TOPICS SELECTED

Trace Tables & Loop Counters FOR / WHILE Sentinel Loops

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

EXAM RULES

How Cambridge Trace Tables Work (Paper 2)

In Cambridge Computer Science exams, you are presented with a pseudocode algorithm and a blank trace table grid. Here is a live example of how values are recorded:

                    Total ← 0

                    FOR I ← 1 TO 3

                        Total ← Total + (I * 2)

                    NEXT I

                    OUTPUT "Final Total:", Total

Iteration / Line	I	Total	OUTPUT
Line 1	—	0	—
Loop Pass 1 (I=1)	1	2	—
Loop Pass 2 (I=2)	2	6	—
Loop Pass 3 (I=3)	3	12	—
Line 5	—	—	"Final Total: 12"

⚡ Solve Interactive Trace Table →

FAQ

Trace Table Frequently Asked Questions

What is a trace table and why is it useful? ▼

A trace table is a structured grid used to dry run an algorithm line-by-line manually. It helps programmers and exam students verify logic, track variable state changes, and locate logic errors (bugs) before running code on a computer.

Should I write a value in every single cell of a trace table? ▼

No! In Cambridge mark schemes, you only write a value in a column when that variable's value actually changes on that step. Leaving cells blank when values do not change is standard exam practice.

How does PseudoStudio grade my trace table submission? ▼

When you solve a trace table on PseudoStudio, our backend evaluates every cell in your grid against the exact step-by-step state matrix generated by running the interpreter. Correct cells turn green and incorrect cells turn red with helpful hints.