http://cs.anu.edu.au/courses/COMP3600/comp3600info.pdf
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:- Display an advanced 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.
- Expertly apply the most effective algorithmic techniques including dynamic programming, greedy policy, and divide-and-conquer, to solve some practical problems.
- Define and analyse time and space complexities of algorithms.
- Demonstrate experience in the design and implementation of algorithms for practical problems, using languages like C, C++.
Mapping of Learning Outcomes to Assessment and Professional Competencies
Other Information
http://cs.anu.edu.au/courses/COMP3600/intro.htmlIndicative 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.
Workload
The course consists of about thirty lectures, six tutorials/labs (two hours each) which run together.
Requisite and Incompatibility
Prescribed Texts
The following text book will be used for this course:- 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:
- Robert Sedgewick,Algorithms in C (or JAVA), Addison-Wesley, 3rd Edition, 2002.
- Sara Baase and Allen Van Gelder,Computer Algorithms { Introduction to Design and Anal-ysis, Addison-Wesley, 3rd Edition, 2000.
- John Kleinberg and Eva Tardos,Algorithms Design, Addison-Wesley, 2005.
- Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani,Algorithms, McGraw HillHigher Education, 2008.
- Alfred V. Aho, John E. Hopcroft and Je rey D. Ullman,The Design and Analysis of Com-puter Algorithms, Addison-Wesley, 1974
Majors
Minors
Specialisations
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 |
|---|---|
| 2016 | $3276 |
- International fee paying students
| Year | Fee |
|---|---|
| 2016 | $4368 |
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 |
|---|---|---|---|---|---|---|
| 7339 | 18 Jul 2016 | 29 Jul 2016 | 31 Aug 2016 | 28 Oct 2016 | In Person | N/A |