next up previous contents
Next: Foundations of Computer Science Up: Michaelmas Term 2001: Part Previous: Digital Electronics (50% option   Contents


Discrete Mathematics

Lecturers: Dr P. Robinson and Professor G. Winskel
(gw104@cl.cam.ac.uk and pr@cl.cam.ac.uk)

No. of lectures: 16 (Continued into Lent Term)

This course is a prerequisite for Introduction to Security (Part IB), Information Theory and Coding (Part II) and Security (Part II).


Aims


This course will develop the idea of formal proof by way of examples involving simple objects such as integers and sets. The material enables academic study of Computer Science and will be promoted with examples from the analysis of algorithms and cryptography.


Lectures


Part A. Integers

Part B. Sets, functions and relations.

Objectives


On completing the course, students should be able to

Recommended books


Biggs, N.L. (1989). Discrete Mathematics. Oxford University Press.
Conway, J.H. & Guy, R.K. (1996). The Book of Numbers. Springer-Verlag.
Davenport, H. (1992). The Higher Arithmetic. Cambridge University Press (6th ed.).
Giblin, P. (1993). Primes and Programming. Cambridge University Press.
Graham, R.L., Knuth, D.E. & Patashnik, O. (1994). Concrete Mathematics. Addison-Wesley (2nd ed.).
Humphreys, J.F. & Prest, M.Y. (1989). Numbers, Groups and Codes. Cambridge 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.
Rosen, K.H. (1999). Discrete Mathematics and its Applications. McGraw-Hill (4th ed.).



next up previous contents
Next: Foundations of Computer Science Up: Michaelmas Term 2001: Part Previous: Digital Electronics (50% option   Contents
Christine Northeast
Tue Sep 4 09:34:31 BST 2001