An investigation of algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, randomized algorithms, undecidability, NP-completeness, and approximation algorithms. Only one of the following may be counted: Computer Science 331, 331H, 378 (Topic: Algorithms and Complexity). Three lecture hours and one discussion hour a week for one semester.