COMP 303 – Design and Analysis of Algorithms
| Points: | 15 | Prerequisites: | COMP 261 (or COMP 205 or ENGR 202), SWEN 224 (or SWEN 202 or COMP 202), one of MATH 261, 251, 211 (or MATH214 or 207) |
|---|---|---|---|
| Faculty: | Engineering | Corequisites: | None |
| School: | Engineering & Comp Sci | Restrictions: | None |
This course examines techniques for developing correct and efficient algorithms to solve some important classes of problems in Computer Science. It explores various methods for designing algorithms, including greedy algorithms, divide and conquer, dynamic programming and graph algorithms. It covers techniques for demonstrating the correctness of algorithms and for analysing their efficiency.
Tuition Fees
2012:
domestic $708.00 
international $3,012.45
Tutorials
1 hour per week
Textbook
Kleinberg and Tardos, "Algorithm Design", Addison-Wesley, 2006.
Trimester 2 2012
* indicates instructor is the course coordinator.
| CRN | From/To | Days | Time | Building [Campus] | Room | Instructor | 962 | 16 Jul – 21 Oct 2012 | Mon, Wed, Fri | 1100 - 1150 | Cotton [Kelburn] | 118 | Alex Potanin* |
|---|