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 Valentine Kabanets
Mo 2:30 PM – 4:20 PM
We 2:30 PM – 3:20 PM
WMC 3260, Burnaby
AQ 3154, Burnaby