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-.
Mo, We, Fr 9:30 AM – 10:20 AM
AQ 3150, Burnaby