Unit of study_
Algorithm Design - COMP3027
Year - 2018
This unit provides an introduction to the design techniques that are used to find efficient algorithmic solutions for given problems. The techniques covered included 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.
Classes
lectures, tutorials
Assessment
through semester assessment (40%), final exam (60%)
Assumed knowledge
MATH1004 OR MATH1904 OR MATH1064
COMP2123 OR COMP2823 OR INFO1105 OR INFO1905
ProhibitionsCOMP2007 OR COMP2907 OR COMP3927
Details
Faculty: Engineering and Information Technologies
Semester 1
05 Mar 2018
Department/School: Information Technologies
Study Mode: Normal (lecture/lab/tutorial) day
Census Date: 31 Mar 2018
Unit of study level: Senior
Credit points: 6.0
EFTSL: 0.125
Available for study abroad and exchange: Yes
Faculty/department permission required? No
Location
Camperdown
More details
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.
