Please note: You are viewing the unstyled version of this web site. Either your browser does not support CSS (cascading style sheets) or it has been disabled.

Department of Computing

Local Navigation

Computing Department

Curriculum Page >> COMP333

Curriculum - COMP333 - Algorithm Theory and Design

Handbook Entry Unit Home Page

Short Description

COMP333 covers general issues that arise in the theory of computation and algorithm design, including computability and complexity.

Assumed knowledge

  1. Basic understanding of algorithm design and complexity for algorithms based on data structures such as trees, graphs and heaps. (COMP225)

Learning outcomes

  1. An understanding of the principles of algorithm design.
  2. An understanding of the principles used to evaluate the complexity of algorithms.
  3. An understanding of NP completeness.

Comments to: Steve Cassidy

[Back to top]

Copyright & Site information

  • CRICOS Provider No 00002J, ABN 90 952 801 237
  • Last Updated: Wed, 15 Apr 2009 10:14:34
  • Authorised by: HOD