Part C, Honour School of Mathematics and Computer Science
Maths and Computer Science Part C students are required to take six optional subjects from Schedules C1 and C2. Schedule C1 will contain Computer Science options and Schedule C2 will contain Mathematics options.
Alternatively, candidates may offer:
4 optional subjects and a Computer Science project,or offer 4 optional subjects and a Mathematics dissertation equivalent to one whole unit,
or offer 5 optional subjects and a Mathematics dissertation equivalent to one half-unit.
Each of these will be examined by a sit-down paper, which is likely to be of two hours' duration, or by a mini-project (please note that most of the Computer Science options will be examined by mini-project).
Computer Science mini-projects will be handed out to candidates on the last Friday of the term in which the subject is being taught and must be handed in to the Exam Schools by noon on Monday of week 1 of the following term. The mini-project will be designed to be completed in about three days. It will include some questions that are more open-ended than those on a standard sit-down exam. The work you submit should be entirely your own work, and include suitable references.
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.
Mathematics & Computer Science candidates may take any option from Mathematics Part C http://www.maths.ox.ac.uk/courses
However, Mathematics has already decided that the following timetable clashes may be allowed:
Any of
- C1.1 Model Theory & Godel's Incompleteness Theorems,
- C1.2 Analytic Topology and Axiomatic Set Theory,
- C2.1 Lie Algebras and Representation Theory of Symmetric Groups,
- C3.1 Lie Groups and Differentiable Manifolds,
- C9.1 Analytic Number Theory and Elliptic Curve
- C6.1 Solid Mechanics,
- C6.2 Elasticity and Plasticity,
- C6.3 Perturbation Methods and Applied Complex Variables,
- C8.1 Mathematics and the Environment and Mathematical Physiology,
- all Statistics options,
- all Numerical Analysis options (i.e. C12.1 Numerical Linear Algebra and Continuous Optimisation + C12.2 Approximation Theory and Finite Element Methods) .
may clash with any of
Any of
- C6.1 Solid Mechanics,
- C6.2 Elasticity and Plasticity,
- C6.3 Perturbation Methods and Applied Complex Variables,
- C3.1 Lie Groups and Differentiable Manifolds
- Categories, Proofs & Processes, and some other Computer Science options.
Note that a half-unit (usually a 16-lecture course) will count as one of your Maths options.
Please make sure that you discuss with your tutor any prerequisites for courses, particularly those from Mathematics.
Schedule C1
- Categories, Proofs and Processes 20 Lectures, Michaelmas Term 2011
- Computational Linguistics 16 Lectures, Michaelmas Term 2011
- Computer Animation 20 Lectures, Michaelmas Term 2011
- Probabilistic Model Checking 20 Lectures, Michaelmas Term 2011
- Probability and Computing 20 Lectures, Michaelmas Term 2011
- Automata, Logic and Games 16 Lectures, Hilary Term 2012
- Database Systems Implementation 20 Lectures, Hilary Term 2012
- Information Retrieval 20 Lectures, Hilary Term 2012
- Program Analysis 20 Lectures, Hilary Term 2012
- Quantum Computer Science 24 Lectures, Hilary Term 2012
- Requirements 16 Lectures, Hilary Term 2012
- Software Verification 18 Lectures, Hilary Term 2012
- Theory of Data and Knowledge Bases 16 Lectures, Hilary Term 2012