Skip to Content

Algorithm Theory and Design - COMP333

This unit covers general issues of the theory of computation and algorithm design, including computability and complexity. The general principles are illustrated by designing several very efficient algorithms with applications in telecommunication networks, cryptography and other important fields.

Credit Points: 3
When Offered:

S2 Day - Session 2, North Ryde, Day

Staff Contact(s): Dr Scott McCallum, Associate Professor Mark Dras
Prerequisites:

(39cp at 100 level or above) including (COMP225 and DMTH237Prerequisite Information

Corequisites:

NCCW(s):
Unit Designation(s):

Engineering

Information Technology

Science

Unit Type:
Assessed As: Graded
Offered By:

Department of Computing

Faculty of Science and Engineering

Course structures, including unit offerings, are subject to change.
Need help? Ask us.