Undergraduate Courses

The BA in Computer Science

Part A - Core Courses

• CS4 Object Oriented Programming I and Object Oriented Programming II
• CS5 Concurrency and Networks and Operating Systems

• Formal Program Design I
• Formal Program Design II
• Programming Languages
• Compilers
• Computer Architecture
• Computer Graphics
• Numerical Analysis
• Advanced Data Structures and Algorithms
• Object Oriented Design

1. The two core courses
2. Four optional subjects from Part A each of which will be examined by a 1 1/2 hour paper in Trinity Term.

Problem classes will be organised centrally for computer science courses, although colleges may also organise tutorials.

Practicals will be assessed as a nominal paper, as for Mods. They play no part in the classification but each year a candidate must pass the practical component of the course in order to pass the exam, ie candidates must achieve 30% or more overall in their practicals each year to pass.

Third Year - Under the new degree structure, Computer Science students in their third year take a total of six optional courses from schedules B1 and B2 and B4, including at least four courses from B2 (B4 will remain empty in 2007-08). You may not take a course that you also took in your second year. You will also need to undertake a project.

It is intended to offer the following courses under Part B in 2007/08.

B1	B2
Formal Program Design I and II	Intelligent Systems I and II
Compilers	Numerical Solution of Differential Equations I and II
Programming Languages	Computer Security
Computer Architecture	Bioinformatics and Computational Biology
Computer Graphics	Databases
Advanced Data Structures & Algorithms	Integer Programming
Numerical Analysis	Computational Complexity
Object Oriented Design	Lambda Calculus and Types
	Machine Learning
B4
No options offered

Fourth Year

Students will take 4 optional subjects from Schedule C1. These subjects will be examined either by sit-down paper, which is likely to be of two hours' duration, or by a mini-project. In addition, candidates will complete a larger project.

Topics for Schedule C1 may include a selection of the following:
Automata, Logic and Games
Categories, Proofs and Processes
Computational Linguistics
Computer Aided Formal Verification
Computer Animation
Continuous Optimization
Domain Theory
Game Semantics
Information Retrieval
Numerical Linear Algebra
Program Analysis
Theory of Data and Knowledge Bases

Additional courses may be added to the schedules if resources permit.

Undergraduate Course Handbook for 2007-2008
Up-to-date guidance on practicals can be found here

Please email Christine O'Connor by Friday of week 9 of TT (22nd June 2007) to advise us which options you propose to take. Obviously at this stage your choice is not binding but this information will be extremely helpful to us.