
This article is published by Revision Library. Our own resource is described separately below.
How this list was made
We ranked resources by whether they help a student balance the written course with the programming project across two years. Last checked 17 September 2026.
At a glance
| Site | Best for | Price | Account |
|---|---|---|---|
| Physics and Maths Tutor (PMT) | Best for exam-style question sheets by topic | Free | No account |
| Save My Exams | Best for revision guides alongside practice papers | Free, with a paid tier | Free to browse; account for some tools |
| Cognito | Best for video-led revision across several qualification systems | Free | No account |
| Seneca Learning | Best for free AI-marked practice questions | Free, with a paid tier | Free to browse; account for some tools |
The full comparison
Physics and Maths Tutor (PMT)
Best for exam-style question sheets by topicPhysics 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.
Physics and Maths Tutor is helpful when the written-course weakness is a specific topic, because it offers free notes, worksheets and past-paper questions organised by topic and exam board. Pair it with timed written answers rather than only reading notes.
Save My Exams
Best for revision guides alongside practice papersSave My Exams is a revision platform for GCSE, IGCSE and AS/A Level, with revision notes, exam-style questions, flashcards, mock exams and past papers across more than two dozen subjects. A free account gives access to some content; a paid Premium tier unlocks the rest.
Save My Exams is useful when a Computer Science student wants notes, exam-style questions, flashcards, mock exams and past papers in one account-based space. It can help rebuild a topic before the student tests it in writing.
Cognito
Best for video-led revision across several qualification systemsCognito (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 can help when a concept needs reteaching before exam practice. Its video-led format is strongest when followed by a written explanation or algorithm trace, because the A Level papers reward precise wording and comparison.
Seneca Learning
Best for free AI-marked practice questionsSeneca 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 can support frequent retrieval of definitions, components and theory vocabulary. Use it as a check layer, then practise longer answers where a mark scheme expects explanation rather than quick recognition.
Our own resource
Revision Library
Best for free printable practice with mark schemesThe danger in A Level Computer Science revision is that project work can look like revision while leaving the written course untouched. The A Level Computer Science library is useful for printable practice, but it should sit in a calendar that also protects project development time.
Use the A Level Computer Science topic guides to turn theory into written explanations. A student may understand networks, data structures or databases through coding, yet still need to rehearse the definitions, comparisons and trade-offs in exam language. The guides to networking and the Internet, data structures and their operations and databases and SQL give that exam wording for three of the areas most often learned through code first.
Use the worked example from the databases and SQL guide to turn coding knowledge into a written explanation. Keep this rehearsal separate from assessed project work. Read the prompt, write your query on paper, then compare your reasoning with the six steps below.
A car hire company stores its data in three tables: VEHICLES(VehicleReg, Model, DailyRate, BranchID), BOOKINGS(BookingID, VehicleReg, CustomerID, StartDate, EndDate, TotalCost) and CUSTOMERS(CustomerID, CustomerName, Phone). Write an SQL query to list the CustomerName and TotalCost for every booking of a vehicle with the Model 'Ford Focus', with the highest TotalCost listed first.
Identify the required output columns and where they live: CustomerName is in CUSTOMERS, TotalCost is in BOOKINGS.
Start the FROM clause at BOOKINGS, since it holds a foreign key to both other tables (CustomerID and VehicleReg).
JOIN CUSTOMERS ON BOOKINGS.CustomerID = CUSTOMERS.CustomerID to bring in CustomerName.
JOIN VEHICLES ON BOOKINGS.VehicleReg = VEHICLES.VehicleReg so the query can filter by Model.
Add WHERE VEHICLES.Model = 'Ford Focus' to restrict the rows to that vehicle model.
Add ORDER BY BOOKINGS.TotalCost DESC so the highest-cost bookings appear first, giving the final statement: SELECT CUSTOMERS.CustomerName, BOOKINGS.TotalCost FROM BOOKINGS JOIN CUSTOMERS ON BOOKINGS.CustomerID = CUSTOMERS.CustomerID JOIN VEHICLES ON BOOKINGS.VehicleReg = VEHICLES.VehicleReg WHERE VEHICLES.Model = 'Ford Focus' ORDER BY BOOKINGS.TotalCost DESC;
Turn the query into a written explanation: the output columns come from two tables, but a third table supplies the model used for filtering. BOOKINGS connects the customer to the hired vehicle through its two foreign keys. Those table relationships attach the right name and model to each booking. The condition keeps Ford Focus bookings, while the ordering places the largest cost first. Each returned row represents a booking, so the same customer can appear more than once.
Review your attempt by decision to find the narrow part to practise next. If you chose the wrong output columns, practise locating each requested field in the schema before writing SELECT. If you could name the fields but could not explain the table relationships, sketch the two key matches and rehearse each JOIN condition. This distinguishes difficulty selecting fields from difficulty matching keys, even when both leave the query unfinished.
Check filtering and ordering separately. If other models remain, revisit WHERE and the single quotes around 'Ford Focus'. If the right bookings appear in the wrong sequence, revisit ORDER BY and explain why DESC puts the highest TotalCost first. A working filter does not prove you understand sorting. Return to the relevant step in the guide, then use the databases and SQL practice pack for the part you identified. Write the reason for that choice beside your next revision task.
Mock practice exists here and should be used deliberately. The A Level Computer Science practice papers and Computer Science mock papers help check whether theory, algorithms and problem solving survive under timed conditions.
Do not build the plan around a diagnostic that is not there. Revision Library does not currently have an A Level Computer Science diagnostic or an A Level Computer Science revision checklist. The diagnostic route for computer science is for GCSE, so it should not be used for this A Level plan.
Theory that was first learned by typing needs to be written on paper. Use Computer Science topic practice to check understanding, then write a short explanation, comparison or trace by hand so the answer is not dependent on an editor, compiler or hint.
Flashcards and formats can help, but they need a written follow-up. Use Computer Science flashcards for definitions and terms, then move into Computer Science revision formats when a topic needs a different kind of recall.
To rehearse recursion on paper, trace tokens(3) before reading the return values below. Here n is a non-negative integer. This is informal pseudocode: semicolons separate lines, + adds integers, == tests equality, the if branch applies when n == 0 and the else branch applies otherwise. A return finishes that call and gives its value to its caller. The complete function is: function tokens(n):; if n == 0:; return 2; else:; return 3 + tokens(n - 1).
Calls descend through tokens(3), tokens(2), tokens(1), tokens(0). Each call keeps its own n. The first three calls wait for 3 + tokens(2), 3 + tokens(1) and 3 + tokens(0), respectively. The arguments are 3, 2, 1, 0: subtracting 1 from a positive integer reaches zero, so this function terminates for the stated inputs. At the base case, tokens(0) returns 2 without another call.
Values now return in the reverse order: tokens(1) returns 3 + 2 = 5; tokens(2) returns 3 + 5 = 8; tokens(3) returns 3 + 8 = 11. Final answer: 11. In tokens(3), 3 is the argument supplied to tokens, while 11 is the value returned to its caller. The argument names the input for that call; it is not the answer. The waiting calls add 3 only after the deeper call has returned.
Self-check in two columns, code | evidence: M1 | List the descending calls with arguments 3, 2, 1, 0 and their waiting additions; B1 | Explain that n reaches zero and the base case returns 2 without another call; A1 | Calculate the returning values 2, 5, 8, 11 and distinguish the initial argument 3 from the final result 11. Equivalent trace layouts are fine. If you stopped at zero, practise returning through the waiting calls; if you returned 3, label inputs and results separately on your next paper trace.
Start Computer Science revisionIn the numbers
- packs
- 19
- question pages
- 141
A Level Computer Science packs for theory, algorithms and written practice
How to choose
Split the calendar before choosing resources. Project sessions should have a clear development or documentation goal; revision sessions should have a written-paper goal. Treating project time as general revision is how theory quietly falls behind.
Keep Year 12 theory in rotation while Year 13 work and the project expand. A Level Computer Science is a two-year course, so older content needs small, repeated paper practice rather than a rushed return near the end.
Use Computer Science past-paper practice for command words and explanation marks. Describe, explain, compare and evaluate do not ask for the same answer, and Computer Science students often know the concept before they know the answer shape.
Use Computer Science past-paper packs when topic practice has become too predictable. Mixed questions force the student to decide whether a problem is about data representation, architecture, algorithms, networking, databases or legal and ethical issues.
Practise code-adjacent theory without a coding environment. Trace algorithms, dry-run pseudocode, compare data structures and explain design choices on paper. The written course needs reasoning that can be read by an examiner, not only behaviour that runs.
Use the A Level Computer Science revision websites guide when choosing outside resources. Use A Level Computer Science past papers by exam board when the next task is finding board materials.
If GCSE materials are still in use, label them clearly. The GCSE Computer Science revision plan belongs to a different level; A Level revision needs more sustained explanation, comparison and project management.