Algorithms COMP3600

Learning outcomes

More information may be available for enrolled students on the course website at http://cs.anu.edu.au/student/comp3600/

On completion of this course the student will:

1. 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.
2. Be able to apply the algorithmic techniques including dynamic programming, greedy policy, and divide-and-conquer, to solve some practical problems.
3. Be able to analyze time and space complexities of algorithms.
4. Have some experience in the design and implementation of algorithms for practical problems, using languages like C, C++.