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.

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.

Assignments (50%); Final Exam (50%)

Twenty-six one-hour lectures, together with occasional seminars

24 units of 3000-level COMP courses including COMP3600

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.