Number	Dates	Readings	Tuesday	Thursday	Lab
1	Jan 22, 24	Chapter 1-2 Cormen Chapter 1 MacCormack Chapter 10 Cormen	Welcome	Algorithms and evaluation: P vs NP	Lab 1: Search
2	Jan 29, 31	Ch 3 Cormen Chapters 7-13, Winston. Possibly ch 10 Cormen	Lab 1 recap; Doing performance analysis, timing runs.	Effective presentations	Lab 2: Quicksort
3	Feb 5, 7	Cormen Ch 3 Winston Ch 17-24	Ruth, Kripa: lab 2 recap	Nora, Sophie: other sorting algorithms	Lab 3: String transformations
4	Feb 12, 14	MacCormack Ch 2 and Ch 3	Anna, Ranty: lab 3 recap	Sabine, Yupei: (PageRank) indexing for Information Retrieval	Lab 4: Search Engine Indexing
5	Feb 19, 21	Chapter 7 from Cormen.	Towell: Anagrams	Kirya, Fatima: string search from the end of Cormen ch 7. Also, the Boyer Moore string search algorithm	Continuing Lab4
6	Feb 26, 28	Chapter 4 from MacCormick and ch 8 Cormen (144-155 only)	Selin, Clara: lab 4 discussion	Jean, Bailey: Public Key Crypto	Lab 6: Hashing
7	Match 4, 6	Cormen: Ch 5	Saniya, Alison: Lab 6 discussion	Maha, Emma: graph basics	Lab 6: The "Death of a Salesman" problem
	Mar 11, 13	BREAK	BREAK	BREAK	NO LAB
8	Mar 18, 20	MacCormack: ch 6	Geoff -- Decision Trees	Anna, Selin -- Tree Balancing: Red-Black trees and B-Trees shortest paths
9	Mar 25, 27	Cormen Ch6	Bailey, Maha -- "Death of a salesman" problem	Clara, Kripa: Other shortest path algorithms (Bellman-Ford, Floyd-Warshall)	Lab 7: Dijkstra's Algorithm
10	April 1, 3	ch 6 MacCormack	Jean, Kirya: Dijkstra Lab discussion	Geoff: Clustering	Lab 9: K means Writeup due Apr 15
11	April 8, 10	Ch 5 MacCormack	NO CLASS -- I will be out of town	Saniya, Ranty: Error correcting codes
12	April 15, 17	Ch 6 MacCormack	Sabine, Emma: K-Means recap	Clara: Independent Study at Brown	Lab 8: Crypto Hash
13	April 22, 24	Ch 9 Cormen	Sophie, Yupei: cryptographic hashing recap	Ruth, Alison: Huffman Compression	Lab 10: Compression
14	April 29, May 1		Nora, Fatima: Compression Lab	WRAPUP