Design and Analysis of Algorithms - COMP9101
Faculty: Faculty of Engineering
School: School of Computer Science and Engineering
Course Outline: www.cse.unsw.edu.au/~cs9101
Campus: Sydney
Career: Postgraduate
Units of Credit: 6
EFTSL: 0.12500 (more info)
Indicative Contact Hours per Week: 3
Enrolment Requirements:
Prerequisite: COMP9021
Equivalent: COMP3120, COMP3121
CSS Contribution Charge: 2 (more info)
Tuition Fee: See Tuition Fee Schedule
Further Information: See Class Timetable
View course information for previous years.
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.
Study Levels
UNSW Quick Links
