Skip to content

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