Skip to content | Change text size


Advanced topics in algorithms and complexity ( 6 points, SCA Band 2, 0.125 EFTSL)



Clayton First semester 2005 (Day)
Clayton Full year 2005 (Day)
Clayton S2-S1-02 2005 (Day)
Clayton S2-S1 2005 (Day)
Clayton Second semester 2005 (Day)

Synopsis: Algorithms are the most fundamental area of computer science and software engineering. Discrete structures from graph theory, set theory, combinatorics and symbolic logic form the mathematical underpinning of the study of algorithms. Within the framework of this unit, the student can choose between a variety of specialisation modules, including: computability and complexity;automata theory;advanced analysis and design of algorithms; parallel and distributed algorithms;numerical algorithms;cryptographic algorithms;and spatial/geometric algorithms. Some of these topics may not be offered in every year. For further details, refer to the courseware web pages.

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.