• Offered by Research School of Computer Science
  • ANU College ANU College of Engineering and Computer Science
  • Course subject Computer Science
  • Areas of interest Computer Science, Information Technology

This course is concerned with the study of algorithms for solving practical problems efficiently, and the theoretical analysis of their behaviour. There will also be a brief introduction to complexity theory, the formal study of algorithm performance.
A large variety of algorithms are candidates for study. These include, but are not limited to, the following: greedy algorithms, dynamic programming, network flow algorithms, algorithms for string matching, parallel algorithms, graph algorithms and approximation algorithms.

Learning Outcomes

Upon successful completion, students will have the knowledge and skills to:

Upon completion of this course, the student will:
  •  Analyse a variety of algorithms with practical applications and the resource requirements of each.
  •  Determine the most suitable algorithm for any given task and then apply it to the problem.
  •  Demonstrate adequate comprehension of the theory of intractability and prove when certain kinds of problems are intractable.

Indicative Assessment

Assignments (50%); Final Exam (50%)

The ANU uses Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website.

Workload

Twenty-six one-hour lectures, together with occasional seminars

Requisite and Incompatibility

To enrol in this course you must have completed COMP3600 and 18 units of 3000 level COMP courses. Incompatible with COMP8460.

Prescribed Texts

Cormen, Thomas H., Leiserson, Charles E. & Rivest, Ronald L. Introduction to Algorithms, The MIT Electrical Engineering and Computer Science Series. The MIT Press, Cambridge, Massachusetts, 3rd EDdition, 2009.

Majors

Fees

Tuition fees are for the academic year indicated at the top of the page.  

If you are a domestic graduate coursework or international student you will be required to pay tuition fees. Tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees.

Student Contribution Band:
2
Unit value:
6 units

If you are an undergraduate student and have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). You can find your student contribution amount for each course at Fees.  Where there is a unit range displayed for this course, not all unit options below may be available.

Units EFTSL
6.00 0.12500
Domestic fee paying students
Year Fee
2017 $3660
International fee paying students
Year Fee
2017 $4878
Note: Please note that fee information is for current year only.

Offerings and Dates

The list of offerings for future years is indicative only

Second Semester

Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary
7963 23 Jul 2018 30 Jul 2018 31 Aug 2018 26 Oct 2018 In Person N/A

Responsible Officer: Registrar, Student Administration / Page Contact: Website Administrator / Frequently Asked Questions