Part C, Computer Science
In Part C you are required to take 5 optional subjects from Schedule C1.
Most of these subjects will be examined by a take-home mini-project, though some will be examined by a sit-down paper of three hours' duration. Mini-projects will be handed out to candidates on the last Friday of the term in which the subject is being taught and have to be submitted in week -1 of the following term.
In addition, candidates will complete a larger project worth 3/8 of the year’s assessment.
Please note that the courses in Part C are 50% larger than those in earlier years, i.e. for each course in the 3rd year undergraduates are expected to undertake about 10 hours of study per week, but 4th year courses will each require about 15 hours a week of study. Lecturers are providing this extra work in a variety of ways, e.g. some will give 20 lectures but will require you to undertake extra reading, classes and/or practicals, whereas others will be giving 24 lectures, and others still will be doing something in between. Please look at each synopsis for details on this.
Examination timings and methods for Computer Science papers vary by course. For 2026-27 examination modes and timing are as follows:
| Advanced Algorithmic Game Theory | Exam | Trinity Term |
| Advanced Security | Mini-project | Easter Vacation |
| Algorithmic Foundations of Collective Decision Making | Mini-project | Easter Vacation |
| Automata, Logic and Games | Exam | 0th Week Trinity Term |
| Categories, Proofs and Processes | Exam | 0th Week Hilary Term |
| Computational Biology | Mini-project | Christmas Vacation |
| Computer Vision | Exam | Trinity Term |
| Database Systems Implementation | Mini-project | Easter Vacation |
| Distributed Processes, Types and Programming | Mini-project | Christmas Vacation |
| Foundations of Self-Programming Agents | Mini-project | Easter Vacation |
| Geometric Deep Learning | Mini-project | Easter Vacation |
| Knowledge Representation and Reasoning | Exam | Trinity Term |
| Law and Computer Science | Mini-project | Easter Vacation |
| Privacy and Computation | Exam | 0th Week Trinity Term |
| Quantum Processes and Computation | Mini-project | Christmas Vacation |
| Uncertainty in Deep Learning | Mini-project | Christmas Vacation |
Schedule C1
- Axiomatic Set Theory(C1.4)
- Godel's Incompleteness Theorem (C1.2)
- Categories, Proofs and Processes 20 Lectures, Michaelmas Term 2026
- Combinatorial Optimisation 20 Lectures, Michaelmas Term 2026
- Computational Biology 20 Lectures, Michaelmas Term 2026
- Computational Learning Theory 24 Lectures, Michaelmas Term 2026
- Computer Vision 20 Lectures, Michaelmas Term 2026
- Distributed Processes, Types and Programming 20 Lectures, Michaelmas Term 2026
- Law and Computer Science 16/16, Michaelmas Term 2026, Hilary Term 2027
- Quantum Processes and Computation 24 Lectures, Michaelmas Term 2026
- Uncertainty in Deep Learning 20 Lectures, Michaelmas Term 2026
- Advanced Algorithmic Game Theory 20 Lectures, Hilary Term 2027
- Advanced Security 22 Lectures, Hilary Term 2027
- Algorithmic Foundations of Collective Decision Making 24 Lectures, Hilary Term 2027
- Automata, Logic and Games 24 Lectures, Hilary Term 2027
- Database Systems Implementation 24 Lectures, Hilary Term 2027
- Foundations of Self-Programming Agents 20 Lectures, Hilary Term 2027
- Geometric Deep Learning 20 Lectures, Hilary Term 2027
- Knowledge Representation & Reasoning 24 Lectures, Hilary Term 2027
- Privacy and Computation 20 Lectures, Hilary Term 2027