完全入試ガイド

Computer Science at University of Oxford

Oxfordへの当塾生徒の合格率

65%

Oxfordの平均合格率

17%

OxfordのComputer Scienceは最も競争的な入試の一つ。Oxford卒の専門講師による完全対策で合格を目指しましょう。

最終更新: 2026年5月

主要情報

  • A*AA, includi…典型オファー
  • 12:1志願者 / 定員
  • #1UK順位
  • TMUA入試テスト
  • 55定員(年)
  • G400UCAS コード

概要

コース概要

Oxford Computer Science (UCAS G400) is a mathematically intensive course leading to a 3-year BA or 4-year MCompSci. For 2027 entry, the typical A-level offer is A*AA including Maths and Further Maths where available, and applicants must sit the TMUA.

なぜOxfordでComputer Scienceを?

Oxford ranks #1 for Computer Science in the 2026 Guardian and Complete University Guide subject tables, while the Times/Sunday Times field lists Oxford at #2 and remains partial because the primary Times table is paywalled. The peer table compares Oxford with Cambridge, Imperial College London, St Andrews and Birmingham across Guardian, Complete University Guide and Times/Sunday Times subject-table fields.

A university lecture hall from the back, students taking notes

Section 01

国際学生の出願

下のマップで自国をクリックすると、出願に必要な情報(受け入れられる資格、要求スコア、英語要件、現地の文脈)が表示されます。

International Applicants

Country-specific admissions requirements

CanadaUnited States of AmericaSouth KoreaIndiaChinaUnited KingdomMalaysiaJapan

Pick a highlighted country to see the admissions-test, score, and English-language requirements that apply for applicants from that country.

Section 02

出願要件

  • A-LevelA*AA, including A*A in Maths and Further Maths if available (in any order). Mathematics is required; Further Mathematics is highly recommended and expected where available.
    Mathematics required. Further Mathematics recommended.
  • IB Diploma39 points including core points, with 766 at Higher Level. The 7 must be in HL Mathematics.
    HL: Mathematics required.
  • Advanced Placement (AP)Either four APs at grade 5, including any subjects required for the course, or three APs at grade 5 plus ACT 32 or above / SAT 1470 or above.
    AP Calculus BC if available; AP Calculus AB is accepted if Calculus BC is not available required. SAT/ACT: Required only with the three-AP route: ACT 32 or above, or SAT 1470 or above..AP Pre-Calculus cannot be used to fulfil the Mathematics requirement. Calculus AB and Calculus BC cannot be counted as two separate subjects.
Admissions test
Pre-registered TMUA (Test of Mathematics for University Admission). Registration closes 28 September 2026; the test sits 12–16 October 2026 at Pearson VUE centres. TMUA replaced the MAT for Oxford Maths and Computer Science course families from 2027 entry.
Interview
Two college interviews of around 25 minutes each. Problem-solving interviews covering mathematical reasoning and computational thinking. Most interviews are in person at the college; many colleges still offer online interviews for international applicants.
Required Tests:TMUA

Section 03

出願プロセスと重要日程

  1. MAY — SEP

    Build the UCAS application

    Start preparing the UCAS form from May 2026, choose a course and college/open application route, write the personal statement and organise the academic reference. Applications can be submitted from early September.

  2. 1 JUN

    Create the UAT-UK account

    Account creation, access-arrangements requests and bursary requests open at 3pm UK time. For 2027 entry, current official sources list TMUA for Oxford Computer Science rather than the MAT named in the registry.

  3. 20 JUL — 28 SEP

    Book the admissions test

    Book the Oxford-required October UAT-UK sitting by 6pm UK time on 28 September 2026. The access-arrangements deadline is 14 September and the bursary deadline is 21 September.

  4. 12 — 16 OCT

    Sit the admissions test

    Oxford applicants for Computer Science must sit the October TMUA window for 2027 entry. The current course page requires both Paper 1 and Paper 2.

  5. 15 OCT

    Submit UCAS

    Submit the UCAS application by the strict Oxford deadline of 6pm UK time on 15 October 2026.

  6. LATE NOV — EARLY DEC

    Receive shortlisting outcome

    Oxford indicates that applicants normally find out whether they have been shortlisted at the end of November or beginning of December.

  7. EARLY — MID DEC

    Attend online interviews

    Shortlisted applicants are invited to online interviews in December. Computer Science interviews are problem-based academic discussions focused on how candidates reason through unfamiliar problems.

  8. 12 JAN

    Receive Oxford decision

    Applicants for 2027 entry receive the outcome of their Oxford application via UCAS on 12 January 2027, with colleges following up later that day.

  9. AUG

    Meet offer conditions

    Conditional offer holders have their place confirmed through UCAS if they meet all offer conditions. If results miss the offer, the college reviews the case and communicates the outcome.

