Close-up of Python code on a dark computer screen
Photo: Chris Ried / Unsplash

This article is published by Revision Library. Our own resource is described separately below.

How this list was made

I weighed each site against the work an A Level Computer Science student usually needs outside lessons: revising theory, practising algorithmic thinking on paper, checking data representation, rehearsing architecture and network explanations, and keeping project work separate from ordinary revision-site tasks. I compared access model, format and likely use case, then checked those strengths against Revision Library's A Level Computer Science library, topic guides, past-paper area, mock-paper area, flashcards and revision formats.

At a glance

SiteBest forPriceAccount
Physics and Maths Tutor (PMT)Best for exam-style question sheets by topicFreeNo account
Seneca LearningBest for free AI-marked practice questionsFree, with a paid tierFree to browse; account for some tools
CognitoBest for video-led revision across several qualification systemsFreeNo account
Tes (Teaching Resources marketplace)Best for teacher-shared resources across many subjectsFree, with a paid tierFree to browse; account for some tools

The full comparison

Physics and Maths Tutor (PMT)

Best for exam-style question sheets by topic

Physics and Maths Tutor (PMT) is a free resource site with revision notes, worksheets and past-paper questions sorted by topic and exam board, across maths, the sciences and several other GCSE/A Level subjects. It also sells separate paid tutoring, crash courses and printed workbooks alongside the free material.

PMT is free to use for its main notes, worksheets and past-paper questions, with resources arranged by topic and exam board across maths, sciences and several other GCSE and A Level subjects. For A Level Computer Science, it is a sensible first check for written theory support, but students should still confirm that the material matches the route they are studying.

Seneca Learning

Best for free AI-marked practice questions

Seneca Learning is a free-to-use revision platform with interactive courses, an AI-marked question bank and an AI study companion; a paid Premium upgrade adds further features. Its own level list runs from Primary and KS3 through the 11+, GCSE and iGCSE to A Level and the IB.

Seneca works best as guided online revision, with quick checks and AI-marked practice for supported courses. It is useful for keeping theory recall active, but it is less suited to project evidence and to handwritten algorithm tracing where the method needs to be inspected.

Cognito

Best for video-led revision across several qualification systems

Cognito (previously at cognitoedu.org) is a free video-led revision platform spanning many subjects and qualifications, including GCSE, A Level, IB and AP, with revision notes, a large quiz bank, flashcards and AI-marked exam-style questions.

Cognito is useful when a student prefers video-led explanation, notes, quizzes, flashcards and AI-marked questions before attempting written practice. Coverage runs across several qualification systems, so check the A Level Computer Science fit before relying on it as the main source.

Tes (Teaching Resources marketplace)

Best for teacher-shared resources across many subjects

Tes Teaching Resources is a marketplace of resources uploaded by individual teachers, spanning early years to secondary and special needs, rather than a single curated corpus. Free and paid resources are listed side by side.

Tes can be useful for teachers looking for Computer Science classroom resources, project prompts or extra worksheets. Because resources come from individual uploaders, check accuracy, level, date and exam fit before using them for independent revision.

Our own resource

Revision Library

Best for free printable practice with mark schemes

A Level Computer Science splits between written theory practice and a substantial programming project. The A Level Computer Science library serves the written side with printable packs and mark schemes, so students can practise algorithms, data representation, systems architecture, networks and security without relying on an interactive prompt to steer the answer.

The site is not trying to manage the programming project for the student. Project work needs teacher guidance, a real problem, design decisions, implementation evidence and testing records that no general revision website can supply automatically. Revision Library's role is narrower: the theory and written problem-solving practice that sits around that project.

The A Level Computer Science topic guides are the place to check a concept, while the Computer Science revision formats help turn that concept into a trace table, comparison answer, explanation or longer written response.

For exam-style work, students can use A Level Computer Science practice papers, the Computer Science past-paper area and Computer Science mock papers. For recall before writing, Computer Science flashcards are useful for terms, protocols, components and definitions.

Try a short written theory check before choosing the next resource. Being able to name selection or iteration does not yet show that you can follow changing variable values. Cover the worked trace below, dry run the algorithm by hand and write a sentence about its output before checking the answer. This is separate practice for written algorithm reasoning, not a design or implementation task for an assessed programming project.

Original written theory exercise (4 marks). A is the fixed array [6, 2, 7, 8, 1, 6], with indices 0 to 5 inclusive. The integer threshold is 6. A and threshold never change. Set run = 0 and best = 0. For each integer i from 0 to 5 inclusive, in increasing steps of 1: first, if A[i] >= threshold, set run = run + 1; otherwise set run = 0. Next, if run > best, set best = run; otherwise leave best unchanged. Record i, A[i], run and best after both updates on each iteration. After the loop, output best. State the output and explain what it represents.

Worked trace, with each row recorded after both updates. Columns: i | A[i] | run | best. Initial values before the loop: run = 0, best = 0. Rows: 0 | 6 | 1 | 1; 1 | 2 | 0 | 1; 2 | 7 | 1 | 1; 3 | 8 | 2 | 2; 4 | 1 | 0 | 2; 5 | 6 | 1 | 2. Final answer: output 2. This is the length of the longest consecutive sequence of values at least 6, the adjacent values 7 and 8; the final run is only 1 because the value 1 breaks the earlier sequence.

Mark scheme (4 marks), in two columns: mark | criterion. M1 | Apply the threshold test to increase run or reset it to 0. M1 | Compare the updated run with best and retain the larger value. A1 | Give all six trace rows and final output 2 correctly. B1 | Explain that 2 is the length of the longest consecutive sequence of values at least 6. Credit equivalent trace layouts and explanations.

