Introduction
This unit provides an introduction to the design and analysis of algorithms. The main aims are (i) to learn how to develop algorithmic solutions to computational problem and (ii) to develop understanding of algorithm efficiency and the notion of computational hardness.
Assumed Knowledge
This course assumes basic knowledge of discrete math. In particular, students should be familiar with graphs, Big O notation, and induction.
Assessment
- Quizzes — 25%.
- Assignments — 25%
- Exam — 50%
Textbook
"Algorithm Design" by Tardos and Kleinberg, Addison Wesley.
Other Resources
Please go to the E-Learning site to access assignments, marks and the discussion board for this unit.
Schedule
| Date | Topic | Reference | Slides/Notes |
|---|---|---|---|
| Mar 05 | Stable matching | 1.1 | |
| Basics of algorithm analysis | 2 |