Macquarie University 2006 Handbook: COMP333

	Home \| Events \| Handbook \| Library \| Search \| Contact

2006 Handbooks

Search the Handbooks for:

Search tips

About the Handbooks

Guide to the Handbooks (Undergraduate)
Guide to the Handbooks (Postgraduate)
Glossary of terms
All Student Enquiries

Handbook of Undergraduate Studies 2006

Schedule of Dates
Selecting your program
Areas of study
Programs of study
Degrees
Units
Faculties, Departments and their Courses
Unit Designations
UAC preferences
Student information
Plagiarism
Bachelor degree rules
Other award rules
Fees rules
Scholarships and prizes
Services and resources
Contact information

Handbook of Postgraduate Studies 2006

Degrees and diplomas
Areas of Study
Programs of study
Units
Research
Student information
Postgraduate rules
Fees rules
Prizes

Calendar of Governance, Legislation and Rules 2006

Schedule of dates
Introduction to Macquarie
Academic structure
Faculties and departments
Macquarie University Act
By laws
Regulations and rules
Postgraduate rules
Undergraduate rules
Social legislation

Other years:

You are here: Macquarie » 2006 Handbooks » Units » COMP333

COMP333: Algorithm Theory and Design

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

Credit Points:	3
Contact Hours:	--
When Offered:	D2 - Day; Offered in the second half-year
Staff Contact:	Computing Staff
Prerequisites:	COMP225(P); COMP226(P); MATH237(P)
Corequisites:
NCCWs:
Unit Designations:	Science
Assessed As:	Graded
Offered By:	Department of Computing

Unit Web Pages

Blackboard CE6
Department

Timetable

Click here