Please note:

To view the current Academic 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 with a minimum grade of C-.

Section Instructor Day/Time Location
D100 Igor Shinkar
Mo 12:30 PM – 2:20 PM
We 12:30 PM – 1:20 PM
AQ 3159, Burnaby
AQ 3159, Burnaby