next up previous contents
Next: Digital Electronics Up: Michaelmas Term 2002: Part Previous: Continuous Mathematics   Contents


Data Structures and Algorithms

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

No. of lectures: 16

This course is a prerequisite for Computer Graphics and Image Processing, Complexity Theory.

Aims

The aim of this course is to provide a comprehensive introduction to computer algorithms taken from many different areas of application. The course will concentrate on algorithms that are of fundamental importance and the efficiency of most of them will be analysed.

Lectures

Objectives

At the end of the course students should

Recommended books

Sedgewick, R. (1990). Algorithms in C. Addison-Wesley.
Cormen, T.H., Leiserson, C.D. & Rivest, R.L. (1990). Introduction to Algorithms. MIT Press.
Manber, U. (1989). Introduction to Algorithms: A Creative Approach. Addison-Wesley.
Salomon, D. (1998). Data Compression: The Complete Reference. Springer.


next up previous contents
Next: Digital Electronics Up: Michaelmas Term 2002: Part Previous: Continuous Mathematics   Contents
Christine Northeast
Wed Sep 4 14:43:05 BST 2002