We will follow the textbook

Date | Topic | Reading | HW Assigned | HW Due | Writing Assigned | Writing Due |
---|---|---|---|---|---|---|

Th 08/28 | Introduction, Proofs | 1.1-3.2 | ||||

Tu 09/02 | Greedy Algorithms | 16.1-16.2 | Draft | |||

Th 09/04 | Summations, PREREQ TEST | A.1-A.2 | ||||

Tu 09/09 | Recurrences | 4.1-4.2 | HW1 | |||

Th 09/11 | Master Theorem | 4.3-4.4 | ||||

Tu 09/16 | Heapsort | 6.1-6.5 | HW2 | HW1 | ||

Th 09/18 | Quicksort | 7.1-7.4 | Draft | |||

Tu 09/23 | Lower bounds on Sorting | 8.1-8.4 | HW3 | HW2 | ||

Th 09/25 | Linear-Time Selection | 9.1-9.3 | ||||

Tu 09/30 | Hash Tables | 11.1-11.5 | HW4 | HW3 | ||

Th 10/02 | Dynamic Programming I | 15.1-15.3 | Revision | |||

Tu 10/07 | Dynamic Programming II | 15.4-15.5 | HW5 | HW4 | ||

Th 10/09 | Greedy Algorithms Revisited | 16.3 | ||||

Tu 10/14 | Dynamic Programming vs Greedy | HW5 | ||||

Th 10/16 | Review | Revision | ||||

Tu 10/21 | Midterm Exam |
|||||

Th 10/23 | Basic Graph Algorithms I | 22.1-22.4 | Draft | |||

Tu 10/28 | Basic Graph Algorithms II | |||||

Th 10/30 | Basic Graph Algorithms III | HW6 | ||||

Tu 11/04 | Strongly Connected Components | 22.5 | ||||

Th 11/06 | Minimum Spanning Trees I | 23.1-23.2 | HW7 | HW6 | ||

Tu 11/11 | Minimum Spanning Trees II | Draft | ||||

Th 11/13 | Shortest Paths I | 24.1-24.3 | HW8 | HW7 | ||

Tu 11/18 | Shortest Paths II | 24.4-24.5 | ||||

Th 11/20 | Shortest Paths III | 25.1-25.3 | HW8 | Revision | ||

Tu 11/25 | Maxium Flow I | 26.1-26.3 | ||||

Th 11/27 | Thanksgiving break |
|||||

Tu 12/02 | Maximum Flow II | HW9 | ||||

Th 12/04 | NP-completeness | Revision | ||||

Tu 12/09 | Review | HW9 | ||||

Th 12/11 | Final Exam 1:00pm - 3:00pm |

Last Modified: 21 Aug 2003 13:44:51 EDT by Richard Chang to Fall 2003 CMSC 441 Section Homepage