This schedule is only a minor variation from the schedule I (David Taylor) used the last time I taught this course. Dates are subject to change, but the first midterm will be given in the first half of March. On March 18, I will return from leave, and we will take assessment then of where we stand in the overall schedule.
| Date | Topics Covered | Readings (Cormen et al 2nd edition) |
| January 24 | Introductions and Administrivia, Warm-up topic (such as find-max value vs. find 2nd-max value) |
Skim Chapter 1 |
| January 29 | Definition of Algorithms, Math review | Appendix A, especially equations A.1, A.2, A.5, A.6, A.7, section A.2. |
| January 31 | Quadratic sorting (from 46B), analysis | Chapter 2.1, 2.2, 3.1 |
| February 5 | Recurrence relations, substitution method, and mergesort | Chapter 2.3.1, 3.2, 4.1 |
| February 7 | More recurrence relations | Catch-up Reading: Chapters 1-4.1, Appendix A 1058-60, 1062-66 |
| February 12 | Master Method, Quicksort | CLRS 4.3, 7-7.1 |
| February 14 | Quicksort Continued, quickselect | CLRS 7.2-7.3, 7.4 (skim), 9.2 |
| February 19 | Start Trees, Heaps | CLRS B.5.2, B.5.3, 6.1 |
| February 21 | Heaps, heapsort | CLRS 6.2-6.4 |
| February 26 | Finish Heaps, Lower bounds for sorting | CLRS 8.1 |
| February 28 | Countsort, radixsort, bucketsort, BSTs | CLRS 8, 12-12.3 (BSTs can be used to sort, BSTs introduced in 46B) |
| March 4 | 2-3 trees | balanced binary tree handout |
| March 6 | B-Trees, top-down 2-3-4 trees | CLRS 18 |
| March 11 | Review for Midterm 1 | |
| March 13 | *****Midterm 1***** | All material so far. |
| March 18 | David Taylor returns. Synchronize. Hashing? (Covered in 46B) |
11.0-11.3.2, Skip proofs for Thms 11.1, 11.2 |
| March 20 | Hashing analysis, Graphs, and the celebrity problem | Thms 11.1, 11.2, Chap. 22.1 |
| April 1 | Graphs: breadth first and depth first search | CLRS 22.2, 22.3 |
| April 3 | Labeling edges and topological sort (2 ways) | |
| April 8 | Graphs: strongly connected components. Start disjoint sets | CLRS 22.5, 21.1 |
| April 10 | Disjoint Sets, Kruskal's MST | CLRS 21-21.3, 23 |
| April 15 | Prim's alg, start Single source shortest path trees | CLRS 23, 24.0, 24.3 |
| April 17 | Finish Single source shortest path trees | CLRS 24-24.3 |
| April 22 | Midterm 2 Review | All material covered so far. |
| April 24 | *****Midterm 2***** | All material covered so far. |
| April 29 | Midterm 2 returned, program proofs | CLRS pages 17-19 |
| May 1 | Loop invariants and proofs, start Floyd-Warshall |
CLRS pages 17-19, Ch 25.2 |
| May 6 | Finish Floyd-Warshall, start NP |
Ch 25.2, Ch 34 For Ch 34, we will only see a small amount of the material covered, namely: definitions of P, NP, NP-hard, and NP-complete, the vertex cover, independent set, and dominating set (5/10) problems, and reductions and their direction (5/10). |
| May 8 | Finish NP, TBD | Ch 34, 35.1 For Ch 34, we will only see a small amount of the material covered, namely: definitions of P, NP, NP-hard, and NP-complete, the vertex cover, independent set, and dominating set problems, and reductions and their direction. |
| May 13 | Review for Final | |
| May 15 Thursday, 7:15 a.m. |
Final Examination, Section 3 | Everything we have seen. |
| May 21 Wednesday, 9:45 a.m. |
Final Examination, Section 4 | Everything we have seen. |