(1) APM 405 Introduction to Graph Theory, Dr. Eddie Cheng
This is a sophomore level course. Topics include paths and cycles, colouring, independent sets, spanning trees, shortest paths, matchings, planar graphs, and applications such as the game Instant Insanity, scheduling problems and facilities design.
(2) APM 367 Design and Analysis of Algorithms, Dr. Serge Kruk
Computer algorithms, their design and analysis. Strategies for constructing algorithmic solutions, including divide-and-conquer, dynamic programming and greedy algorithms. Development of algorithms for parallel and distributed architectures. Computational complexity as it pertains to time and space is used to evaluate the algorithms. A general overview of complexity classes is given.
Return to OUSMI Home Page.