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

next up previous contents
Next: Paper 2: Digital Electronics Up: Michaelmas Term 2009: Part Previous: Paper 1: Foundations of   Contents


Paper 1: Discrete Mathematics I

Lecturer: Dr P.M. Sewell

No. of lectures: 8

This course is a prerequisite for all theory courses as well as Discrete Mathematics II, Algorithms I, 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 intuition for discrete mathematics reasoning involving numbers and sets.

Lectures

Objectives

On completing the course, students should be able to

Recommended reading

* Velleman, D.J. (1994). How to prove it (a structured approach). Cambridge University Press.
* Rosen, K.H. (1999). Discrete mathematics and its applications. McGraw-Hill (6th ed.).
Biggs, N.L. (1989). Discrete mathematics. Oxford University Press.
Bornat, R. (2005). Proof and disproof in formal logic. Oxford University Press.
Devlin, K. (2003). Sets, functions, and logic: an introduction to abstract mathematics. Chapman and Hall/CRC Mathematics (3rd ed.).
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: Digital Electronics Up: Michaelmas Term 2009: Part Previous: Paper 1: Foundations of   Contents