Design and Analysis of Algorithms (COMP285)
Complexity measure. Asymptotic notation. Time-space trade-off. A study of fundamental strategies used in design of algorithm classes including divide and concur, recursion, search and traversal. Backtracking. Branch and bound techniques. Analysis tools and techniques for algorithms. NP-complete problems. Approximation algorithms. Introduction to parallel and fast algorithms.
Related Programs
- Mathematics and Computer Science Undergraduate Program
- Information Systems Master's Program (without Thesis)
- Applied Mathematics & Computer Science Master's Program (with Thesis)
- Applied Mathematics and Computer Science Doctoral Program
- Mathematics and Computer Science - Actuarial Science Double Major Program
- Mathematics and Computer Science - Physics Double Major Program