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