Fall 2014 schedule (Previous schedules: 2009, 2010, 2011, 2012, 2013).
| Date | Topic | Notes |
| Mon, Aug 25 | Introduction (Slides) | (HW 0 out) |
| Wed, Aug 27 | More "pep" talk (Slides) | |
| Fri, Aug 29 | Main Steps in Algorithm Design (Slides, Notes) | [KT, Sec 1.1] (HW 0 in) |
| Mon, Sep 1 | No Class | Labor Day |
| Wed, Sep 3 | Stable Matching Problem (Slides, Notes) | [KT, Sec 1.1] |
| Fri, Sep 5 | Gale-Shapley Algorithm (Slides, Notes) | [KT, Sec 1.1] (HW 1 out) |
| Mon, Sep 8 | The Gale-Shapley Algorithm Terminates (Slides, Notes) | [KT, Sec 1.1] |
| Wed, Sep 10 | Correctness of the Gale-Shapley Algorithm ([Slides: PPT, PDF]; Notes) | [KT, Sec 1.1] Reading Assignment: [KT Sec 1.1, 1.2] |
| Fri, Sep 12 | Asymptotic Analysis ([Slides: PPT, PDF]; Notes, Supplementary Notes] | [KT, Sec 2.1, 2.2] (HW 1 in, HW 2 out) Reading Assignment: [KT, Sec 2.2, 2.4] |
| Mon, Sep 15 | Run time Analysis of the Gale-Shapley Algorithm ([Slides: PPT, PDF], Notes) | [KT, Sec 2.3] |
| Wed, Sep 17 | Run time Analysis of the Gale-Shapley Algorithm- II ([Slides: PPT, PDF], Notes, Supplementary notes) | [KT, Sec 2.3, 3.1] Reading Assignment: [KT, Sec 2.5] |
| Fri, Sep 19 | Graph Basics and Trees ([Slides: PPT, PDF], Notes) | [KT, Sec 3.1] (HW 2 in, HW 3 out) |
| Mon, Sep 22 | Breadth First Search ([Slides: PPT, PDF], Notes) | Guest Lecture by Andrew Hughes [KT, Sec 3.2] |
| Wed, Sep 24 | Computing Connected Components ([Slides: PPT, PDF], Notes) | Guest Lecture by Andrew Hughes [KT, Sec 3.2] |
| Fri, Sep 26 | Implementation of BFS ([Slides: PPT, PDF], Notes) | Guest lecture by Andrew Hughes [KT, Sec 3.3] (HW 3 in, HW 4 out) |
| Mon, Sep 29 | Run time Analysis of BFS ([Slides: PPT, PDF], Notes) | [KT, Sec 3.3] Reading Assignment: [KT, Sec 3.3, 3.4, 3.5] |
| Wed, Oct 1 | Topological Ordering ([Slides: PPT, PDF], Notes) | [KT, Sec 3.6] |
| Fri, Oct 3 | Analyzing TopOrd ([Slides: PPT, PDF], Notes) | [KT, Sec 3.6] (HW 4 in, HW 5 out) |
| Mon, Oct 6 | Interval Scheduling Problem ([Slides: PPT, PDF], Notes) | [KT, Sec 4.1] |
| Wed, Oct 8 | Greedy Algorithm for Interval Scheduling ([Slides: PPT, PDF], Notes) | ([KT, Sec 4.1] Team Composition Due) Reading Assignment: [KT, Sec 4.1] |
| Fri, Oct 10 | Scheduling to Minimize Maximum Lateness ([Slides: PPT, PDF], Notes) | [KT, Sec 4.2] ( HW 5 in) |
| Mon, Oct 13 | Greedy Algorithm for Scheduling to Minimize Lateness ([Slides:PPT, PDF], Notes) | [KT, Sec 4.2] (Quiz 1) |
| Wed, Oct 15 | The Exchange Argument ([Slides: PPT, PDF], Notes) | [KT, Sec 4.2] |
| Fri, Oct 17 | Shortest Path Problem ([Slides: PPT, PDF], Notes) | [KT, Sec 4.4] |
| Mon, Oct 20 | Mid-term exam: I | |
| Wed, Oct 22 | Mid-term exam: II | |
| Fri, Oct 24 | Dijkstra's Algorithm ([Slides: PPT, PDF], Notes) | [KT, Sec 4.4] (HW 6 out) |
| Mon, Oct 27 | Minimum Spanning Tree Problem ([Slides: PPT, PDF], Notes) | [KT, Sec 4.5] Reading Assignment [KT, Sec 4.4] |
| Wed, Oct 29 | Cut Property Lemma ([Slides: PPT, PDF], Notes) | [KT, Sec 4.5] |
| Fri, Oct 31 | Divide and Conquer Algorithms ([Slides: PPT, PDF], Notes) | [KT, Sec 4.5, 5.1] (HW 6 in, HW 7 out) Reading Assgnment [KT, Sec 4.5, 4.6] |
| Mon, Nov 3 | Analyzing the Mergesort Algorithm ([Slides: PPT, PDF], Notes) | [KT, Sec 5.1] Reading Assignment [KT, Sec 5.2] |
| Wed, Nov 5 | Multiplying Two Integers ([Slides: PPT, PDF], Notes) | [KT, Sec 5.5](Report Due) |
| Fri, Nov 7 | Counting Inversions ([Slides: PPT, PDF], Notes) | [KT, Sec 5.3] (HW 7 in, HW 8 out) |
| Mon, Nov 10 | Closest Pair of Points ([Slides: PPT, PDF], Notes) | [KT, Sec 5.4] |
| Wed, Nov 12 | Kickass Property Lemma ([Slides: PPT, PDF], Notes) | [KT, Sec 5.4] |
| Fri, Nov 14 | Weighted Interval Scheduling ([Slides: PPT, PDF], Notes) | [KT, Sec 6.1] (HW 8 in, HW 9 out) |
| Mon, Nov 17 | Dyanamic Program for Weighted Interval Scheduling ([Slides: PPT, PDF], Notes) | [KT, Sec 6.1, 6.2] |
| Wed, Nov 19 | Shortest Path Problem ([Slides: PPT, PDF], Notes) | [KT, Sec 6.8] |
| Fri, Nov 21 | No class (Snow day) | (HW 10 out) |
| Mon, Nov 24 | Bellman-Ford Algorithm ([Slides: PPT, PDF], Notes) | [KT, Sec 6.8] (HW 9 in) Reading Assignment: [KT, Sec 6.8] |
| Wed, Nov 26 | No Class | Fall Recess |
| Fri, Nov 28 | No Class | Fall Recess |
| Mon, Dec 1 | Wrapup ([Slides: PPT, PDF]) | (Quiz 2) |
| Wed, Dec 3 | Presentations | |
| Fri, Dec 5 | Presentations | (HW 10 in) |