CP5150:03
Algorithms and Complexity
Townsville
Prerequisites: CP2001
Inadmissable Subject Combination: CP3050
39 lectures, 13 tutorials. Second semester.
Measures of complexity; design of efficient algorithms; graph algorithms; matrix algorithms; arithmetic; NP-complete problems.
Learning Objectives:
- define complexity measures;
- identify complexity measures with actual computing resources;
- establish the correctness of algorithms;
- determine algorithmic complexity;
- apply basic design strategies such as divide and conquer, dynamic programming and greedy methods in creating algorithms to solve problems;
- recognise a basic set of NP-complete problems.
Assessment in this subject involves significant on-course assessment including assignments and tests and an examination at the end of the semester. The full details of the assessment are handed out to students in the class in the first week of the semester in which the subject is offered and also posted on the Web. 15% of the overall assessment is at a higher level than the assessment in CP3050.