A finite state machine needs a different kind of trace: record the state after each input symbol, then decide acceptance when the whole input has been read. The data representation and theory of computation guide explains the method. Cover the solution below and try this original example first.

Original finite state machine exercise (4 marks). The input alphabet is {0, 1}. The states are R0, R1 and R2. The start state is R0 and the only accepting state is R1; R0 and R2 are rejecting states when input ends. The complete transition table, written as current state | input | next state, is: R0 | 0 | R0; R0 | 1 | R1; R1 | 0 | R1; R1 | 1 | R2; R2 | 0 | R2; R2 | 1 | R0. Read from left to right, taking exactly one transition per symbol. Trace 10110 from the start, state whether it is accepted and explain whether visiting R1 earlier is enough for acceptance. Then check the nearby inputs 1010 and 101110, restarting at R0 for each.

Worked trace for 10110. Columns: symbols read | state. Rows: none | R0; 1 | R1; 10 | R1; 101 | R2; 1011 | R0; 10110 | R0. Final answer: 10110 is rejected. The machine visits accepting state R1 after the first and second symbols, but it must still process the remaining symbols. After the whole input it is in R0, which is not accepting. Acceptance depends only on the final state after all symbols have been consumed; an earlier visit does not stop the trace or guarantee acceptance.

Nearby checks, each starting at R0: 1010 follows R0, R1, R1, R2, R2 and is rejected; 101110 follows R0, R1, R1, R2, R0, R1, R1 and is accepted. Each 1 advances around the cycle R0, R1, R2, R0, while each 0 leaves the state unchanged. The accepted strings therefore contain a number of 1s that leaves remainder 1 when divided by 3, such as 1, 4 or 7 ones. The empty input is rejected because no transition is taken and the machine remains in start state R0.

Mark scheme (4 marks), in two columns: mark | criterion. M1 | Apply one transition per symbol from R0, showing all five resulting states for 10110. A1 | Obtain R1, R1, R2, R0, R0 and conclude that 10110 is rejected. B1 | Explain that the state after the whole input determines acceptance despite the earlier visit to R1. A1 | Give the nearby traces ending in R2 for 1010 (rejected) and R1 for 101110 (accepted). Credit equivalent trace layouts and explanations. If you stopped at the first R1, finish every transition before judging acceptance. If a 0 changed your state, check the self-transitions in the table and try the trace again.

Browse free A Level Computer Science practice

In the numbers

packs
19
question pages
141

A Level Computer Science worksheet packs, each with a full mark scheme

How to choose

Separate the theory paper from the programming project before choosing a site. A notes site can help with processors, databases, networks, data structures or Boolean logic; it cannot decide whether a student's project problem is appropriate or whether their testing evidence is strong enough.

For written theory, choose a resource that makes you answer in the form the paper expects. Algorithm questions need dry running and trace tables. Data representation needs visible working. Architecture, databases and networks need precise explanation, not a remembered paragraph pasted into every question. The topic guides to searching, sorting and path-finding algorithms, databases, SQL and normalisation and Boolean algebra and logic gates each set the method out on paper before the exam-style questions.

For programming, use revision sites as support rather than as the project plan. A short tutorial may fix a syntax issue or remind you of a data structure, but the project still needs your own design choices, implementation trail and testing decisions.

Once a topic feels familiar, move into mixed work through Computer Science past-paper packs or the Computer Science past-paper area. Mixed questions expose whether you can recognise the topic, not just answer it when the worksheet title gives it away.

If you are choosing between GCSE and A Level resources, keep the levels separate. The GCSE comparison belongs to the GCSE Computer Science websites guide, while this page is for A Level written theory practice and project-adjacent support.

If you can name a construct such as selection or iteration but cannot execute it or explain its result, choose a worked explanation from the A Level Computer Science topic guides and trace it one update at a time. Flashcards can check the name, but the next step here is the method: close the explanation, attempt the original exercise above and compare every variable with the worked trace. If you reset best when run resets, revisit why best stores the longest sequence seen so far. If the trace is right but the explanation is vague, use the Computer Science revision formats to practise linking the final value to what the algorithm measures. Once both are secure, choose an unseen question from the A Level Computer Science worksheets and mark the working as well as the answer.

Keep this written theory practice distinct from assessed project assistance. A correct trace is evidence of following a supplied algorithm; the assessed project still requires your own problem, design choices, implementation trail and testing decisions, with teacher guidance. Use the practice to repair the identified reasoning gap before returning to your own project work.

Frequently asked questions

What should an A Level Computer Science revision website help with?
It should help with theory knowledge, algorithmic thinking, data representation, written explanations, trace tables and exam-style practice. Project work may need supporting tutorials, but it also needs teacher guidance and the student's own design and testing decisions.
Can a revision website do the programming project for me?
No. A website can help you revise concepts or fix a programming weakness, but the project has to be your own planned, developed and tested solution. Treat revision resources as support, not as a substitute for the project process.
How should I practise algorithm questions at A Level?
Print the question, complete the trace table or dry run by hand, then mark the method as well as the final output. The A Level Computer Science worksheets are useful because they force the working to stay visible.
Should I revise Computer Science with videos or worksheets?
Use videos when the concept is unclear, then switch to worksheets or practice papers. Written practice is where you find out whether you can explain, trace, convert, compare and justify without the explanation still open beside you.

Revision Library resources in this article