One-to-one online tuition for Years 12 and 13 on AQA 7517, from a qualified teacher with 20 years of experience. We prepare for the on-screen Paper 1 and its skeleton program, and build secure understanding of the Paper 2 theory, from data representation to functional programming.
| Component | Time | Marks | Weight | What it covers |
|---|---|---|---|---|
| Paper 1 On-screen exam | 2h 30m | 100 | 40% | Programming, data structures, algorithms and the theory of computation. Includes questions on the preliminary material and skeleton program, released before the exam in your school's chosen language. |
| Paper 2 Written exam | 2h 30m | 100 | 40% | Data representation, computer systems, computer organisation and architecture, consequences of computing, communication and networking, databases, big data, and functional programming. |
| Non-exam assessment Practical project | — | 75 | 20% | An investigation into a practical problem: analysis, design, technical solution, testing and evaluation. |
New to the course? Start with my free AQA A-Level self-assessment checklist. It breaks the specification down by sub-topic.
Reading and understanding unfamiliar code, predicting likely questions, and practising the kinds of modifications Paper 1 asks for.
Queues, stacks, graphs, trees, hash tables, dictionaries and vectors; graph and tree traversal, Dijkstra, searching and sorting, and Big O.
Finite state machines, sets, regular expressions, BNF and syntax diagrams, Reverse Polish notation, Turing machines, and the limits of computation.
Number bases, two's complement, fixed and floating point, error checking, compression and encryption.
Processor components, the fetch–execute cycle, addressing modes, assembly language and Boolean algebra.
Higher-order functions, map, filter and fold, lists in functional languages, and how they apply to big data.
Paper 1 rewards students who know the preliminary code inside out. We work through it systematically once it's released.
Sets, regular expressions, FSMs and Turing machines feel abstract until you've practised them. My sets and regex quiz and shunting-yard trace help here.
It's a different way of thinking from imperative code. We build intuition with small examples before tackling exam questions.
Longer written answers on networking, databases and the consequences of computing need precise terminology and clear structure. We practise these against the mark scheme.
No long-term contract. £50 per one-hour session, with a free consultation first.
Use the contact form or email me with your year group, exam board and what you'd like to focus on.
A short online call to talk through where you are, what's worrying you and how we'd work together — no commitment.
Hour-long lessons on Microsoft Teams or Zoom with screen sharing, a shared whiteboard and live coding, planned around your specification.
Damian is a great tutor. He helped my son through his GCSEs, boosting his confidence and helping him achieve a better grade than expected. He's a lovely guy, very professional, and patiently went at the pace my son needed to fully understand the subject. I would highly recommend Damian to others.
I've learnt a lot from Damian. His lessons are really clear, he's kind and has a great sense of humour. He's always ready to help me work through complex ideas to help me understand.
Damian is an exceptional tutor and teacher. I have worked with him for 7 years; he is professional, knowledgeable, empathetic, adaptive, and approachable. He will meet any tutee where they are and support them to achieve their best, building confidence throughout.
I've worked with Damian for years. He's a real professional: thorough, consistent, highly organised and genuinely concerned for the needs of his students. He knows his stuff and takes the time to communicate it clearly. Highly recommended.
Reviews originally left on my FindTutors profile.
Free simulations and quizzes I've built to make tricky topics click. See them all →
Tell me your year group, exam board and what you'd like help with. We'll start with a free, no-obligation consultation.