COMP4600: Advanced Algorithms

(6 units) Group D
Second Semester

Approximately three hours per week, with breaks (see the lecture schedule).

Prerequisites

COMP3600 or permission of Director of Research School of Computer Science.

Syllabus

This course deals with the advanced study of algorithms for solving practical problems and the data structures used in the implementations of algorithms. Detailed analysis of the resource requirements of algorithms and computational complexity will be dealt with.

A large variety of algorithms are candidates for study. These include, but are not limited to, the following: branch-and-bound techniques, verification algorithms, maximum flow algorithms, NP-Completeness theory, and approximation algorithms. The mathematical tools used to study the resource usage of algorithms like time and space will be considered too.

Proposed Assessment

Assignments (50%); Final Exam (50%)

[COMP4600] [Description] [Assessment] [Schedule] [Lectures] [Assignments] [Lecturers] [All Messages] [Discussion Forums] [References] [Exam] [Help] [ANU IT Policies and Rules]

Skip Navigation \| ANU Home \| Search ANU \| Search FEIT \| Feedback
	College of Engineering and Computer Science (CECS) Research School of Computer Science