Computer Science Syllabus - Algorithms II
|Computer Laboratory > Computer Science Syllabus - Algorithms II|
Next: Computer Design Up: Michaelmas Term 2006: Part Previous: Michaelmas Term 2006: Part   Contents
Lecturer: Dr F.M. Stajano
No. of lectures: 6
Prerequisite courses: Algorithms (CST students) or Data Structures and Algorithms (Diploma)
This course is a prerequisite for Computer Graphics and Image Processing, Complexity Theory, Artificial Intelligence I.
The aim of this course is to give further insights into the design and analysis of non-trivial algorithms through the discussion of several complex algorithms in the fields of graphs and computer graphics, which are increasingly critical for a wide range of applications.
At the end of the course students should
* Cormen, T.H., Leiserson, C.D., Rivest, R.L. & Stein, C. (2001). Introduction to Algorithms. MIT Press (2nd ed.). ISBN 0-262-53196-8
Students are expected to buy and make extensive use of one of the above references: those not doing so will be severely disadvantaged. The easiest and recommended choice is Cormen et al. which covers all the topics in the syllabus: the pointers in the syllabus are to chapters in that book. The other textbooks are all excellent alternatives and are sometimes clearer or more detailed than Cormen, but they are not guaranteed to cover every item in the syllabus. Their relative merits are discussed in the course handout.
Next: Computer Design Up: Michaelmas Term 2006: Part Previous: Michaelmas Term 2006: Part   Contents Christine Northeast
Tue Sep 12 09:56:33 BST 2006