W	L	Date	Topic	Reading	Note
1	1	2011-01-10	Course agenda, policies, sorting algorithms, time complexity
	2	2011-01-12	Algorithm analysis	Chapter 1, Sections 2.1, 2.2	Notes
2		2011-01-17	Martin Luther King Jr. Day (no lecture)
	3	2011-01-19	Asymptotic notation	Section 2.3, Chapter 3	Notes
3	4	2011-01-24	Divide and conquer	Chapter 4 (except Section 4.6)	Notes
	5	2011-01-26
4	6	2011-01-31	Probabilistic Analysis and Randomized Algorithms	Chapter 5 (except Section 5.4)	Notes
	7	2011-02-02
		2011-02-03	Recitation, 7 PM, Lindley Hall 101
5	8	2011-02-07	Sorting and order statistics	Chapters 6-9	Notes
	9	2011-02-09
6	10	2011-02-14
	11	2011-02-16	Data structures	Chapters 11 (except Section 11.4), 12 (except Section 12.4)
7	12	2011-02-21
		2011-02-22	Recitation, 7 PM, Lindley Hall 101
	13	2011-02-23	Red-black trees, augmenting data structures	Chapters 13, 14	Notes
8	14	2011-02-28
	15	2011-03-02
		2011-03-04	Recitation, 4 PM, Lindley Hall 101
9	16	2011-03-07	Midterm recap
		2011-03-09	Midterm Exam
10		2011-03-14	Spring break: no lecture
		2011-03-16	Spring break: no lecture
11	17	2011-03-21	Dynamic programming	Chapter 15	Notes
	18	2011-03-23
12	19	2011-03-28
	20	2011-03-30
13	21	2011-04-04
		2011-04-05	Recitation, 6:30 PM, Lindley Hall 115
	22	2011-04-06	Greedy algorithms	Chapter 16	Notes
14	23	2011-04-11	Minimum spanning tree	Sections 21.1–21.3, Chapter 23	Notes
	24	2011-04-13
15	25	2011-04-18	Graph algorithms	Chapters 22, 24 (excluding Section 24.4), 25	Notes
	26	2011-04-20
		2011-04-22	Recitation, 5:30 PM, Lindley Hall 101
16	27	2011-04-25	Multithreaded algorithms	Chapter 27	Notes
	28	2011-04-27	NP-complete problems	Chapter 34 (suggested)	Notes
17		2011-05-06	Final Exam, 10:15 AM, Geology 447 (regular classroom)

Unless noted otherwise, chapter and section numbers refer to the chapters and sections from the textbook.