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


This course deals with the study of algorithms for solving practical problems, and of the data structures used in algorithm implementations. Detailed analysis of the resource requirements of algorithms will be an important issue.
The topics covered will include: mathematical tools, greedy algorithms, dynamic programming, divide-and-conquer, data structures (hash tables, binary search trees, red-black trees, and disjoint sets), basic search techniques (breadth-first search and depth-first search), graph algorithms (topo-logical sort, minimum spanning trees and single-source and all-to-all shortest paths), etc.

Learning Outcomes

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

On completion of this course the student will:

  • Have a thorough understanding of a variety of algorithms, including linear selection, minimum spanning trees, single source shortest path, Huffman coding, etc, with real-life applications and the resource requirements.
  • Be able to apply the algorithmic techniques including dynamic programming, greedy policy, and divide-and-conquer, to solve some practical problems.
  • Be able to analyze time and space complexities of algorithms.
  • Have some experience in the design and implementation of algorithms for practical problems, using languages like C, C++.

Other Information


Indicative Assessment

There will be SIX quizzes (Q), TWO assignments (a1 and a2) (A), ONE mid-semester exam (M), and ONE final exam (F). Following the School assessment policy, the final mark of this course will be calculated by the  formula (see PDF), subject to necessary adjustment during the School examination meeting.

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.


The course consists of about thirty lectures, six tutorials/labs (two hours each) which run together.

Requisite and Incompatibility

COMP1100 or COMP1140, or COMP1510; 6units of 2000-level COMP courses; and 6 units of 2000-level MATH courses or COMP2600.

Prescribed Texts

The following text book will be used for this course:

  1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein,Introduction to Algorithms, MIT Press,3rd Ed., 2009.

The following reference books are recommended for this course:

  1. Robert Sedgewick,Algorithms in C (or JAVA), Addison-Wesley, 3rd Edition, 2002.
  2. Sara Baase and Allen Van Gelder,Computer Algorithms { Introduction to Design and Anal-ysis, Addison-Wesley, 3rd Edition, 2000.
  3. John Kleinberg and Eva Tardos,Algorithms Design, Addison-Wesley, 2005.
  4. Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani,Algorithms, McGraw HillHigher Education, 2008.
  5. Alfred V. Aho, John E. Hopcroft and Je rey D. Ullman,The Design and Analysis of Com-puter Algorithms, Addison-Wesley, 1974




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:
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.

6.00 0.12500
Domestic fee paying students
Year Fee Description
1994-2003 $1650
2014 $2952
2013 $2946
2012 $2946
2011 $2946
2010 $2916
2009 $2850
2008 $2592
2007 $2298
2006 $2190
2005 $2190
2004 $2190
International fee paying students
Year Fee
1994-2003 $3234
2014 $3762
2013 $3756
2012 $3756
2011 $3756
2010 $3750
2009 $3426
2008 $3426
2007 $3426
2006 $3426
2005 $3288
2004 $3234
Note: Please note that fee information is for current year only.

Offerings, Dates and Class Summary Links

ANU utilises MyTimetable to enable students to view the timetable for their enrolled courses, browse, then self-allocate to small teaching activities / tutorials so they can better plan their time. Find out more on the Timetable webpage.

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
6892 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