Skip to main content
Unit of study_

Algorithm Design - COMP3027

Year - 2020

This unit provides an introduction to the design techniques that are used to find efficient algorithmic solutions for given problems. The techniques covered include greedy, divide-and-conquer, dynamic programming, and adjusting flows in networks. Students will extend their skills in algorithm analysis. The unit also provides an introduction to the concepts of computational complexity and reductions between problems.

lectures, tutorials

Refer to the assessment table in the unit outline.

Assumed knowledge
MATH1004 OR MATH1904 OR MATH1064


COMP2123 OR COMP2823 OR INFO1105 OR INFO1905


COMP2007 OR COMP2907 OR COMP3927


Faculty: Engineering

Semester 1

24 Feb 2020

Department/School: Computer Science
Study Mode: Normal (lecture/lab/tutorial) day
Census Date: 31 Mar 2020
Unit of study level: Senior
Credit points: 6.0
EFTSL: 0.125
Available for study abroad and exchange: Yes
Faculty/department permission required? No
More details
Unit of Study coordinator: Seeun Umboh
HECS Band: 2
Courses that offer this unit

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 undertake cross-institutional study in one or more units of study at the University of Sydney.

To help you understand common terms that we use at the University, we offer an online glossary.