Computer Laboratory > Teaching > Course material 2009–10 > Mathematical Methods for Computer Science

 

Mathematical Methods for Computer Science
2009–10

Principal lecturers: Peter Robinson & Neil Dodgson
Taken by: Part IB

Course material

This course introduces two areas of mathematics that are relevant for many applications in Computer Science. There will be six lectures on probability theory in the Michaelmas Term and a further six lectures on Fourier methods in the Lent Term. The two halves have previously been given in the opposite order, so don't be surprised if occsional references to Part I and Part I appear the wrong way round.

Probability theory (Michaelmas Term)

Lectures will be on Tuesdays and Thursdays from 10:00 to 11:00 in Lecture Theatre 1 at the William Gates Building, starting on Thursday 12 November.

Fourier methods (Lent Term)

Lectures will be on Tuesdays and Thursdays from 11:00 to 12:00 in Lecture Theatre 1 at the William Gates Building. The first lecture is on 14 January. There are no lectures in the following week: students are expected to read the handwritten notes (see below and handout in the first lecture) during that week. The remaining five lectures will start on Tuesday 26 January.

Copies of all the above will be provided to all students in the first lecture. The handout also contains a ten page extract from E. Oran Brigham's book "The fast Fourier transform and its applications", copied under the University's CLA license. This extract cannot be put on this website owing to copyright.

Some Fourier Transform applets