Cambridge CS assumes A-level Further Maths. Expect induction, combinatorics, and reasoning that's closer to a maths interview than a software-engineering one.
MockLabsEdu is not affiliated with the University of Cambridge.
Drawn from publicly reported interview content and the kind of reasoning that comes up year after year. The interviewer will follow up until your reasoning holds.
Prove that 2ⁿ > n² for all integers n ≥ 5.
How many ways are there to choose 3 people from 10 if one specific pair refuses to be in the group together?
Define a recursive function for the number of ways to climb n stairs taking 1 or 2 at a time.
Construct a truth table for (P ∧ Q) → R. When is this false?
Why is merge sort O(n log n)? Walk me through the analysis.
Show that the sum of degrees in any graph is twice the number of edges.
Pick a phase to practise in isolation, or run a full mock end-to-end.
Get started