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. This course assumes basic knowledge of
discrete math. In particular, students should be familiar with
graphs, Big O notation, and induction. - Quizzes (best 10 out of
12) — 20% - Assignments (best 10 out of 12) — 20% - Final Exam —
60% "Algorithm Design" by Tardos and Kleinberg, Addison Lecture.
- Main lecture: Mondays 10:00am - noon in Merewether Lecture
Theatre 2 (Rm 136) - Advanced lecture: Mondays 4:00pm - 5:00pm
in New Law School Seminar 030 Please go to the E-Learning site
to the full UoS outline, access assignments, quizzes, and your
marks for this unit.
|Date||Topic||Reference||Slides||Scribbles||Python code||Python
output||Tutorial| |July 30||Algorithm analysis
review||2-1,2,4,5|| introduction | |problem set 1| |(Adv
lecture)||Stable m