Section 04

入試テスト

Student working through problems at a desk with timed papers

For 2027 entry, Oxford Computer Science uses the Test of Mathematics for University Admission, or TMUA. The test provider is UAT-UK, delivered through Pearson VUE test centres.

Oxford applicants must take both TMUA papers: Paper 1, Applications of Mathematical Knowledge, and Paper 2, Mathematical Reasoning. The Oxford test window for 2027 entry is 12–16 October 2026, with test booking closing at 6pm UK time on 28 September 2026.

The test matters because it gives tutors a common way to compare mathematical and problem-solving potential before interview.

For international applicants, the TMUA is especially important because it sits alongside many different qualification systems.

TMUA完全対策ガイド | 試験形式・採点・戦略・練習リソース。

TMUAガイド

Section 05

面接:当日の流れと対策

Invitation → Decision: the interview timeline

Interview Invitation

Late Nov

Arrival to Interview

Early Dec

Technical Question

Mid Dec

Decision

Early Jan

Question Types You’ll See

Logic or discrete-mathematics problemsAlgorithm-design or efficiency reasoning tasksSmall pseudocode or program-tracing exercisesProof, pattern or generalisation tasksOpen-ended problem-solving discussions with follow-up prompts

The interview should feel closer to a problem-solving tutorial than a scripted question-and-answer session. Tutors are looking at mathematical reasoning, proof-style thinking, computational decomposition, response to hints and clarity of explanation.

Typical question types include logic or discrete-mathematics problems, algorithm-design tasks, small pseudocode or program-tracing exercises, proof or pattern questions, and open-ended follow-up prompts. Practising aloud helps: define the problem, state assumptions, test small cases, then explain why your method works or fails.

A good answer does not need to be instant. In our experience, strong candidates show their reasoning clearly enough that tutors can see how they use hints, recover from errors and adapt to new constraints.

無料のComputer Science面接練習問題バンクで本番さながらの問題を練習しましょう。

無料練習問題
Two people in academic discussion across a table

Section 06

合否決定のしくみ

Oxford Computer Science selection is evidence-led and uses more than one source of information.

For shortlisted applicants, interviews are central because tutors can directly assess how candidates approach unfamiliar problems, absorb hints and explain reasoning. Academic records and predicted grades provide evidence of mathematical preparation and consistency, while the reference and personal statement add context on motivation and independent work.

Read the visual as a practical guide to emphasis, not as a formula.

Our recommendation · weighting of admission factors

0102030400%
TMUA score
0%
Interview
0%
Predicted grades
0%
Personal statement
0%
Contextual factors
% of decisionFactor

Oxbridge Mentors recommendation, drawn from observed offer patterns. University of Oxford does not publish official weightings — exact balance varies by college, course and year.

Section 07

Personal Statement のコツ

Handwritten notes and a laptop open to a draft document

A strong Computer Science personal statement should show how you think. Use one or two problems, projects or readings, then explain the decisions you made and what changed in your understanding.

A list of programming languages is weaker than evidence of reasoning about correctness, edge cases, data structures, complexity, proof or debugging, because those are closer to the way Oxford tests the subject.

It helps to connect every activity to a specific intellectual question. For example: why did one algorithm scale better, why did a representation fail, or why did a proof require a stronger invariant?

専門家による一行一行の解説付き完全例文を見る。

Computer Science PS例文

Section 08

プロジェクト

  1. 01正当性
  2. 02プロジェクト概要
  3. 03実施内容
  4. 04困難
  5. 05解決策
  6. 06振り返り

Projects are useful when they produce evidence of reasoning, not just a finished output. Choose one manageable project and document the mathematical or computational decisions behind it.

  • Build and analyse an algorithm visualiser: Choose a family of algorithms such as graph search, sorting or dynamic programming; implement them; compare time complexity experimentally; then write a short reflection linking the results to mathematical reasoning.
  • Explore computational problem-solving through one hard problem: Take a problem from BIO, Project Euler, Advent of Code or similar; solve it cleanly; then improve the solution by analysing edge cases, data structures and asymptotic behaviour.
  • Investigate a computing concept mathematically: Pick a topic such as automata, cryptography, compression, recursion or neural networks; learn the underlying mathematics; then produce a small implementation or explanatory notebook.
