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 … For more content click the Read More button below.
Requisites
Pre-requisite
Other Requirements
Pre-enrolment Requirement
Learning Outcomes
Upon completion of this subject, graduates will be able to:
1.
Apply a variety of techniques in the analysis of algorithms
2.
Interpret the design and analysis of the families of fundamental algorithms
3.
Evaluate computational complexity theory and its relationship to algorithm analysis
Assessments
1. Written - Test/Quiz
2. Written - Literature review
3. MM - Multi-method
4. Written - Examination (centrally administered)
Offerings
Trimester 1
CAM-BNE-TR1
Trimester 2
CAM-BNE-TR2
CAM-CNS-TR2
CAM-SIN-TR2
Trimester 3
CAM-BNE-TR3
CAM-SIN-TR3
Learning Activities
To view learning activity information, please select an offering from the drop-down menu above.