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.
For calendar technical problems or errors, contact calendar-sfu@sfu.ca | Calendar Changes and Corrections