Lecture 1 | Sept 28 | Introduction and Stable Matching | Anderson | PPT | Slides with Ink | CSD | CSD with ink | Lecture Notes | |||
Lecture 2 | Sept 30 | Stable Matching | Anderson | PPT | Slides with Ink | CSD | CP3 (804) with ink | Lecture Notes | |||
Lecture 3 | Oct 3 | Efficient Algorithms | Anderson | PPT | Slides with Ink | CP3 | CP3 (804) with ink | Lecture Notes | |||
Lecture 4 | Oct 5 | Models of Computation | Anderson | PPT | Slides with Ink | CSD | Lecture Notes | Playback | |||
Lecture 5 | Oct 7 | Graph Theory | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 6 | Oct 10 | Graph Theory (Interaction Lecture) | Anderson | PPT | Slides with Ink Annotated Slides | CSD | CSD with Ink | Lecture Notes | Playback | Activitiy summary | |
Lecture 7 | Oct 12 | Greedy Algorithms | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 8 | Oct 14 | Greedy Algorithms | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 9 | Oct 17 | Dijkstra's Algorithm | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | Activitiy summary | |
Lecture 10 | Oct 19 | Minimum Spanning Trees | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 11 | Oct 21 | Minimum Spanning Trees | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 12 | Oct 24 | Recurrences | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | |||
Lecture 13 | Oct 26 | Divide and Conquer | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | Activitiy summary | |
Lecture 14 | Oct 28 | Divide and Conquer, FFT | Guruswami | ||||||||
Lecture 15 | Oct 31 | Dynamic Programming | Karlin | ||||||||
Lecture 16 | Nov 2 | Dynamic Programming | Karlin | ||||||||
Lecture 17 | Nov 4 | Subset Sum, FFT | Guruswami | ||||||||
Lecture 18 | Nov 7 | Dynamic Programming | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 19 | Nov 9 | Longest Common Subsequence | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | Activitiy summary | |
Lecture 20 | Nov 14 | Memory Efficient LCS | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | |||
Lecture 21 | Nov 16 | Shortest Paths | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 22 | Nov 18 | Network Flow | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | Activitiy summary | ||
Lecture 23 | Nov 21 | Network Flow | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | Activitiy summary | ||
Lecture 24 | Nov 23 | Maxflow-Mincut Theorem | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | |||
Lecture 25 | Nov 28 | Netflow Applications | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | ||
Lecture 26 | Nov 30 | Open Pit Mining | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Lecture Notes | Playback | Activitiy summary | |
Lecture 27 | Dec 2 | Netflow Applications | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | |||
Lecture 28 | Dec 5 | NP-Completeness | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | |||
Lecture 29 | Dec 7 | NP-Completeness | Anderson | PPT | Slides with Ink | CSD | CSD with Ink | Playback | |||
Lecture 30 | Dec 9 | NP-Completeness | Anderson | PPT | Slides with Ink | CSD | CSD with Ink |
Lecture 1 | Jan 3 | Introduction and Stable Matching | Anderson | PPT | Slides with Ink | CSD | CSD with ink | Playback | |
Lecture 2 | Jan 5 | Stable Matching | Anderson | PPT | Slides with Ink | CSD | CSD with ink | Playback |
This page has the lecture slides in various formats from the class - for the slides, the PowerPoint and PDF versions of the handouts are available. I am using Classroom Presenter as a presentation tool, so I am making slides available in Classroom Presenter format (CSD Files). Both the files before, and after class are available. These files can be viewed by installing Classroom Presenter on a Windows XP machine (not just on a Tablet PC). Some of the slides with writing will also made availabe as HTML. My handwritten notes from lecture preparation, viewable with Windows Journal Viewer are also available (although I can't imagine they will be of much use).
Classroom Presenter is an on going research project. One of the things we are doing is to develop a new version of Classroom Presenter (CP 3.0), so some lectures will be available as CP3 files. The CP3 format may change - so viewing the file may require having the appropriate verison of CP3 installed. Classroom Presenter Playback files may be played with PresenterPlayback. Use the > button to start the playback, the S> button advances to the next ink stroke.