CP5150 - Algorithms and Complexity
Credit points: | 03 |
Year: | 2009 |
Student Contribution Band: | Band 2 |
Administered by: | Discipline of Information Technology (pre 2009) |
Available to Computer Science postgraduate and honours students only.
Measures of complexity; design of efficient algorithms; graph algorithms; matrix algorithms; arithmetic; NP-complete problems.
Learning Outcomes
- apply basic design strategies such as divide and conquer, dynamic programming and greedy methods in creating algorithms to solve problems;
- define complexity measures;
- determine algorithmic complexity;
- establish the correctness of algorithms;
- identify complexity measures with actual computing resources;
- recognise a basic set of NP-complete problems.
Assumed Knowledge: | Students enrolling in this subject should have successfully complete CP2001 or have acquired equivalent knowledge through other study or professional experience. |
Inadmissible Subject Combinations: | CP3050 |
Availabilities | |
Townsville, Internal, Study Period 2 | |
Census Date 28-Aug-2009 | |
Coord/Lect: | Dr Hossein Ghodosi. |
Contact hours: |
|
Cairns, Internal, Study Period 2 | |
Census Date 28-Aug-2009 | |
Coordinator: | Dr Hossein Ghodosi |
Lecturer: | Dr Joanne Lee. |
Contact hours: |
|
Note: Minor variations might occur due to the continuous Subject quality improvement process, and in case of minor variation(s) in assessment details, the Subject Outline represents the latest official information.