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.
Unit details and rules
Academic unit | Computer Science |
---|---|
Credit points | 6 |
Prerequisites
?
|
Distinction level results in (COMP2123 OR COMP2823 OR INFO1105 OR INFO1905) |
Corequisites
?
|
None |
Prohibitions
?
|
COMP2007 OR COMP2907 OR COMP3027 |
Assumed knowledge
?
|
MATH1004 OR MATH1904 OR MATH1064 |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Seeun William William Umboh, william.umboh@sydney.edu.au |
---|