CSE4603

Advanced topics in algorithms and complexity (6 points)

(IT)

Leader:

Offered:
Clayton First semester 2004 (Day)
Clayton Full year 2004 (Day)
Clayton S2-S1 2004 (Day)
Clayton Second semester 2004 (Day)
Clayton First semester 2005 (Day)
Clayton Full year 2005 (Day)
Clayton S2-S1 2005 (Day)
Clayton Second semester 2005 (Day)

Synopsis:

Assessment: Assignment and Examination, relative weight depending on topic composition. When no exam is given students will be expected to demonstrate their knowledge by solving practical problems and maybe required to give an oral report. This variability is designed to give flexibility to the lecturer to decided the most appropriate form of examination for a given choice of topics.

Off-campus attendance requirements: Lectures: 39 hours; Laboratory: up to 40 hours

Prerequisites: Completion of the Bachelor of Computer Science or Bachelor of Digital Systems or Bachelor of Computing at an advanced level equivalent to the entry requirements for the Honours program. Students must also have enrolment approval from the Honours Coordinator. Individual modules in the framework of this unit may have additional prerequisites. For detailed information please contact the Honours coordinator.

Corequisites: Individual modules in the framework of this unit may have additional corequisites.

Prohibitions: Individual modules in the framework of this unit may have additional prohibitions.