An investigation of algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, randomized algorithms, undecidability; NP-completeness, approximation algorithm, sorting lower bound, selected topics from amortized analysis, network flow, and linear programming. Only one of the following may be counted: Computer Science 331, 331H, 378 (Topic: Algorithms and Complexity). Three lecture hours and one hour of discussion a week for one semester.