Part B, Mathematics and Computer Science
In Part B you are required to take 8 courses, including:
- at least two from Mathematics (Schedule B3)
- at least two from Computer Science (Schedules B1 and B2), but including no more than two from Schedule B1 (and no subject from B1 that you have already offered in Part A.
- no more than 2 subjects from Schedule B4 and B5
The following topics under Schedule B3 are recommended in 2012/13:
B1 Foundations: Logic and Set Theory
B5 Differential Equations and Applications
B9 Number Theory
B11a Communication Theory
B12a Applied Probability
Candidates must take at least two of these recommended half units. In addition candidates may apply to take other topics from the list of Mathematics Department courses and History of Mathematics. A form for this purpose is here; the form should be submitted to the Committee by Monday of week -1 of Michaelmas Term in the academic year in which the examination is taking place.Students should note that it would not be possible to guarantee that such additions could be scheduled to avoid a timetable clash.
Note that a half-unit (usually 16-lecture course) will count as one of your Maths options.
Additional courses may be added to the schedules if resources permit.
Please make sure that you discuss with your tutor any prerequisites for courses, particularly those from Mathematics
Please note that although practicals play no part in the degree classification, a candidate must pass the practical component of the course in order to pass the exam, i.e. candidates must achieve 30% or more overall in their practicals to pass. Up-to-date guidance on practicals can be found here
- Computer Graphics 16 Lectures, Michaelmas Term 2012
- Databases 16 Lectures, Michaelmas Term 2012
- Advanced Data Structures and Algorithms 16 Lectures, Hilary Term 2013
- Compilers 16 Lectures, Hilary Term 2013
- Concurrent Programming 16 Lectures, Hilary Term 2013
- Computer Architecture 16 Lectures, Trinity Term 2013
- Computer Networks 16 Lectures, Trinity Term 2013
- Computer Security 16 Lectures, Michaelmas Term 2012
- Computer-Aided Formal Verification 16 Lectures, Michaelmas Term 2012
- Intelligent Systems 16 Lectures, Michaelmas Term 2012
- Lambda Calculus and Types 16 Lectures, Michaelmas Term 2012
- Machine Learning 16 Lectures, Michaelmas Term 2012
- Principles of Programming Languages 16 Lectures, Michaelmas Term 2012
- Computational Complexity 16 Lectures, Hilary Term 2013
- Geometric Modelling 16 Lectures, Hilary Term 2013
- Knowledge Representation & Reasoning 16 Lectures, Hilary Term 2013