Algorithm Design and Analysis

Three credits · Undergraduate

An introduction to the design, analysis, and implementation of algorithms to solve common computational problems. Basic algorithm design techniques such as the greedy strategy, divide-and-conquer, and dynamic programming, as well as network flows, intractability, and NP-completeness will be discussed. Prerequisites: CSCI 255, 277. Three credits and two-hour lab.