Computer Laboratory > Teaching > Course material 2009–10 > Computer Science Tripos Syllabus and Booklist 2009-2010 > Paper 2: Discrete Mathematics II

next up previous contents
Next: Paper 2: Professional Practice Up: Lent Term 2010: Part Previous: Paper 1: Floating-Point Computation   Contents


Paper 2: Discrete Mathematics II

This course is not taken by NST or PPST students.

Lecturer: Professor G. Winskel

No. of lectures: 12

Prerequisite course: Discrete Mathematics I

This course is a prerequisite for all theory courses as well as Security (Part IB and Part II), Artificial Intelligence (Part IB and Part II), Information Theory and Coding (Part II).

Aims

This course will develop the theory of sets and their uses in Computer Science.


Lectures


Objectives


On completing this part of the course, students should be able to

Recommended reading


Comprehensive notes will be provided.


Devlin, K. (2003). Sets, functions, and logic: an introduction to abstract mathematics. Chapman and Hall/CRC Mathematics (3rd ed.).
Biggs, N.L. (1989). Discrete mathematics. Oxford University Press.
Mattson, H.F. Jr (1993). Discrete mathematics. Wiley.
Nissanke, N. (1999). Introductory logic and sets for computer scientists. Addison-Wesley.
Pólya, G. (1980). How to solve it. Penguin.



next up previous contents
Next: Paper 2: Professional Practice Up: Lent Term 2010: Part Previous: Paper 1: Floating-Point Computation   Contents