Jul 25, 2024  
College Catalog 2023-2024 
College Catalog 2023-2024 [ARCHIVED CATALOG]

COMP 221 - Algorithm Design and Analysis

This course offers an in-depth introduction to the design and analysis of algorithms. Students will work with algorithms in pseudocode, and will learn formal and informal methods for analyzing algorithm efficiency and correctness. Topics may include recursion, divide and conquer, dynamic programming, greedy methods, branch and bound, randomized, probabilistic, and parallel algorithms. Application areas include string processing, graphs, geometric problems, and optimization. This course will introduce computability topics including regular expressions, grammars and parsing, automata, nondeterminism, and NP completeness. Prerequisite(s): COMP 128  (or COMP 124, if previously taken) and  , or permission of instructor. Every semester (4 Credits)