| Number | Dates | Readings | Tuesday | Thursday | Lab |
|---|---|---|---|---|---|
| 1 | Jan 17, 19 | Chapter 1 Cormen Chapter 1 MacCormack Chapter 10 Cormen |
Welcome | Algorithms and evaluation: P vs NP | Lab 1: Language Standards |
| 2 | Jan 24, 26 | Ch 2 Cormen Chapters 7-13, Winston. Possibly ch 10 Cormen |
Lab 1 recap; Doing performance analysis, timing runs. | Effective presentations | Lab 2: Linear Search |
| 3 | Jan 31, Feb 2 | Cormen Ch 3 Winston Ch 17-24 |
JiYoon, Ariel: lab 2 recap | Grace S-H, Ellie: sorting algorithms | Lab 3: Quicksort |
| 4 | Feb 7, Feb 9 | MacCormack Ch 2 and Ch 3 | Quinn, Rey: lab 3 recap | Lily, Magdalen: (PageRank) indexing for Information Retrieval | Lab 4: Search Engine Indexing |
| 5 | Feb 14, 16 | Chapter 4 from MacCormick and Chapter 8 from Cormen. | Towell. Anagrams | Grace C, Alana, Dean: Public Key Crypto | Continuing Lab4 |
| 6 | Feb 21, 23 | ch 7 Cormen | Paige, Hilary: lab 4 discussion | Ed, Selena: string search (also Boyer Moore?) | Lab 6: Hashing |
| 7 | Feb 28, Mar 2 | Cormen: Ch 5 | Geoff: Lab 6 discussion | Geoff: graphing basics | Lab 7: Simple Graph Algorithms |
| Mar 7, 9 | BREAK | BREAK | NO LAB | ||
| 8 | Mar 14, 16 | Cormen ch 6 | Dean, Ellie, Ed: lab 7 discussion | Quinn, Hilary: shortest paths | Lab 8: Dijkstra's Algorithm |
| 9 | Mar 21, 23 | MacCormack: ch 6 | Geoff: Clustering | Paige, JiYoon: Balancing: Red-Black trees and B-Trees | |
| 10 | Mar 28, 30 | ch 5 MacCormack | Magdelen, Alana: Lab 8 discussion | Rey, Ariel: error correcting codes | Lab 9: K means |
| 11 | April 4,6 | Ch 9 MacCormack | Grace S, Lily: Lab 9 discussion | Geoff: Cryptographic Hash Functions | Lab 10: Crypto Hash |
| 12 | April 11,13 | Ch 7 MacCormack ch 9 Cormen |
Selena, Grace Ch: discussion of Lab 10 | Compression | Lab 11: Compression |
| 13 | April 18, 20 | Ch 14 Roughgarden | lab 11 recap | Huffman Compression, Greediness | Lab 13: Bin packing (There is no lab 12) |
| 14 | April 25, 27 | lab 13 discussion | Algorithms Game Show | NO LAB |