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 |
May 8 – Aug 4, 2017: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |