# Part C, Mathematics and Computer Science

Maths and Computer Science Part C students are required to take either six optional units from schedules C1 and C2 and a Mathematics Dissertation or five optional subjects and a Computer Science Project. Schedule C1 will contain Computer Science options and Schedule C2 will contain Mathematics options.

Each of the optional subjects will be examined by a sit-down paper or by a mini-project (please note that most of the Computer Science options will be examined by mini-project). 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.

Please note that the Computer Science 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. Computer Science 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.

#### Schedule C1

- SC8 Topics In Computational Biology 16 Lectures,
- Bayesian Statistical Probabilistic Programming 20 Lectures, Michaelmas Term 2024
- Combinatorial Optimisation 20 Lectures, Michaelmas Term 2024
- Computational Biology 20 Lectures, Michaelmas Term 2024
- Computational Game Theory 20 Lectures, Michaelmas Term 2024
- Computational Learning Theory 24 Lectures, Michaelmas Term 2024
- Concurrent Algorithms and Data Structures 20 Lectures, Michaelmas Term 2024
- Distributed Processes, Types and Programming 20 Lectures, Michaelmas Term 2024
- Graph Representation Learning 20 Lectures, Michaelmas Term 2024
- Law and Computer Science 16/16, Michaelmas Term 2024, Hilary Term 2025
- Probabilistic Model Checking 20 Lectures, Michaelmas Term 2024
- Quantum Processes and Computation 24 Lectures, Michaelmas Term 2024
- Advanced Security 22 Lectures, Hilary Term 2025
- Automata, Logic and Games 24 Lectures, Hilary Term 2025
- Categories, Proofs and Processes 20 Lectures, Hilary Term 2025
- Computational Medicine 20 Lectures, Hilary Term 2025
- Computer Vision 20 Lectures, Hilary Term 2025
- Foundations of Self-Programming Agents 20 Lectures, Hilary Term 2025
- Geometric Deep Learning 18 Lectures, Hilary Term 2025
- Knowledge Representation & Reasoning 24 Lectures, Hilary Term 2025
- Uncertainty in Deep Learning 20 Lectures, Hilary Term 2025

Any Maths Schedule C option may be taken, see here, but the following are recommended:

- C1.1 Model Theory
- C1.2 Godel's Incompleteness Theorems
- C1.3 Analytic Topology
- C1.4 Axiomatic Set Theory
- C2.1 Lie Algebras
- C2.2 Homological Algebra
- C2.3 Representation Theory of Semisimple Lie Algebras
- C2.4 Infinite Groups
- C2.5 Non Commutative Rings
- C2.6 Introduction to Schemes
- C2.7 Category Theory
- C3.1 Algebraic Topology
- C3.2 Geometric Group Theory
- C3.3 Differentiable Manifolds
- C3.4 Algebraic Geometry
- C3.5 Lie Groups
- C3.6 Modular Forms
- C3.7 Elliptic Curves
- C3.8 Analytic Number Theory
- C3.9 Computational Algebraic Topology
- C3.10 Additive and Combinatorial Number Theory
- C4.1 Functional Analysis
- C4.2 Linear Operators
- C6.1 Numerical Linear Algebra
- C8.1 Stochastic Differential Equations
- C8.3 Combinatorics
- C8.4 Probabilistic Combinatorics