COMP 4030 - Design/Analysis Algorithms

(3) Asymptotic behavior of programs, basic paradigms in algorithm design; greedy, divide-andconquer, dynamic programming; analysis of efficiency and optimality of representative algorithms, including graph, pattern matching, numerical, randomized, and approximation algorithms; approaches to lower bound analysis; basic parallel algorithms. (F, Sp) PREREQUISITE: COMP 2700, or permission of instructor.