Michaelmas Term, MSc in Computer Science
It is recommended that students should undertake no more than four topics in any one term.
Schedule A - each equivalent to 4 units
Schedule B - each equivalent to 4 units
Schedule C - each equivalent to 6 units
Schedule A
- Foundations of Computer Science 16 Lectures, Michaelmas Term 2012
- Functional Programming 16 Lectures, Michaelmas Term 2012
- Object Oriented Programming 16 Lectures, Michaelmas Term 2012
Schedule B
- Bioinformatics and Computational Biology 16 Lectures, Michaelmas Term 2012
- Computer Security 16 Lectures, Michaelmas Term 2012
- Computer-Aided Formal Verification 16 Lectures, Michaelmas Term 2012
- Databases 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
Schedule C
- Categories, Proofs and Processes 20 Lectures, Michaelmas Term 2012
- Computer Animation 20 Lectures, Michaelmas Term 2012
- Information Retrieval 20 Lectures, Michaelmas Term 2012
- Probabilistic Model Checking 20 Lectures, Michaelmas Term 2012
- Probability and Computing 20 Lectures, Michaelmas Term 2012
- Quantum Computer Science 24 Lectures, Michaelmas Term 2012