CS 280
Introduction to Algorithms

Department of Computer Science
Oberlin College
Tom Wexler

Course Info

Times: MWF 10-10:50 Room: King 227
Professor: Tom Wexler Office Hours: MF 1:30-3pm, T 10-11am

OWLs: Kirsten Vail and Maria Stull Hours: TBA
Student Helpers: Jun Li and Sam Goree Hours: TBA

Resources

Schedule

Week Topic Reading
1 Introduction and Matching 1, 2.1-4, 3
2 Greedy Algorithms 4.1-5
3 Dynamic Programming 6.1-4
4 Dynamic Programming 6.5-8
5 Divide and Conquer, Test 1 5.1-4
6 Network Flow 7.1-3, 7.5-6
7 Flow Applications 7.7-12
Fall Break
8 NP-Completeness 8.1-4
9 NP-Completeness 8.5-8, 8.10
10 Special Cases, Test 2 10.1-2
11 Approximation Algorithms 11.1-4
12 Randomized Algorithms 11.8, 13.1-4
13 Algorithmic Game Theory
14 On-Line Algorithms