| Material Covered | Monday | Tuesday | Wednesday | Thursday | Friday |
| Introduction to Algorithms: Chapter 0 | Aug 29 |
Aug 30 Class lecture at 2pm Homework 0 available (optional) |
Aug 31 No office hours/labs/recitations today |
Sep 1 |
Sep 2 Class lecture at 2pm Homework 1 available |
| Graph Algorithms: Sec 3.1, 4.1-4.2 | Sep 5 Work on homework |
Sep 6 Work on homework |
Sep 7 Office Hours Must attend |
Sep 8 Due @11:59pm: Homework 1 |
Sep 9 Class lecture at 2pm Recitation A available Homework 2 available |
| Graph Algorithms: Sec 3.1, 4.1-4.2, 3.2-3.4 | Sep 12 Work on homework |
Sep 13 Class lecture at 2pm |
Sep 14 Office Hours Must attend Due: Read or watch Recitation A |
Sep 15 Due @11:59pm: Homework 2 |
Sep 16 Class lecture at 2pm Recitation B available Homework 3 available |
| Graph Algorithms: Sec 4.3-4.5, 4.7 Greedy Algorithms: Sec 5.1 |
Sep 19 Work on homework |
Sep 20 Class lecture at 2pm |
Sep 21 Office Hours Must attend Due: Read or watch Recitation B |
Sep 22 Due @11:59pm: Homework 3 |
Sep 23 Class lecture at 2pm Recitation C available Homework 4 available |
| Greedy Algorithms: Interval Scheduling | Sep 26 Work on homework |
Sep 27 Class lecture at 2pm |
Sep 28 Office Hours Must attend Due: Read or watch Recitation C |
Sep 29 Due @11:59pm: Homework 4 |
Sep 30 Class lecture at 2pm |
| Randomized Algorithms | Oct 3 Study for Exam |
Oct 4 Class lecture at 2pm |
Oct 5 Office Hours Attendance optional |
Oct 6 Study for Exam |
Oct 7 Exam 1 in class at 2pm |
| Divide and Conquer: Sections 2.1-2.3 | Oct 10 |
Oct 11 Class lecture at 2pm |
Oct 12 Office Hours Attendance optional |
Oct 13 |
Oct 14 Class lecture at 2pm Recitation D available Homework 5 available |
| Divide and Conquer: Sections 2.4-2.5, Dynamic Programming: Sections 6.1-6.2 |
Oct 17 Work on homework |
Oct 18 Class lecture at 2pm |
Oct 19 Office Hours Must attend Due: Read or watch Recitation D |
Oct 20 Due @11:59pm: Homework 5 |
Oct 21 Class lecture at 2pm Recitation E available Homework 6 available |
| Dynamic Programming: Sections 6.3-6.4 | Oct 24 Work on homework |
Oct 25 Class lecture at 2pm |
Oct 26 Office Hours Must attend Due: Read or watch Recitation E |
Oct 27 Due @11:59pm: Homework 6 |
Oct 28 Class lecture at 2pm Recitation F available Homework 7 available |
| Dynamic Programming: Sections 6.7 Network Flow and Linear Programming: Sections 7.1-7.2 |
Oct 31 Work on homework |
Nov 1 Class lecture at 2pm |
Nov 2 Office Hours Must attend Due: Read or watch Recitation F |
Nov 3 Due @11:59pm: Homework 7 |
Nov 4 Class lecture at 2pm |
| Network Flow and Linear Programming: Sections 7.1-7.3 | Nov 7 Study for Exam |
Nov 8 Class lecture at 2pm Recitation G available Homework 8 available |
Nov 9 Office Hours Attendance optional |
Nov 10 Study for Exam |
Nov 11 Exam 2 in class at 2pm |
| NP-Complete Problems: Chapter 8 | Nov 14 Work on homework |
Nov 15 Class lecture at 2pm |
Nov 16 Office Hours Must attend Due: Read or watch Recitation G |
Nov 17 Due @11:59pm: Homework 8 |
Nov 18 Class lecture at 2pm |
| NP-Complete Problems: Chapter 8 | Nov 21 |
Nov 22 Class lecture at 2pm Recitation H available Homework 9 available |
Nov 23 |
Nov 24 |
Nov 25 |
| NP-Complete Problems: Chapter 8 | Nov 28 Work on homework |
Nov 29 Class lecture at 2pm |
Nov 30 Office Hours Must attend Due: Read or watch Recitation H |
Dec 1 Due @11:59pm: Homework 9 |
Dec 2 Class lecture at 2pm Recitation I available |
| Dealing with Intractability: Chapter 9 | Dec 5 Watch Recitation, Study for Final Exam |
Dec 6 Class lecture at 2pm |
Dec 7 Office Hours Attendance optional Due: Read or watch Recitation I |
Dec 8 Study for Final Exam |
Dec 9 Class lecture at 2pm |
Week 16 | Final Exam on Friday, Dec 16, see the Final Exam schedule |