Design, analysis and comparison of algorithms; divide and conquer techniques, greedy method, dynamic programming and smart searching. Applications to optimization with constraints and decision problems. Theory of computability including examples of NP-complete problems such as the "traveling salesman" problem.
P: COMP SCI 351 with at least a C grade, and MATH 202 with at least a C grade
Spring.