1 | Week | Day | Date | Topic | Reading(s) | Readback | Class Notes | Assignments |
---|---|---|---|---|---|---|---|---|

2 | 1 | Tu | Jan 16 | Course Overview + Stable Matching Problem | Syllabus | Readback | ||

3 | Thu | Jan 18 | Boston Pool Algorithm and Algorithm Proofs | UIUC Algorithms Notes: Section 0 | Readback | Notes | No prework for HW 0 | |

4 | 2 | Mon | Jan 22 | HW 0 presentations | HW 0 (problems/solutions given in class notes on Jan 18) | |||

5 | Tu | Jan 23 | Asymptotic Complexity, Numerical Algorithms | Chapter 0 and Section 1.1 | Readback | |||

6 | Th | Jan 25 | Numerical Algorithms, Continued | Section 1.2-1.3, up to but not including 1.3.1 | Readback | HW 1 prework | ||

7 | 3 | Mon | Jan 29 | HW 1 | HW 1 | |||

8 | Tu | Jan 30 | Numerical Algorithms, Random Algorithms | No reading | No readback | |||

9 | Th | Feb 1 | Prime number generation | Section 1.3.1-1.4 | No readback | |||

10 | 4 | Mon | Feb 5 | HW 2 | HW 2 | |||

11 | Tu | Feb 6 | RSA cryptography | Review 1.4 | Readback | |||

12 | Th | Feb 8 | Asymptotic recurrence relations | Sections 2.1, 2.2 | Readback | HW 3 prework (on turnin page) | ||

13 | 5 | Mon | Feb 12 | HW 3 | HW 3 | |||

14 | Tu | Feb 13 | Divide and Conquer examples | |||||

15 | Th | Feb 15 | More Divide and Conquer examples | Sections 2.3-2.5 | Readback | |||

16 | 6 | Mon | Feb 19 | President's Day | ||||

17 | Tu | Feb 20 | ||||||

18 | Th | Feb 22 | Power and Priviledge Symposium | HW 4 due Wednesday at 11pm | ||||

19 | 7 | Tu | Feb 27 | Graphs 1 | Sections 3.1-3.3 | Readback | ||

20 | Th | Mar 1 | Graphs 2 | Sections 3.4, 4.1-4.2 | No readback | |||

21 | 8 | Tu | Mar 6 | Graph 3 + Amortized Analysis | Sections 4.3, 4.4, 4.6, 4.7 | No readback | ||

22 | Th | Mar 8 | Minimum Spanning Trees and Greedy Algorithms | Section 5.1 | No readback | HW 5 due Wednesday at 11pm | ||

23 | Spring Break | |||||||

24 | 9 | Mon | Mar 26 | |||||

25 | Tu | Mar 27 | Minimum Spanning Tree Analysis and Impl | Section 5.1.4 | No readback | Code for class | ||

26 | Th | Mar 29 | Greedy Algorithm practice problems | Section 5.2 | No readback | HW 6: MST Assignment | ||

27 | 10 | Mon | Apr 2 | No homework groups | ||||

28 | Tu | Apr 3 | Dynamic Programming Intro | Sections 6.1-6.2 | No readback | HW 6 due at 11pm on Wednesday | ||

29 | Th | Apr 5 | Dynamic Programming Exercises | Sections 6.3-6.5 | No readback | Code for class | ||

30 | 11 | Mon | Apr 9 | |||||

31 | Tu | Apr 10 | Undergraduate Research Symposium (NO CLASS) | |||||

32 | Th | Apr 12 | Dynamic Programming Exercises cont. | |||||

33 | 12 | Mon | Apr 16 | |||||

34 | Tu | Apr 17 | Linear Programming and Max Flow | Sections 7.1-7.3 | No readback | HW 8: Exam Format | ||

35 | Thu | Apr 19 | Duality and Reductions | No readback | HW 7 due at 11pm on Friday | |||

36 | 13 | Mon | Apr 23 | HW 8 | ||||

37 | Tu | Apr 24 | NP and NP-complete problems | Sections 8.1-8.2 | HW 9 | |||

38 | Th | Apr 26 | NP-complete proofs and non-proofs | Section 8.3 | ||||

39 | 14 | Mon | Apr 30 | HW 9 | ||||

40 | Tu | May 1 | Dealing with NP-completeness | Chapter 9 | ||||

41 | Th | May 3 | ||||||

42 | Take-Home Final Exam during finals week |