Open books, a notebook, and a coffee on a wooden desk

Section 08

その他のサプリキュラム

Other supercurriculars should support the same core story: mathematical reasoning, computational thinking and independent follow-through.

These activities are support, not a substitute for strong mathematical preparation.

  • Mathematical problem-solving:

    Use MAT/TMUA-style, Olympiad-style and proof-based problems to practise unfamiliar reasoning under time pressure.

  • Programming practice:

    Work in one language deeply enough to write clear, tested solutions; focus on correctness, complexity and explanation rather than accumulating many languages.

  • Reading and reflection:

    Read accessible algorithms, logic, AI or systems material and keep notes on what changed your understanding.

  • Competitions and challenges:

    Use competitions as structured practice; afterwards, review editorials and rewrite solutions more elegantly.

  • Open-ended projects:

    Build projects that let you explain design choices, trade-offs and limitations in an interview or personal statement.

  • Talks, lectures and MOOCs:

    Choose university-level lectures that stretch mathematical thinking, then connect them to your own experiments or reading.

Section 08

コンペティション

Competitions are not required, but they can stretch problem-solving under constraint. Use one or two well, then reflect on mistakes and solution quality.

  1. British Informatics Olympiad — Algorithmic thinking, programming, problem decomposition and efficient solution design. Prepare by: Practise past BIO problems, write clean programs, and compare your approach with official solutions after attempting the problem independently.
  2. Perse Coding Team Challenge — Team-based coding, logical problem-solving and fast implementation. Prepare by: Practise as a team, assign roles clearly, and review mistakes after each contest rather than only chasing speed.
  3. Oxford Computing Challenge — Computational thinking, logic and problem-solving beyond the first-round Bebras-style challenge. Prepare by: Use Bebras-style practice, then move toward harder algorithmic puzzles and written explanations.
  4. Kaggle — Applied data science, model-building, evaluation metrics and reproducible experimentation. Prepare by: Start with beginner competitions, read public notebooks critically, and explain why a method works rather than only chasing leaderboard gains.
  5. Code Jam archives— Competitive programming, algorithms, edge-case handling and contest-style abstraction. Prepare by: Work through archived problems by difficulty, time yourself, then rewrite solutions with clearer invariants and complexity analysis.

None are required; one or two done well beats five half-attempted.

Section 09

コース内容

  1. Year

    01 / 04

    1

    Year 1

    Core mathematical and programming foundations

    The first year is fully core and builds the mathematical, programming and systems foundations needed for later Computer Science options. Students cover algorithms, proof, discrete and continuous mathematics, linear algebra, probability, programming paradigms and digital systems before sitting first-year university examinations.

    A broad mathematical and programming base before options begin.

  2. Year

    02 / 04

    2

    Year 2

    Core systems, computation and first options

    Second year retains a substantial core while introducing optional Computer Science papers. Students study algorithms and data structures, compilers, concurrent programming and models of computation, while also completing a group design practical and beginning to tailor the course through options.

    Group design practical, which Oxford notes may be sponsored by industry.

  3. Year

    03 / 04

    3

    Year 3

    Advanced options and optional individual project

    Third year is mainly option-based and allows students to specialise across advanced theoretical, practical and applied areas of Computer Science. Students may take an optional individual project, or replace the project route with additional examined papers.

    Decision point for BA exit or continuation to the fourth-year MCompSci, subject to meeting progression requirements.

  4. Year

    04 / 04

    4

    Year 4

    MCompSci advanced specialisation and major project

    The fourth year is for students continuing to the Master of Computer Science. It combines advanced option papers with a large individual project, giving students space to pursue a more specialised research or advanced technical direction.

    Large individual project in the integrated master's year.

Section 10

Computer Scienceの知識を深める

Start with Introduction to Algorithms for rigorous algorithmic analysis, use The Algorithm Design Manual as a practical bridge into algorithm design, and use The Elements of Computing Systems if you want to connect logic gates, architecture and software. Pick one chapter, problem set or implementation idea, then write down what you understood and what remains unclear.

For video, Computerphile is useful for algorithms, security and theory; CS50 builds programming foundations; MIT OpenCourseWare supports algorithmic intuition; 3Blue1Brown is strongest for mathematical visualisation; and freeCodeCamp.org helps with data structures and algorithms. Use these channels to generate questions, not to create a passive watch history.

