i Please note:
To view the current calendar, go to
Design and Analysis of Computing Algorithms CMPT 405 (3)
Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NP-completeness, approximation algorithms, selected topics. Prerequisite: CMPT 307.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Ramesh Krishnamurti |
Sep 2 – Dec 1, 2014: Mon, Wed, Fri, 9:30–10:20 a.m.
|
Burnaby |