Welcome to A2 — the deeper half of the journey
Your instructor
I'll be teaching you A2 Computer Science this year — Papers 3 and 4, all eight topics ahead, and everything in between.
From Data Representation through to Further Programming — we'll build it together, one topic at a time.
Questions are welcome in class, after class, or before the next one — the earlier you ask, the easier it is to debug.
My goal is simple: that you leave this course not just able to pass Computer Science 9618, but genuinely thinking like a computer scientist.
Reflect · Share with the room
Before we open new content, look back at AS. Pick the thing that genuinely helped you (something worth other people stealing), and the one thing you want to fix this year. Share both with the person next to you.
The bigger picture
Every topic on this syllabus already exists somewhere in the world doing real work. Here's where A2 Computer Science shows up outside the classroom.
Neural networks and machine learning now drive diagnosis, translation and search.
Encryption protocols and digital certificates protect every transaction online.
Public and private clouds now run the infrastructure behind most software.
Structured programming and testing turn ideas into systems people rely on.
Algorithms, data structures and OOP power every engine and every level.
Databases and computational thinking turn raw data into real decisions.
Cryptography and secure protocols underpin banking, trading and digital payments.
Understanding file systems and data recovery is how digital crime is solved.
Where you've been, where you're going
AO1 : AO2 : AO3 weighting shifts from 30 : 40 : 30 at AS to 30 : 30 : 40 at A Level — design and evaluation start to carry more of the mark.
The syllabus, topic by topic
Everything below sits on top of the AS foundations you already have.
User-defined types, file organisation and floating-point representation.
Protocols, the TCP/IP suite, circuit and packet switching.
RISC vs CISC processors, parallel processing, Boolean algebra.
Operating system purposes, process management and translation software.
Encryption, SSL/TLS, digital certificates and quantum cryptography.
Graph search, neural networks and machine learning categories.
Searching, sorting, abstract data types and recursion.
Programming paradigms, file processing and exception handling.
How it all connects
Nothing here is random — each topic builds the machinery the next one needs.
How data is represented before it can be moved or processed.
Protocols move that data reliably between devices.
Processors and virtual machines actually execute the work.
The OS manages that hardware on everyone's behalf.
Protecting the data and systems built on all of the above.
Systems that learn from the secured data we now hold.
The algorithms that make all of this efficient.
Our tool for turning every idea above into working software.
Details of the assessment
75 marks · A2 content, sections 13–20, AS assumed knowledge required.
75 marks · Practical programming in Java, Visual Basic or Python.
60% knowledge and understanding, 40% application.
100% design, programming and evaluation skills.
Insight from examiner reports
Writing real language syntax when pseudocode is asked for. Naming a component without explaining its role. Vague command-word responses — "describe" answers that actually try to "explain".
They use precise computer science terminology, show their working in a trace table, and answer the exact command word — not a nearby one.
Marks are point-based against a scheme. Each distinct, correct idea earns a mark — repeating the same idea in different words does not.
"State" wants a fact. "Explain" wants reasoning behind it. Misreading the command word is the single most common way marks are lost.
Interactive · Click a card to flip
Before flipping, guess what the examiner actually wants from you. All command words are from the official 9618 syllabus.
The transferable toolkit
Following an algorithm step by step to find its output.
Converting between structured English, flowcharts and pseudocode.
Normal, abnormal and boundary data, correctly identified.
Choosing arrays, records and ADTs to fit the problem.
Spotting syntax, logic and run-time errors, then fixing them.
Big O notation — knowing which algorithm scales for which task.
Paper 4 · Practical
No internet or email access in the exam room — just you, an IDE, and the problem in front of you.
Meaningful names, correctly typed, in an identifier table.
Normal, abnormal and boundary values, all in the test plan.
Syntax vs logic vs run-time — and what each looks like when it fails.
Efficiency, readability, and how the solution could be improved.
Habits that compound
Anchor every session to the four pillars: coursebook → dry runs → active coding → past papers, then read the examiner report for anything you got wrong.
Your toolkit for the year
Your primary text — read before every lesson.
Official syllabus, specimen papers and pseudocode guide.
Topic questions organised exactly to this syllabus.
Free past papers and mark schemes by topic.
The single highest-value revision resource there is.
Video walkthroughs built specifically around this syllabus.
Write and run real code in the browser — no setup needed.
Spaced-repetition decks you can review anywhere, anytime.
How we'll work together
Ask the question. It's almost never a silly one.
Short, regular, and reviewed the next lesson.
Careful, methodical, and genuinely hands-on.
For each other, for equipment, for mistakes.
Follow the "why" past the point it's convenient.
Each topic builds on the last — missed lessons cost more than one.
A wrong answer is data, not a verdict.
Explaining an idea to someone else is how you learn it twice.
No shortcuts, just a formula
It's a product, not a sum — if any one term drops to zero, so does the result. Mistakes especially: they're multiplied in, not subtracted out.
Group discussion · 5 minutes
Weigh productivity gains against skill loss, trust and accountability.
Where's the line between public safety and constant surveillance?
Consider deterrence, victim harm, and who ultimately decides.
Choose one. In your group, build the strongest case for and the strongest case against — then we'll open it to the room.
Let's build it together.