goto UNSW home page  
Contacts Library myUNSW WebCT
Design and Analysis of Algorithms - COMP9101
PRINT THIS PAGE
Science students
 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Contact: 
Elgindy,Hossam
Ignjatovic,Aleksandar
 
 
Campus: Kensington Campus
 
 
Career: Postgraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.125 (more info)
 
 
Contact Hours per Week: 3
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP9024, or enrolment in MIT program 8684 or GradCert program 7344; Excluded: COMP9801, COMP3121, 3120.
 
 
Session Offered: See Class Timetable
 
 
Fee Band: 2 (more info)
 
 

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.

Further Information

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.