COMP 303: Design and Analysis of Algorithms
2009 Trimester 2
| COMP 303 |
CRN 962, 15 Points (2009 2/3) |
| Coordinator: |
Dr Alex Potanin
|
| Lecturer: |
Dr Simon Doherty
|
| Prerequisites: |
COMP 202 or SWEN 202; one of COMP 201, 205, 206, ENGR 202, SWEN 201; MATH 214 |
| Lectures: |
Mon Thu Fri 4-5 timetable |
| Textbook: |
Jon Kleinberg and Eva Tardos, "Algorithm Design", Addison-Wesley, 2006, $125.99 |
| Prescription: |
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. |
|
Home Page
|
EResearch