- 1Count everythingChoose which 3 of 6 steps go right: C(6, 3) = 20.
Oxford Computer Science
Oxford Computer Science: a 30-minute tutorial
Frontier ACE
The Oxford CS interview bank
- Oxford CS interview questions
- 40+
- Oxford CS interview questions
- of real interview questions covered
- 90%+
- of real interview questions covered
- mock interviews with follow-ups
- 1v1
- mock interviews with follow-ups
- scoring dimensions after each answer
- 5
- scoring dimensions after each answer

The published interview and offer ratios
21%
of applicants interviewed
7%
of applicants offered a place
55
average intake per year
What a CS interview problem feels like: one original example
What to revise for Oxford CS
Our recommended revision list, built from the admissions-test syllabus and the kinds of problems interviews use.
Discrete mathematics
Oxford CS interviews are largely maths interviews; counting and induction come up most.
- Induction
- Recurrences
- Counting and grid paths
- Pigeonhole principle
Logic and proof
You will be asked to prove an algorithm correct, not just say it works.
- Propositional logic, necessary and sufficient
- Invariants
- Contradiction
Number systems and binary
Binary, remainders and states are the way into many problems.
- Binary and base conversion
- Modular arithmetic
- Thinking in finite states
Algorithmic thinking
No programming language needed: describe a procedure and estimate how long it takes.
- Binary search and sorting ideas
- Recursion and dynamic programming
- Rough time complexity
Games and puzzles
Stone-taking and light-switch puzzles test winning strategies and symmetry.
- Winning and losing positions
- Symmetry and pairing strategies
4 practice questions for this course
Exclusive questions in the style of this interview. Talk each one through out loud first, then open the hints one at a time.
- What it testsWhether you can compress “the whole number so far” into “its remainder so far”: the core idea of a finite-state machine.
- 1Step 1Reading a digit b doubles the number so far and adds b.
- What it testsThis tests logarithmic complexity and the hidden precondition of binary search. Many candidates can recite O(log n) but cannot say that the method depends on random access.
- 1Step 1Since 2²⁰ = 1,048,576, which is just over a million, at most about 20 comparisons are needed.
- What it testsThis tests binary search over a partition and invariants. The point is not to merge the lists, but to see that the median is determined by a split point.
- 1Step 1The combined length is 2,000, so the median is the average of the 1,000th and 1,001st values.
- What it testsThis tests data representation and the insight that aggregate questions do not require storing every individual. The first instinct is often 50 million records, which ignores that only counts are needed.
- 1Step 1If you only need the distribution, use 121 counters of 32 bits each: under 500 bytes in total. Increment one counter per person.
The two weeks before your interview
0 of 8 done
Progress is saved in this browser only.
More questions by subject
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
6 original problems
6 original problems
10 original problems
8 original problems
More interview guides
Oxford
Cambridge
Imperial
drag the windows
Practise this question on Frontier ACE
A timed preview: read the question, think for a few seconds, then answer aloud. Frontier ACE scores the attempt on five dimensions.
Open the sample questionSister site
Practise saying the thinking out loud
Frontier ACE is Frontier Academy’s AI interview practice site for Oxford, Cambridge and Imperial applicants. It runs timed video-style practice and mock interviews, then scores each attempt on five dimensions. Use it to rehearse the conversation, then come back to the subject problems here.
Frontier ACE is a Frontier Academy site. Links open in a new tab and are tagged as referrals.
Official sources
4 official sources (click to view)
- University of Oxford: Computer Science course page (requirements, test, interview, admissions statistics)
- University of Oxford: a guide to undergraduate interviews
- University of Oxford: admissions timeline (decisions on 12 January 2027)
- Oxford Department of Computer Science: how to apply (interviews and TMUA)
Frequently asked questions
Can I apply without programming experience?
What TMUA score do I need for an interview?
Are Oxford interviews online or in person?
When do invitations arrive?
UAT-UK, Pearson, OCR, the University of Cambridge, Imperial College London and other names and logos belong to their respective owners.
Prepare for Oxford Computer Science interview in four weeks
Work through the original subject questions, then rehearse the conversation with FrontierACE. Both are built by Frontier Academy.