CP3050 - Algorithms and Complexity

Credit points:	03
Year:	2008
Student Contribution Band:	Band 2
Administered by:	Discipline of Information Technology (pre 2009)

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.

Prerequisites:

CP2001

Availabilities
Townsville, Internal, Study Period 2
Census Date 05-Sep-2008
Coord/Lect:	Dr Hossein Ghodosi.
Contact hours:	39 hours lectures 13 hours tutorials
Assessment:	end of semester exam (40% - 70%); 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 posted on the web (10% - 60%); tba (% - 50%).
Cairns, Internal, Study Period 2
Census Date 05-Sep-2008
Coord/Lect:	Dr Hossein Ghodosi.
Contact hours:	39 hours lectures 13 hours tutorials
Assessment:	end of semester exam (40% - 70%); 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 posted on the web (10% - 60%); tba (% - 50%).

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.