Useful links
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.
Code | COMP3027 |
---|---|
Academic unit | Computer Science |
Credit points | 6 |
Prerequisites:
?
|
COMP2123 OR COMP2823 OR INFO1105 OR INFO1905 |
---|---|
Corequisites:
?
|
None |
Prohibitions:
?
|
COMP2007 OR COMP2907 OR COMP3927 |
Assumed knowledge:
?
|
MATH1004 OR MATH1904 OR MATH1064 |
At the completion of this unit, you should be able to:
Unit outlines will be available 1 week before the first day of teaching for the relevant session.
Key dates through the academic year, including teaching periods, census, payment deadlines and exams.
Enrolment, course planning, fees, graduation, support services, student IT
Code of Conduct for Students, Conditions of Enrollment, University Privacy Statement, Academic Integrity
Academic appeals process, special consideration, rules and guidelines, advice and support
Policy register, policy search
Scholarships, interest free loans, bursaries, money management
Learning Centre, faculty and school programs, Library, online resources
Student Centre, counselling & psychological services, University Health Service, general health and wellbeing