Introduction to Algorithms
Principal lecturer: Dr Alan Mycroft (email@example.com)
Taken by: Part II (General), Diploma
Number of lectures: 4
Lecture location: Hopkinson Lecture Room
Lecture times: 11:00 on MWF
This course (which is not directly examined) is intended to
(re-)introduce various mathematical notations and ideas needed for
the immediately following
Data Structures and Algorithms course.
Part IB students will have acquired this material during their study
in Part IA; this course summarises (in an introductory manner)
key points, including the common mathematical notation and notions
used in Cambridge Computer Science. It assumes minimal mathematical
background (indeed, this course should be too trivial for you
if you have already studied two or more years of a Mathematics degree).
The general areas covered in the four lectures are
- Sets, functions.
- Relations, graphs; induction.
- Combinations and permutations.
- O(f) notation, sorting as example algorithm.
Here are the course lecture notes: in DVI,
or HTML form.
II(G) | Dip
Provisional information only
Generated at 09:55.15 on 4/9/1998