Programming & Code Tracing Technique

Paper 1 of the AQA A-Level Computer Science exam places heavy emphasis on your ability to read, trace, write, and debug code. This lesson covers the specific techniques you need to excel at code-tracing questions, write effective solutions in AQA pseudo-code or a named programming language, approach algorithm design questions systematically, and avoid the common mistakes that cost students marks.

---

Code Tracing: The Foundation Skill

Code tracing is the process of manually following the execution of a program, tracking the values of variables at each step. It is a fundamental skill tested extensively on Paper 1 and is also essential for debugging your NEA project.

Why Code Tracing Matters

Reason	Detail
Direct marks	Trace table questions appear on almost every Paper 1 paper, typically worth 4–8 marks
Indirect value	Understanding how code executes helps you write better code and spot errors
Debugging skill	Trace tables are the most reliable method for finding logic errors
Full marks or nothing	Trace tables are often marked right-or-wrong — partial credit is limited if you make an early error that cascades

How to Build a Trace Table

A trace table has one column for each variable in the program (plus an output column if the program produces output) and one row for each step that changes a variable's value.

Step-by-step method:

1. Identify all variables — Read through the entire code before you start. List every variable, including loop counters, accumulators, and function parameters.
2. Create columns — One column per variable, plus a column for any output (print statements, return values).
3. Execute line by line — Start at the first executable line. Do NOT skip any step, even if it seems obvious.
4. Update only changed variables — For each line, only write a new value in the column of the variable that changes. Leave other columns blank (or repeat the value, depending on the convention your teacher uses).
5. Handle loops carefully — For each iteration of a loop, check the loop condition first. If the condition is false, skip the loop body entirely.
6. Show your working — If a line involves a calculation, write the intermediate calculation in the margin or as a note. This helps you and the examiner track your reasoning.

Example Trace Table

Consider the following code:

x = 5
y = 3
WHILE x > 0
    y = y + x
    x = x - 2
ENDWHILE
OUTPUT y

Step	x	y	Output
1	5	3
2 (loop check: 5 > 0 = TRUE)
3		8
4	3
5 (loop check: 3 > 0 = TRUE)
6		11
7	1
8 (loop check: 1 > 0 = TRUE)
9		12
10	-1
11 (loop check: -1 > 0 = FALSE)
12			12

Exam Tip: The most common error in trace tables is getting loop conditions wrong. Always re-evaluate the condition at the start of each iteration. Pay particular attention to < vs <=, > vs >=, and off-by-one errors.

Common Trace Table Pitfalls

Pitfall	How to Avoid It
Forgetting to initialise variables	Always write the initial values in the first row
Off-by-one errors in loops	Check the loop condition before every iteration, not just at the start
Confusing = and ==	= is assignment, == is comparison. In a trace table, x = x + 1 changes x; x == 5 tests x
Ignoring integer division	7 DIV 2 gives 3, not 3.5. AQA pseudo-code uses DIV for integer division and MOD for modulus
Mishandling nested loops	Trace the inner loop completely for each iteration of the outer loop
Not tracking function calls	When a function is called, trace into the function body, then return to the calling point
Forgetting scope	Local variables in a function do not exist outside that function

---

AQA Pseudo-Code

AQA has a specific pseudo-code syntax defined in their specification. While you can answer programming questions in any language (Python, Java, C#, VB.NET, etc.), you must be able to read and understand AQA pseudo-code because exam questions will use it.

Key AQA Pseudo-Code Constructs

Construct	AQA Pseudo-Code	Python Equivalent
Assignment	x <- 5	x = 5
Output	OUTPUT x	print(x)
Input	x <- USERINPUT	x = input()
If statement	IF x > 5 THEN ... ELSE ... ENDIF	if x > 5: ... else: ...
For loop	FOR i <- 1 TO 10 ... ENDFOR	for i in range(1, 11):
While loop	WHILE x > 0 ... ENDWHILE	while x > 0:
Repeat until	REPEAT ... UNTIL x > 0	No direct equivalent (use while True with break)
Subroutine	SUBROUTINE name(params) ... ENDSUBROUTINE	def name(params):
Return	RETURN value	return value
Integer division	x DIV y	x // y
Modulus	x MOD y	x % y
String length	LEN(s)	len(s)
Substring	SUBSTRING(pos, length, s)	s[pos:pos+length]
Array access	a[i]	a[i]
Record	RECORD name ... ENDRECORD	class or named tuple

Key Point: You can write your answers in Python, Java, C#, VB.NET, or AQA pseudo-code. However, you MUST be able to read AQA pseudo-code because questions will present code in this format. Familiarise yourself with the AQA pseudo-code reference in the specification appendix.

Writing Code in Exams

When writing code in exam answers, clarity is paramount:

Principle	Detail
Use meaningful variable names	total, count, studentName — not x, y, z (unless they are clearly mathematical)
Indent consistently	Even in handwritten answers (Paper 2), indentation shows structure
Comment where necessary	Brief comments explaining your logic can earn marks and help examiners follow your thinking
Handle edge cases	Think about empty inputs, boundary values, and error conditions
Use appropriate data types	Show the examiner you understand the difference between integers, floats, strings, and Booleans

---

Programming Paradigms in the Exam

AQA tests three programming paradigms. You must understand when each is appropriate and be able to write code in at least two of them.

Procedural Programming

Feature	Detail
Definition	Programs structured as a sequence of instructions, using subroutines (procedures and functions) to organise code
Key concepts	Sequence, selection, iteration, subroutines, parameters, local/global variables
When tested	Most code-writing questions on Paper 1 expect procedural solutions unless OOP is specifically requested
Exam approach	Write clear functions with well-named parameters; avoid excessive use of global variables

Object-Oriented Programming (OOP)

Feature	Detail
Definition	Programs structured around objects that encapsulate data (attributes) and behaviour (methods)
Key concepts	Classes, objects, instantiation, encapsulation, inheritance, polymorphism, overriding, aggregation, composition
When tested	Specific OOP questions ask you to design class hierarchies, write class definitions, or explain OOP principles
Exam approach	Know the definitions precisely; be able to write class definitions with constructors, attributes, and methods; understand inheritance hierarchies

Functional Programming