• 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
  • Academic career UGRD
  • Course convener
    • Dr Weifa Liang
  • Mode of delivery In Person
  • Offered in Second Semester 2014
    See Future Offerings

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:

  1. Have a thorough understanding of a variety of algorithms with practical applications and the resource requirements of each.
  2. Have an good idea as to where these algorithms can be used. 
  3. Have a basic understanding of the theory of intractability. 
  4. Have some experience in proving that 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.

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. Students continuing in their current program of study will have their tuition fees indexed annually from the year in which you commenced your program. 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
1994-2003 $1650
2004 $2190
2005 $2190
2006 $2190
2007 $2298
2008 $2592
2009 $2850
2010 $2916
2011 $2946
2012 $2946
2013 $2946
2014 $2952
International fee paying students
Year Fee
1994-2003 $3234
2004 $3234
2005 $3288
2006 $3426
2007 $3426
2008 $3426
2009 $3426
2010 $3750
2011 $3756
2012 $3756
2013 $3756
2014 $3762
Note: Please note that fee information is for current year only.

Offerings, Dates and Class Summary Links

The list of offerings for future years is indicative only.
Class summaries, if available, can be accessed by clicking on the View link for the relevant class number.

Second Semester

Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary
7840 21 Jul 2014 01 Aug 2014 31 Aug 2014 30 Oct 2014 In Person N/A

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