What we teach.

Maths is what we get asked about most. Whether your child is stuck on fractions in Year 7, struggling with quadratics at GCSE, or aiming for A* in Further Maths, we have a specialist at that level.

• KS2 (Year 5–6) — Number sense, fractions, decimals, percentages, basic algebra, shape and measure.
• KS3 (Year 7–9) — Algebra, equations, geometry, ratios, proportionality, basic statistics, introduction to proof.
• GCSE Foundation (Year 10–11) — Full Foundation syllabus. Number, algebra, ratio, geometry, probability, statistics.
• GCSE Higher (Year 10–11) — Full Higher syllabus including surds, functions, circle theorems, vectors, calculus tasters.
• A-Level Maths — Pure — Algebra and functions, coordinate geometry, sequences, trigonometry, exponentials and logarithms, calculus (differentiation and integration), numerical methods.
• A-Level Maths — Mechanics — Kinematics, forces, Newton's laws, moments, projectiles.
• A-Level Maths — Statistics — Probability, statistical distributions, hypothesis testing, correlation and regression.
• Further Maths — Complex numbers, matrices, further calculus, hyperbolic functions, polar coordinates, decision maths, further mechanics.
• STEP I, II & III — Targeted coaching for Cambridge entry. Problem-solving technique, proof, rigour.
• MAT (Oxford/Imperial) — Integration, series, proof and algorithmic reasoning specific to the MAT format.

Computer Science is half logic, half coding, and most students are strong in one but not the other. Our tutors studied CS at university and write real code, so they teach how it actually works — not just the textbook version.

• GCSE — Computational thinking & algorithms — Decomposition, abstraction, flowcharts, pseudocode, searching and sorting algorithms, Big-O awareness.
• GCSE — Programming in Python — Data types, selection, iteration, lists, functions, file handling, OOP foundations.
• GCSE — Data representation — Binary, denary, hex, ASCII, Unicode, image and sound representation, compression.
• GCSE — Computer systems — CPU architecture (fetch-decode-execute), memory, storage, OS, networks, network security.
• A-Level — Algorithms & data structures — Stacks, queues, linked lists, trees, graphs, hash tables, graph traversal, dynamic programming.
• A-Level — OOP & software engineering — Inheritance, polymorphism, encapsulation, design patterns, testing, version control.
• A-Level — Theory of computation — Finite state machines, regular expressions, Turing machines, computability, Big-O complexity.
• A-Level — Databases & SQL — Relational databases, normalisation (1NF–3NF), SQL SELECT, JOIN, CREATE, transactions.
• A-Level — Networks & internet — TCP/IP stack, protocols (HTTP, FTP, SMTP), encryption, public-key cryptography, client–server vs peer-to-peer.
• NEA coursework mentoring — Scoping the project, design documentation, iterative development, testing evidence, evaluation write-up.