COMP 6030 - Desgn/Anlys Algorithms

(3) Asymptotic behavior of programs; basic paradigms in algorithm design: greedy, divide-and-conquer, 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. NOTE: Computer Science majors may not use this course to fulfill degree requirements. NOTE: Computer Science majors may not use this course to fulfill degree requirements PREREQUISITE(S): COMP 2150 and 3410 or permission of instructor.