Design and Analysis of Algorithms - COMP9101

   
   
   
 
Campus: Kensington Campus
 
 
Career: Postgraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.12500 (more info)
 
 
Indicative Contact Hours per Week: 3
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP9024.
 
 
Equivalent: COMP3120, COMP3121
 
 
Excluded: COMP9801
 
 
CSS Contribution Charge:Band 2 (more info)
 
   
 
Further Information: See Class Timetable
 
 

Description


Techniques for design and performance analysis of algorithms for a variety of computational problems. Asymptotic notations, bounding summations, recurrences, best-case, worst-case and average-case analysis. Design techniques: divide-and-conquer, dynamic programming and memorisation, greedy strategy, backtracking, branch-and-bound. Algorithms: sorting and order statistics, trees, graphs and flow networks, matrices, arithmetic circuits. Intractability: classes P, NP, and NP-completeness, approximation algorithms.