James Cook University Subject Handbook - 2023

CP5602 - Advanced Algorithm Analysis

Subject Description

This subject is designed to meet the needs of students for designing algorithms to solve a wide range of problems, and analysing the correctness and complexity of algorithms. Design strategies (such as, divide-and-conquer, dynamic programming, and greedy algorithms), and a wide range of analysing techniques (including the master methods, substitution method, and recursion trees, for computing the running time of divide and conquer algorithms) will be studied.

Learning Outcomes

• apply a variety of techniques in the analysis of algorithms
• interpret the design and analysis of the families of fundamental algorithms
• evaluate computational complexity theory and its relationship to algorithm analysis

Subject Assessment

• Written > Examination (centrally administered) - (50%) - Individual
• Written > Test/Quiz 1 - (10%) - Individual
• Written > Literature review - (20%) - Individual
• Assignment - (20%) - Individual

Note that 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.

Assumed Knowledge:  Proficiency in at least one programming language.

Availabilities