Algorithms and Complexity (COMP2007)


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.

Our courses that offer this unit of study

Further unit of study information


Lecture 2 hrs/week; Tutorial 2 hrs/week.


Through semester assessment (40%) and Final Exam (60%)


Jon Kleinberg and Eva Tardos/Algorithm Design//

Faculty/department permission required?


Unit of study rules


INFO1105 or INFO1905.

Assumed knowledge

MATH1004 or MATH1904

Study this unit outside a degree

Non-award/non-degree study

If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student.

Cross-institutional study

If you are from another Australian tertiary institution you may be permitted to underake cross-institutional study in one or more units of study at the University of Sydney.