For listening, Darknet Diaries can prompt systems and security questions, CoRecursive connects software design with long-term learning, The Changelog introduces commercial and research settings, and Software Engineering Daily gives computer-science research context. After an episode, identify one concept worth verifying through reading or code.

For structured study, CS50x: Introduction to Computer Science builds programming confidence, 6.006 Introduction to Algorithms links programming to formal algorithm analysis, Algorithms Specialization gives a structured path through algorithm design and analysis for applicants wanting more depth, and Nand2Tetris supports systems-focused applicants. Structured courses are most useful when you complete exercises and can explain the method afterwards.

A study planner, highlighters and a stack of revision cards

Section 11

カレッジ選択と再振り分け

30 colleges offer this subject. 19.8% of applicants submit an open application. 30.1% of places come through the pool.

Oxford uses reallocation to balance competition across colleges, and applicants may apply to a named college or make an open application. Applicants are not guaranteed to be interviewed or offered by that college.

It also records that 30.1% of 2024-25 Computer Science and joint-course offers were open offers or made by a college other than the first college considering the applicant.

College choice can affect community, accommodation, location and tutor mix, but it should not be treated as a shortcut to an easier offer. Choose a college you would genuinely like, or make an open application if you have no strong preference.

Stone college quadrangle viewed through an archway

Section 12

卒業後のキャリア

Oxford Computer Science graduates enter technical, managerial, academic, financial and commercial roles in the UK and abroad. Department-listed recent employers include technical employers such as IBM, Google, Amazon, Facebook and Cisco, and financial or commercial examples such as Morgan Stanley and Goldman Sachs.

Discover Uni reports that 95% of surveyed students went on to work and/or study 15 months after the course.

Section 13

特別な事情について

Oxford considers applications holistically, including school context, educational background and declared extenuating circumstances. For Computer Science, the key subject context is Mathematics, with Further Mathematics highly recommended and expected where available.

Where Further Mathematics is not available at school, applicants should explain that context rather than assume they are automatically disadvantaged. Contextual information can explain opportunity and disruption, but it does not remove the need to show strong mathematical reasoning and readiness for a demanding theoretical course.

Watch & Learn

Oxford Computer Science 参考動画

学生ブログ・模擬面接・講義体験・入試アドバイス。

Lecture 1: Algorithmic Thinking, Peak Finding

MIT 6.006 opening lecture introducing algorithmic thinking through a concrete problem.

What on Earth is Recursion?

Computerphile explanation of recursion, a core idea in mathematical and computational problem-solving.

CS50x 2024 - Lecture 0 - Scratch

Introductory CS50 lecture on computational thinking and programming concepts.

But what is a neural network?

Visual introduction to neural networks and the mathematical structure behind them.

Recursion's Super Power

Computerphile video showing why recursive thinking is powerful in programming.

All videos are the property of their respective creators.

Further Reading

Recommended Resources

専門講師が推薦するSupercurricular読書リスト・ウェブサイト・ツール。

よくあるご質問

No. Oxford says a formal qualification in Computer Science is not required, but applicants are expected to show genuine interest in the subject. Mathematics is the required subject.
The registry for this slice lists Further Mathematics as recommended. Oxford's current Computer Science page says Further Mathematics is highly recommended and that, if your school offers it, Oxford expects you to have taken it. If your school does not offer it, explain the context and strengthen your mathematical preparation in other ways.
For 2027 entry, Oxford Computer Science requires the TMUA (Test of Mathematics for University Admission), delivered by UAT-UK. The MAT is no longer used for this course.
No. Oxford's Computer Science course page states that written work is not required, and no portfolio requirement is listed.
College choice matters for living environment, accommodation, community and tutor contact, but it should not be treated as a tactical shortcut. Oxford reallocates applicants and states that colleges do not specialise in particular undergraduate subjects.
Shortlisted applicants should generally expect two interviews at their first-choice or open-allocated college and at least one at another college. Interviews are around 30 minutes each and focus on academic problem-solving.
Meet the same academic standard as UK applicants, check the exact Oxford equivalence for your qualification, register for the correct admissions test, prepare evidence for English-language requirements if needed, and apply by the same October UCAS deadline.
A strong statement shows mathematical curiosity, computational thinking and reflection. It should discuss specific problems, reading, projects or competitions and explain what the applicant learned, rather than simply listing programming languages or activities.

Computer Science(Oxford)出願の専門サポート

専門講師との無料30分相談をご予約ください。

無料相談を予約する