Difficulty
Challenging
Key Facts
Difficulty
Challenging
National A* Rate
5.9% (JCQ, 2025)
Weekly Study Hours
5-7 hours
Assessment
80% exam, 20% NEA programming project
Popularity
Rising subject: 19,796 entries in 2025 (JCQ)
Section 01
The bulk of A-Level Computer Science is theory. You study how computers work at the hardware level (processor architecture, machine code, assembly), data representation (binary, hexadecimal, floating point, character sets), Boolean logic and logic gates, data structures (stacks, queues, trees, graphs, hash tables), algorithms and their efficiency (searching, sorting, Big-O, graph traversal), databases and SQL, networking and the internet, and the theory of computation, including finite state machines. Programming is taught and examined, but as a vehicle for computational thinking, and it culminates in a substantial Non-Exam Assessment (NEA): an independent software project worth 20% of the A-Level.
It is a challenging A-Level with the lowest A* rate of any subject in this guide: 5.9% in 2025 (JCQ). The reason is a mismatch; many students arrive expecting to build apps and meet abstract theory, mathematical logic and exam questions demanding precise technical writing. The programming project is genuinely hard to manage without independent problem-solving skill, and the written papers reward rigour, not enthusiasm. It is closer in spirit to A-Level Maths than to a GCSE ICT course.
It builds the mental model behind all computing: why code runs, why some algorithms are fast and others hopeless; and the NEA gives you a real project to discuss on applications and at interview. That said, be strategic: for a competitive CS degree, A-Level Maths matters more than this subject. Take Computer Science because the ideas grip you, not because you assume a CS degree demands it.
Section 02
Students who like understanding how things work at a fundamental level and who take A-Level Maths alongside; the mathematical logic, binary arithmetic and algorithmic reasoning reward it. Thrivers are self-directed: the NEA punishes students who need constant guidance and rewards those who can scope, build and debug a project largely on their own. A love of puzzles helps more than prior coding experience.
Students who choose it expecting practical IT skills (website building, video editing, general computer use) and hit abstract theory instead. Also those weak at maths, who find binary, logic and Big-O reasoning heavy going, and students who struggle to work independently, since the NEA is a months-long self-managed project with real deadlines.
GCSE Computer Science is helpful but not universally required; many sixth forms accept students without it. A Grade 6+ in GCSE Maths is strongly recommended and matters more than prior programming; the subject's logical and mathematical demands outweigh coding fluency. If you have never programmed, spending the summer learning basic Python levels the field.
Section 03
GCSE Computer Science introduces the topics; A-Level goes far deeper and more mathematical. Programming moves from short scripted tasks to a full independent project with proper design, testing and evaluation. New abstract areas appear: theory of computation, finite state machines, more demanding algorithm analysis with Big-O notation, and written answers must be technically precise, using exact terminology. The step is steeper for students who took GCSE ICT rather than Computer Science.
Get comfortable with your board's main language (usually Python; some schools use Java, C# or VB.NET). Work through free courses like Harvard's CS50 or freeCodeCamp to build real fluency; the NEA assumes you can program independently. Revisit binary and hexadecimal conversions until they are instant, and try a few logic-gate problems. Confidence with your language before Year 12 removes the single biggest source of early stress.
Assuming programming ability alone will carry the grade; the theory papers are where most marks are won or lost. Leaving the NEA until Year 13: strong projects are scoped early and built steadily. And writing exam answers casually; examiners want precise technical vocabulary, not everyday descriptions of how computers "sort of" work.
Section 04
AQA (7517) examines with an on-screen programming Paper 1 (you write and refine code at a computer), a written Paper 2 on theory, and a 20% NEA. OCR (H446) uses two written papers: Computer Systems (H446/01) and Algorithms and Programming (H446/02), plus a 20% programming project, and is known for its strong computational-thinking emphasis. Pearson Edexcel (9CP0) also runs written theory papers with practical programming questions plus a 20% coursework project.
Your school decides, and the biggest practical difference is the AQA on-screen exam: Paper 1 is sat at a computer, so students who program well under time can shine, while those who prefer written reasoning may favour OCR's fully written papers. The core content: architecture, data structures, algorithms, networking, theory of computation; broadly common across all three.
If you sit AQA, practise coding under exam conditions on the school's system, not just at home. On OCR, drill the two-paper split: Computer Systems is heavily theoretical, Algorithms and Programming is problem-led. Everywhere, start the NEA early and document as you go. The write-up (analysis, design, testing, evaluation) earns as many marks as the code itself.
Section 05
Split your effort. For theory: active recall on definitions and processes, plus lots of past-paper questions. Computer science exams reuse question patterns heavily, so past papers are unusually predictive. For algorithms: trace them by hand on paper (dry-run a bubble sort, walk a binary tree) rather than only reading them, because exams ask you to show each step. For the NEA: treat it as a real software project: version control, incremental testing, and a documentation log kept from day one.
Over-investing in the NEA at the expense of theory revision; it is only 20%, while the papers are 80%. Reading algorithms instead of hand-tracing them. And revising definitions loosely: exams demand exact terms ("the fetch-decode-execute cycle", not "the computer gets the instruction"), and imprecise language quietly bleeds marks across a whole paper.
Around five to seven hours a week, weighted towards theory: 3 hours of theory revision and past papers, 1-2 hours of programming practice, and dedicated NEA time in Year 13 (protect it, but do not let it crowd out exam preparation). In Year 12, front-load programming fluency so the project is not a crisis later.
Section 06
Assuming A-Level Computer Science is about learning to code. The exam papers are heavily theoretical: architecture, logic, algorithms, networking, databases. Enthusiastic programmers who neglect theory routinely underperform their expectations.
Reading algorithms instead of tracing them. Exams ask you to hand-execute a sort or traversal step by step; without dry-run practice, these guaranteed marks slip away.
Starting the NEA too late. A rushed project loses marks on design, testing and evaluation; the parts examiners reward most. Scope it modestly and start early rather than building something ambitious and unfinished.
Vague technical writing. "The CPU processes data" earns little; naming registers, buses and the fetch-decode-execute cycle earns the marks. Learn the exact vocabulary for each topic.
Ignoring number systems and Boolean logic as "easy" early topics. Binary, hex, two's complement and logic simplification recur throughout the papers and underpin harder material; shaky foundations here cost marks everywhere.
Believing A-Level Computer Science is required for a CS degree. Most top universities, including Oxford and Cambridge, do not require it; Maths is the key subject. Choosing it over Further Maths for a strong CS application can be a mistake.
Section 07
The single most important fact: for Computer Science degrees, A-Level Maths is the essential requirement almost everywhere, and Further Maths is highly recommended at the top departments. A-Level Computer Science itself is useful; it shows interest and eases the transition, but is NOT required by Oxford, Cambridge or most leading universities. It also supports data science, software engineering, cybersecurity and games programming degrees, where it is welcomed rather than demanded.
Maths + Computer Science + Physics (or Further Maths in place of Physics for the most competitive CS applications) is the strongest profile. The recurring question: “Do I need Computer Science A-Level for a CS degree?” has a clear answer: no; keep Maths, and add Further Maths before Computer Science if you are aiming at Oxbridge or Imperial.
For 2027 entry, both Cambridge and Oxford Computer Science require the TMUA (the MAT, which Oxford previously used, has been retired for these courses); Cambridge applicants to certain colleges additionally sit the CSAT. These are mathematics tests; further proof that Maths, not A-Level Computer Science, is the decisive subject. Check where you stand with our Free calculator.
Section 08
The British Informatics Olympiad (Year 13, sat in school around December) is the flagship algorithmic-programming competition and excellent Oxbridge preparation. Bebras (November) is a gentler computational-thinking challenge for all years and a good entry point. The Perse Coding Team Challenge and university hackathons add collaborative, project-based credentials worth discussing at interview.
Harvard's CS50 (free) is the standard enrichment course and builds exactly the independent programming skill the NEA needs. Computerphile on YouTube explains core concepts: encryption, algorithms, how CPUs work; at the right depth. One book: Charles Petzold's Code: The Hidden Language of Computer Hardware and Software, which builds a computer from first principles and makes the whole theory syllabus click. Project Euler offers programming puzzles that sharpen both coding and maths.
Independent projects you built and can explain (a personal program, an olympiad attempt, a genuine technical curiosity) carry far more weight than listing languages. Your NEA is ready-made material. Let your Personal statement show what you made and what it taught you.
Competitions & Challenges
The UK's flagship algorithmic-programming competition, sat in school; excellent Oxbridge preparation
December each year (Year 13)
Bebras Computational Thinking Challenge
A short, accessible reasoning challenge for all year groups; the natural entry point
November each year
A team programming competition with online rounds and a national final
Autumn and spring terms
Section 09
Our Computer science tutors (from Oxbridge, Imperial and top CS departments) help on the two hardest fronts: mastering the theory papers (architecture, algorithms, theory of computation) and scoping an NEA that scores well without spiralling. For applicants we run TMUA preparation and technical interview practice, and give honest advice on the Maths-first subject strategy. Tell us your target course and we will match a specialist.
Further Reading
Books, channels, and tools recommended by our expert tutors.
by Craig Sargent & Dave Hillyard
The go-to A-Level Computer Science channel, mapped topic-by-topic to AQA and OCR specifications
by Brady Haran / University of Nottingham
Core computing concepts: encryption, algorithms, architecture; explained by researchers
by Harvard University
Free, rigorous introduction to computer science that builds exactly the independent skill the NEA needs
by PMT
Free past papers, mark schemes and topic questions for AQA, OCR and Edexcel
by Charles Petzold
Builds a computer from first principles, and makes the whole theory syllabus finally click
by Project Euler
Mathematical programming puzzles that sharpen coding and algorithmic thinking together
by University of Cambridge / Raspberry Pi Foundation
Free, exam-board-mapped questions and notes covering the full A-Level specification