next up previous contents
Next: Java Case Study Up: Michaelmas Term 2002: Part Previous: Group Project   Contents


Introduction to Algorithms

Lecturer: Dr M. Richards (mr@cl.cam.ac.uk)

No. of lectures: 4

Aims

This course is a brief introduction to discrete mathematics. It covers core elements of the subject to make the Data Structures and Algorithms course accessible to people who have not seen any significant discrete mathematics before. In particular, it covers topics which are covered in Part IA which are useful for the Data Structures and Algorithms course.

Lectures

Objectives

At the end of the course students should

Recommended books

For many people the best advice is simply to read the books in the Data Structures and Algorithms course. The book
Lipschutz, S. (1976). Discrete Mathematics. McGraw-Hill
has a good ``solved problems'' approach which may be useful for students who have not seen discrete mathematics before.

Those who would like to know much more about discrete mathematics can try:

Stanat, D.F. & McAllister, D.F. (1977). Discrete Mathematics in Computer Science. Prentice-Hall.
Mattson, H.F. Jr (1993). Discrete Mathematics with Applications. Wiley.
Skvarcius, R. & Robinson, W.B. (1986). Discrete Mathematics with Computer Science Applications. Benjamin/Cummings.
Graham, R.L., Knuth, D.E. & Patashnik, O. (1989). Concrete Mathematics. Addison-Wesley.


next up previous contents
Next: Java Case Study Up: Michaelmas Term 2002: Part Previous: Group Project   Contents
Christine Northeast
Wed Sep 4 14:43:05 BST 2002