A-level CS: Data Structures & Algorithms
What's in it
This bundle covers arrays, linked lists, stacks, queues, trees and sorting algorithms — the data structures and algorithms content your A-level Computer Science exam actually tests, with full worked traces.
Topics covered
Topic list to be confirmed when bundle is complete. Join the waitlist to be first to know when it's ready.
How to use it
- As a reference
- When you hit a topic you've forgotten, open the relevant section and work through the examples before looking at past papers.
- As a study guide
- Work top to bottom once, writing your own examples alongside each worked one in James's bundle.
- With an AI tutor
- Paste the Markdown file into your AI assistant, then ask it to quiz you on the topics or generate extra practice problems. The structure makes those conversations more targeted than feeding in a generic prompt.
- Print the PDF
- Annotate it, highlight the parts you're still shaky on, use it as a rapid-review sheet the night before the exam.
What you get
| Format | Details |
|---|---|
| Printable · Works offline | |
| Markdown | Plain text · Paste into any AI assistant · Human-readable |
This bundle is in the works.
Join the list and you'll get an email the day it's available — no marketing, just the download link.
You might also want
Proof, algebra, calculus, trigonometry and vectors — the Pure A-level Maths content that separates confident students from those who stall at year 12.
Mechanics, electric and gravitational fields — built for students whose algebra is solid but whose physical intuition hasn't caught up yet.
Data types, control flow, functions and arrays — the building blocks of every programming task on your GCSE paper — with annotated pseudocode examples.