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 -- 2018/05/05)
[2018/05/05: schedule changes for Warrior Day]
[2018/04/10: moved back Quiz #2]
[2018/01/25: initial work]
WORK SCHEDULE FOR CS 4440 -- Spring 2018
WEEK #1: Th-F, Jan 25 - Jan 26
🌷 First day of university classes is
Friday, January 26.
We meet on Mondays, Wednesdays, and Fridays.
Class meets in room P-101 from 15:00 to 15:50
(3:00 p.m. to 3:50 p.m.).
- Administrative Tasks for The First Few Days of Class:
- Roll check
- Prerequisite checks, drops, adds
- Day Two or Three: Handout of computer account info
(login name & password) to class members who need them.
- 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: Jan 29 - Feb 02
- Reading Assignment:
- Kleinberg-Tardos: sections 4.1-4.2
- Follow up on Class Administrative Tasks
- Possible Lecture Topics:
- The Stable Matching Problem & The Gale-Shapley Algorithm
- Five Representative Problems
- ♭ ♬
WEEK #3: Feb 05 - Feb 09
- 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: Feb 12 - Feb 16
- 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
- Tuesday, February 13 (Mardi Gras): ⚜
WEEK #5: Feb 19 - Feb 23
- 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
WEEK #6: Feb 26 - Mar 02
- Reading Assignment:
- Kleinberg-Tardos: sections 6.1-6.4
- Problem Session for QUIZ #1:
Wednesday, February 28 on:
🌷 QUIZ #1:
Friday, March 02 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:
WEEK #7: Mar 05 - Mar 09
- Reading Assignment:
- Kleinberg-Tardos: sections 6.6-6.8
- Possible Lecture Topics:
WEEK #8: Mar 12 - Mar 16
- Reading Assignment:
- Kleinberg-Tardos: ch 6 solved exercises,
section 7.1
- Possible Lecture Topics:
- March 17:
☘
WEEK #9: Mar 19 - Mar 23
- Reading Assignment:
- Kleinberg-Tardos: sections 7.2-7.3
- Possible Lecture Topics:
- March 20:
春
WEEK #10: M-Th, Mar 26 - Mar 29
- No Classes Friday, March 30 (Cesar Chavez Holiday)
- 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
SPRING BREAK: Mar 31 - Apr 08
WEEK #11: Apr 09 - Apr 13
- Reading Assignment:
- Kleinberg-Tardos: sections 7.9, ch 7 solved exercises
- Problem Session for QUIZ #2:
Wednesday, April 11
Friday, April 13
on:
- Sections in chapters 4 - 6
🌷 QUIZ #2:
Friday, April 13 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:
WEEK #12: Apr 16 - Apr 20
🌷 QUIZ #2:
Monday, April 16 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.
- Reading Assignment:
- Kleinberg-Tardos: sections 8.1-8.3
- Possible Lecture Topics:
WEEK #13: Apr 23 - Apr 27
- Reading Assignment:
- Kleinberg-Tardos: sections 8.4-8.5
- Possible Lecture Topics:
WEEK #14: Apr 30 - May 04
- Reading Assignment:
- Kleinberg-Tardos: finish 8.1-8.5, ch 8 solved exercises
- Possible Lecture Topics:
WEEK #15: May 07 - May 11
- Reading Assignment:
- Kleinberg-Tardos: sections 8.8-8.10, ch 8 solved exercises,
section 9.1
- Problem Session for QUIZ #3:
Wednesday, May 09 on:
- Sections in chapters 6 - 7
- Friday, May 11 is Warrior Day. No class on this day
- Possible Lecture Topics:
WEEK #16: M-W, May 14 - May 16
🌷 Wednesday May 16 is the last day
of class for the university.
🌷 QUIZ #3:
Monday, May 14 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.
- Reading Assignment:
- Possible Lecture Topics:
🌷
FINAL EXAM:
The CS 4440 Theory of Algorithms final exam is scheduled for
Monday, May 21, 2018 from 14:00 to 16:00 (2:00 p.m. to 4:00 p.m.).
The exam is currently scheduled to be in the regular classroom: P-101.
Bring a #2 pencil and
a Scantron 882-E form (the LONG form this time).
The 882-E forms are sold in the bookstore.