Skip to main content

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
Start a mock interview
5 sections229 words2 min read4 official sources
Oxford Computer Science has a narrow funnel: on the course page’s 2023 to 2025 averages, 21% of applicants were interviewed, 7% offered, with an average intake of 55. Every applicant sits both TMUA papers, and the department says it uses TMUA results alongside its criteria to decide whom to interview. The typical offer is A*AA with A*A in Maths and Further Maths (in either order). The department describes interviews as video calls in December, usually two at your first-choice College and at least one at another, each about 30 minutes with usually two interviewers, like a short tutorial spent mostly on a computer science problem you work through aloud. No prior computer science is required. University-wide dates are on the Oxford interviews overview.
Students discussing code on a big screen
Students discussing code on a big screen · Illustration · AI-generated
Part 1

The published interview and offer ratios

21%

of applicants interviewed

7%

of applicants offered a place

55

average intake per year

Part 2

What a CS interview problem feels like: one original example

A robot avoiding a broken square
A robot goes from (0, 0) to (3, 3), moving one square right or up each step. Square (1, 1) is broken and cannot be used. How many routes are there? If the target were (n, n) with many broken squares, how would you get a computer to count?
Only right or up moves; the red square cannot be used.
Frontier ACE mock practice4 steps + answer
  1. 1
    Count everything
    Choose which 3 of 6 steps go right: C(6, 3) = 20.
Revise

What to revise for Oxford CS

Our recommended revision list, built from the admissions-test syllabus and the kinds of problems interviews use.

01

Discrete mathematics

Oxford CS interviews are largely maths interviews; counting and induction come up most.

  • Induction
  • Recurrences
  • Counting and grid paths
  • Pigeonhole principle
02

Logic and proof

You will be asked to prove an algorithm correct, not just say it works.

  • Propositional logic, necessary and sufficient
  • Invariants
  • Contradiction
03

Number systems and binary

Binary, remainders and states are the way into many problems.

  • Binary and base conversion
  • Modular arithmetic
  • Thinking in finite states
04

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
05

Games and puzzles

Stone-taking and light-switch puzzles test winning strategies and symmetry.

  • Winning and losing positions
  • Symmetry and pairing strategies
Practise

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.

01Question 1New for this course
A machine reads a long binary number one digit at a time, left to right, and can remember very little. How can it tell, at the end, whether the number is divisible by 3? How few states does it need?
Frontier ACE mock practice4 steps
  1. What it tests
    Whether you can compress “the whole number so far” into “its remainder so far”: the core idea of a finite-state machine.
  2. 1
    Step 1
    Reading a digit b doubles the number so far and adds b.
You have a sorted list of one million integers. To decide whether a value is present, how many comparisons does binary search need at most? What changes if the list is stored as a linked list?
Frontier ACE mock practice3 steps
  1. What it tests
    This 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.
  2. 1
    Step 1
    Since 2²⁰ = 1,048,576, which is just over a million, at most about 20 comparisons are needed.
Two people each hold a sorted list of 1,000 numbers. You may only ask “what is the k-th number in your list?”. Using as few questions as possible, find the median of the combined 2,000 numbers.
Frontier ACE mock practice3 steps
  1. What it tests
    This 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.
  2. 1
    Step 1
    The combined length is 2,000, so the median is the average of the 1,000th and 1,001st values.
A census records the exact age in years of 50 million people, from 0 to 120. How would you store the data if memory is tight? How would you answer “how many people are aged 30 to 40?” quickly?
Frontier ACE mock practice3 steps
  1. What it tests
    This 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.
  2. 1
    Step 1
    If you only need the distribution, use 121 counters of 32 bits each: under 500 bytes in total. Increment one counter per person.
Checklist

The two weeks before your interview

0 of 8 done

Progress is saved in this browser only.

Practise

More questions by subject

By university and course

More interview guides

Oxford

Oxford interviewsOverviewOxford interviews online in December; invitations go out from mid-November to early December, and decisions arrive on 12 January 2027. Below are 6 exclusive interview questions with step-by-step answers.Oxford PPE interviewAbout 38% of Oxford PPE applicants are interviewed and 12% receive an offer; the interview tests reasoning, not memorised knowledge.Oxford E&M interview18% of Oxford E&M applicants are interviewed and 5% receive an offer; the interview does not test economics or management you have studied.Oxford Maths interviewOxford Mathematics now uses both TMUA papers; interviews are online in December, about 25 minutes each.Oxford Engineering interview37% of Oxford Engineering applicants are interviewed and 15% receive an offer; the interview and the ESAT score together decide who is made an offer.Oxford Physics interview31% of Oxford Physics applicants are interviewed and 11% receive an offer; the interview watches you turn an unfamiliar situation into mathematics and read the physics back out.Oxford Chemistry interviewOxford Chemistry has no admissions test; 63% of applicants are interviewed and 17% receive an offer, so selection happens mostly at interview.Oxford Biology interview46% of Oxford Biology applicants are interviewed and 15% receive an offer; the interview is less about facts than how you read a graph or a dataset in front of you.Oxford English interview67% of Oxford English applicants are interviewed and 22% receive an offer; there is no test, so your written work and how you read an unseen text carry the weight.Oxford History interview74% of Oxford History applicants are interviewed and 23% receive an offer; there is no test, and the interview may cover your essay and a short passage.Oxford Materials interview62% of Oxford Materials applicants are interviewed and 22% receive an offer; there is no admissions test for 2027 entry, and every shortlisted candidate is interviewed by two colleges.

Cambridge

drag the windows

Frontier ACE · mock interview demo

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 question
Scores

KEY NUMBERS

80/ 100

Tech×3582
Struct×2074
Relev×2088
Engage×1570
Deliver×1079
Full report

Sister 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.

Sources

Official sources

4 official sources (click to view)
FAQ

Frequently asked questions

Can I apply without programming experience?
Yes. The course page says no formal computer science qualification is required, though real interest is expected. Interview problems are mostly mathematical.
What TMUA score do I need for an interview?
There is no pass mark. The department uses the TMUA together with your UCAS application and school context to decide, and publishes no cut-off.
Are Oxford interviews online or in person?
The course page says shortlisted candidates have at least one online interview, expected in December, taken wherever you can perform at your best. Your College confirms the date and platform in the invitation.
When do invitations arrive?
Usually mid-November to early December, sometimes with about a week’s notice; decisions arrive through UCAS on 12 January 2027. See the Oxford interviews overview.

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.