# Part C, Computer Science and Philosophy

In Part C, Computer Science and Philosophy students take courses according to the following rules.

- Each Philosophy course or thesis is worth 8 units;

- Each Computer Science course is worth 3 units;

- A Computer Science project is worth 9 units.

You must complete between 24 and 26 units, subject to the following constraints:

- You may take at most six Computer Science courses;

- You may not take both a Philosophy thesis and a Computer Science project.

The effect of these rules is that you should take one of the following combinations:

- Three Philosophy papers (maybe including a thesis) (24 units);
- Two Philosophy papers (maybe including a thesis) and either three CS papers or a CS project (25 units);
- One Philosophy paper (or thesis), and six CS papers (26 units);
- One Philosophy paper, three CS papers and a CS project (26 units);
- Five CS papers and a CS project (24 units).

Computer Science courses are chosen 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.

Philosophy courses are chosen from courses 101-120, 122, 124, 125, 127-129, 137-139, 198 and 199, as described on the Philosophy Faculty website. Each Philosophy course will be assessed by a 3-hour written examination together with an essay of at most 5,000 words. Rules for Philosophy theses are described in the Examination Regulations here, except that the word limit is 20,000 words.

Please note that the Computer Science courses in Part C are 50% bigger 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 16 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 (CS&P)

- Axiomatic Set Theory (C1.4)
- Godel's Incompleteness Theorem (C1.2)
- Advanced Complexity Theory 20 Lectures, Michaelmas Term 2022
- Bayesian Statistical Probabilistic Programming 16 Lectures, Michaelmas Term 2022
- Combinatorial Optimisation 16 Lectures, Michaelmas Term 2022
- Computational Biology 20 Lectures, Michaelmas Term 2022
- Computational Learning Theory 24 Lectures, Michaelmas Term 2022
- Concurrent Algorithms and Data Structures 20 Lectures, Michaelmas Term 2022
- Graph Representation Learning 18 Lectures, Michaelmas Term 2022
- Law and Computer Science 16 Lectures, Michaelmas Term 2022, Hilary Term 2023
- Probabilistic Model Checking 20 Lectures, Michaelmas Term 2022
- Probability and Computing 20 Lectures, Michaelmas Term 2022
- Quantum Processes and Computation 24 Lectures, Michaelmas Term 2022
- Advanced Security 22 Lectures, Hilary Term 2023
- Computational Game Theory 20 Lectures, Hilary Term 2023
- Database Systems Implementation 22 Lectures, Hilary Term 2023
- Deep Learning in Healthcare 14 | 2, Hilary Term 2023, Trinity Term 2023
- Ethical Computing in Practice 16 Lectures, Hilary Term 2023
- Foundations of Self-Programming Agents 20 Lectures, Hilary Term 2023
- Geometric Deep Learning 18 Lectures, Hilary Term 2023
- Quantum Software 24 Lectures, Hilary Term 2023
- SC8 Topics In Computational Biology 16 Lectures, Hilary Term 2023
- Requirements 16 Lectures, Trinity Term 2023

## Notices

- Notice to Candidates - 2022/2023 (Notice to Candidates - Requirements TT2023) (pdf)
- Notice to Candidates - 2022/2023 (Notice to Candidates - 2022/2023) (pdf)
- Notice to Candidates - 2022/2023 (Notice to Candidates, Hilary Term 2023) (pdf)
- Notice to Candidates - 2022/2023 (Notice to Candidates-MT22) (pdf)