This course deals with the study of algorithms for solving practical problems as well as the data structures used in their implementation. A large variety of algorithms are candidates for study including greedy algorithms, dynamic programming, divide and conquer, exhaustive search, graph algorithms, heaps, network flow algorithms, string matching and so on. Analysis of the resource requirements of algorithms will be an important issue of study.
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 with real-life applications and the resource requirements.
- be able to apply the algroithmic 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 implemenation of algorithms for practical problems, using languages like C, C++.
Indicative Assessment
Assignments (40%); Final Exam (60%)
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
Thirty one-hour lectures and four two-hour tutorial/laboratory sessions.
Requisite and Incompatibility
Prescribed Texts
The following text book will be used for this course:
- Cormen, T., Leiserson, C.E. Rivest. R.L. & Stein, C. Introduction to Algorithms, MIT Press, 2nd Edition, 2002.
The following reference books are recommended for this course:
- Baase, S. & Van Gelder, Allen Computer Algorithms – Introduction to Design and Analysis by Addison-Wesley, 3rd Edition, 2000.
- Sedgewick, Robert Algorithms in C, 3rd Edition, 2002.
- Aho, Alfred V., Hopcroft, John E., & Ullman, Jeffrey D. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
- Kleinberg, John & Tardos, Eva Algorithms Design, Addison-Wesley, 2005.
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 |
Course fees
- Domestic fee paying students
| Year | Fee |
|---|---|
| 2015 | $3096 |
- International fee paying students
| Year | Fee |
|---|---|
| 2015 | $4146 |
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.
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 |
|---|---|---|---|---|---|---|
| 1402 | 20 Jul 2015 | 07 Aug 2015 | 31 Aug 2015 | 30 Oct 2015 | In Person | N/A |