cs 4440 schedule

WARNING: All future events in this schedule are subject to being changed.

I will make additions and changes as the semester progresses. Keep checking the class web space to see the latest version.

(Are you looking at a stale web page? Try refreshing your browser.)

(Latest Revision -- 2017/11/26)
[2017/11/26: cancelled quiz #3]
[2017/10/23: changed coverage on Quiz #2]
[2017/09/26: clarified coverage on Quiz #1]
[2017/08/08: initial work]

WORK SCHEDULE FOR CS 4440 -- Fall 2017

WEEK #1: Wed Aug 23 - Fri Aug 25

🍂 First day of university classes is Wednesday, August 23.

All students should have an account on the Computer Science Department Laboratory Network. Let me know immediately if you don't have one, or if you need a new password on your existing account.
Figure on having to cover an average of close to 19 pages per week in our text book: "Kleinberg-Tardos".
Reading Assignment:
- Read the course description & this schedule (important!!)
- Kleinberg-Tardos: chapter 1, plus chapter 1 solved exercises
Possible Lecture Topics:
- The Stable Matching Problem & The Gale-Shapley Algorithm
- Five Representative Problems

WEEK #2: Mon Aug 28 - Fri Sep 01

Reading Assignment:
- Kleinberg-Tardos: sections 4.1-4.2
Possible Lecture Topics:
- The Stable Matching Problem & The Gale-Shapley Algorithm
- Five Representative Problems

WEEK #3: Tues Sep 5 - Fri Sep 8

No Classes Monday, Sep 4 --> Labor Day Holiday
Reading Assignment:
- Kleinberg-Tardos: sections 4.4-4.6
Possible Lecture Topics:
- Greedy Algorithm: Interval Scheduling
- Greedy Algorithm: Scheduling All Intervals
- Greedy Algorithm: Scheduling to Minimize Lateness

WEEK #4: Mon Sep 11 - Fri Sep 15

Reading Assignment:
- Kleinberg-Tardos: ch 4 solved exercises, sections 5.1-5.2
Possible Lecture Topics:
- Dijkstra's (greedy) algorithm for single-source, all nodes, shortest paths.
- Kruskal's (greedy) for finding a minimum cost spanning tree

WEEK #5: Mon Sep 18 - Fri Sep 22

Reading Assignment:
- Kleinberg-Tardos: sections 5.3-5.4, ch 5 solved exercises
Possible Lecture Topics:
- Prim's (greedy) for finding a minimum cost spanning tree
- Union-Find data structure for implementing Kruskal's algorithm
- Divide and Conquer - Merge Sort
秋
Friday, Sept 22: Equinox - autumn begins in the Northern Hemisphere.

WEEK #6: Mon Sep 25 - Fri Sep 29

Reading Assignment:
- Kleinberg-Tardos: sections 6.1-6.4
Problem Session for QUIZ #1: Wednesday, Sep 27 on:
- Chapters 1 and 4
🍂 QUIZ #1: Friday, Sep 29 on:
- Material on Chapters 1 and 4 - specifically sections 1.1, 1.2, 4.1, 4.2, 4.3, and 4.4
- Bring with you a #2 pencil, an eraser, and a Scantron 882-E form (the LONG form). The 882-E forms are sold in the bookstore.
Possible Lecture Topics:
- (TBA)

WEEK #7: Mon Oct 2 - Fri Oct 6

Reading Assignment:
- Kleinberg-Tardos: sections 6.6-6.8
Possible Lecture Topics:
- (TBA)

WEEK #8: Mon Oct 9, Tues Oct 10, Thu Oct 12, Fri Oct 13

No Classes Wednesday, Oct 11 --> non-Instructional Day
Reading Assignment:
- Kleinberg-Tardos: ch 6 solved exercises, section 7.1
Possible Lecture Topics:
- (TBA)

WEEK #9: Mon Oct 16 - Fri Oct 20

Reading Assignment:
- Kleinberg-Tardos: sections 7.2-7.3
Possible Lecture Topics:
- (TBA)

WEEK #10: Mon Oct 23 - Fri Oct 27

Reading Assignment:
- Kleinberg-Tardos: sections 7.5, 7.7-7.8
Possible Lecture Topics:
- Shortest Paths in a Graph (Bellman-Ford Algorithm)
- Homework Problems
- Network Flow

WEEK #11: Mon Oct 30 - Fri Nov 03

Reading Assignment:
- Kleinberg-Tardos: sections 7.9, ch 7 solved exercises
🍂 QUIZ #2: Friday, Nov 3 on:
- Material in sections 4.5-4.6, 5.1-5.4, and 6.1-6.4.
- Bring with you a #2 pencil, an eraser, and a Scantron 882-E form (the LONG form). The 882-E forms are sold in the bookstore.
Possible Lecture Topics:
- (TBA)

WEEK #12: Mon Nov 6 - Thurs Nov 9

No Classes Friday, Nov 10 --> Veteran's Day Observed
Reading Assignment:
- Kleinberg-Tardos: sections 8.1-8.3
Possible Lecture Topics:
- (TBA)

WEEK #13: Mon Nov 13 - Fri Nov 17

Reading Assignment:
- Kleinberg-Tardos: sections 8.4-8.5
Possible Lecture Topics:
- (TBA)

WEEK #14: Mon Nov 20 - Wed Nov 22

No Classes Thursday, Nov 23 --> Thanksgiving Holiday
No Classes Friday, Nov 24 --> Admission Day Observed
Reading Assignment:
- Kleinberg-Tardos: finish 8.1-8.5, ch 8 solved exercises
Possible Lecture Topics:
- (TBA)

WEEK #15: Mon Nov 27 - Fri Dec 01

Reading Assignment:
- Kleinberg-Tardos: sections 8.8-8.10, ch 8 solved exercises, section 9.1
🍂 QUIZ #3: Friday, Dec 01 on:

Material in sections

6.3 (Segmented Least Squares),
6.4 (Subset Sums & Knapsacks),
6.6 (Sequence Alignment),
7.1 (The Max Flow Problem & The Ford-Fulkerson Algorithm),
7.2 (Max Flows & Min Cuts),
7.3 (Choosing Good Augmenting Paths), and
7.5 (The Bipartite Matching Problem)
Possibly other material (TBA)

Bring with you a #2 pencil, an eraser, and a Scantron 882-E form (the LONG form). The 882-E forms are sold in the bookstore.
Possible Lecture Topics:
- (TBA)

WEEK #16: Mon Dec 4 - Fri Dec 8

Reading Assignment:
- Kleinberg-Tardos: (TBA)
Possible Lecture Topics:
- (TBA)

WEEK #17: Mon Dec 11

Reading Assignment:
- Kleinberg-Tardos: (TBA)
Possible Lecture Topics:
- (TBA)

🍂 FINAL EXAM:
The CS 4440 Theory of Algorithms final exam is scheduled for
Monday, December 18 from 11:15 to 13:15 (11:15 a.m. to 1:15 p.m.). The exam is currently scheduled to be in the regular classroom: P-100.

Bring a #2 pencil and a Scantron 882-E form (the LONG form this time). The 882-E forms are sold in the bookstore.