CS 280
Introduction to Algorithms

Department of Computer Science
Oberlin College
Tom Wexler

Course Info

Class Times:	TR 9:30-10:50	Phone:	(440) 775-8052
Classroom:	King 221	Office:	King 223 E
Professor:	Tom Wexler	Office Hours:	MTW 2-3 and by appointment
Email:	tom.wexler "at" oberlin.edu

Announcements

Welcome to Computer Science 280! Check back here for important announcements throughout the semester.

Resources

• Syllabus
• Homework Tips
  
  
• LaTeX Template
• LaTeX Reference Sheet
• LaTeX Guide
  
  
• Tips: Greedy Stays Ahead
• Tips: Exchange Arguments
• Tips: Dynamic Programming
• Tips: NP-Completeness

Schedule

Week	Date	Topic	Reading
1	Feb 8	Introduction, Overview, and Matching
	Feb 10	Stable Matching and Representative Problems	1, 2.1 - 2.4, 3
2	Feb 15	Greedy Algorithms: Greedy Stays Ahead	4.1, 4.2
	Feb 17	Greedy Algorithms: Exchange Arguments	4.3 - 4.5
3	Feb 22	Dynamic Programming: Basic Recurrences	6.1, 6.2
	Feb 24	Dynamic Programming: General Recurrences	6.3, 6.4
4	Mar 1	Dynamic Programming	6.5, 6.6
	Mar 3	Dynamic Programming	6.7, 6.8
5	Mar 8	Divide and Conquer	5.1 - 5.4
	Mar 10	Test 1
6	Mar 15	Network Flow	7.1 - 7.3
	Mar 17	Network Flow	7.5, 7.6
7	Mar 22	Flow Applications	7.7 - 7.9
	Mar 24	Flow Applications	7.10 - 7.12
Spring Recess
8	Apr 5	NP-Completeness	8.1, 8.2
	Apr 7	NP-Completeness	8.3, 8.4
9	Apr 12	NP-Completeness	8.5, 8.6
	Apr 14	NP-Completeness	8.7, 8.8
10	Apr 19	NP-Completeness	8.10
	Apr 21	Test 2
11	Apr 26	Approximation Algorithms	11.1
	Apr 28	Approximation Algorithms	11.2, 11.3
12	May 3	Approximation Algorithms	11.4, 11.8
	May 5	Randomized Algorithms	13.1, 13.2
13	May 10	Randomized Algorithms	13.3, 13.4
	May 12	On-Line Algorithms
Final Exam: TBA