2009 Course Handbook
COMP333: Algorithm Theory and Design
This unit covers general issues of the theory of computation and algorithm design, including computability and complexity. The general principles will be illustrated by designing several very efficient algorithms with applications in telecommunication networks, cryptography and other important fields.
| Credit Points: | 3 |
| Contact Hours: | -- |
| When Offered: | D2 - Day; Offered in the second half-year |
| Staff Contact: | Computing Staff |
| Prerequisites: | 40cp and COMP225(P) and MATH237(P) |
| Corequisites: | |
| NCCWs: | |
| Unit Designations: | Science |
| Assessed As: | Graded |
| Offered By: |
Department of Computing |
Timetable Information
For unit timetable information please visit the Timetables@Macquarie Website.