WARNING: This is only a tentative schedule. Everything here is subject to change.
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 -- 2023/04/24)
[2023/04/24: corrected a typo in the due date for HW problem #8 (May 2 is a Tuesday, not a Thursday)]
[2023/04/09: moved back due dates for HW #6-8]
[2023/04/09: minor format changes]
[2023/03/03: updates to what to bring on test days]
[2022/12/27: initial work]
WORK SCHEDULE FOR CS 4440 -- Spring 2023
WEEK #1: Thursday-Friday, Jan 26-27
The first day of CS 4440 classes is
Thursday, January 26. 🌷
There are two sections of Theory
of Algorithms (CS 4440). Both meet on Tuesdays and Thursdays.
🌸
Section 002 (the eleven o'clock class)
meets from 11:00 to 12:15, in Bizzini 210
🌺
Section 001 (the two o'clock class)
meets from 14:00 to 15:15, in Bizzini 103.
- Reading Assignment:
- Read the
course description
& this schedule (important!!)
- Study: Kleinberg-Tardos sections 1.1 and 1.2
- Lecture Topics:
- On average, expect you'll have to cover about thirteen pages per
week in our text book: "Kleinberg-Tardos". I'll tell you to just
'skim' about 15% of the reading. You'll need to
study the other 85% very thoroughly.
WEEK #2: Monday, Jan 30 to Friday, Feb 03
- Reading Assignment:
- Read the
course description
& this schedule (important!!)
- Study: Kleinberg-Tardos sections 1.1 and 1.2
- Lecture Topics for this week:
- Administrative Tasks for The First Few Days of Class:
- Roll check
- Prerequisite checks, drops, adds
♭ ♬
WEEK #3: Monday, Feb 06 to Friday, Feb 10
- Reading Assignment:
- Skim: chapter 1 solved exercises
- Study: section 4.1
- Lecture Topics:
- PRACTICE FOR QUIZ PROBLEM #1:
Due Thursday, Feb 09 -
for participation credit, turn in a solution to
this exercise on the Stable Matching
Problem.
WEEK #4: Monday, Feb 13 to Friday, Feb 17
- Tuesday, Feb 14: discuss the solution
to the Stable Matching practice problem
- Reading Assignment:
- Lecture Topics:
WEEK #5: Monday, Feb 20 to Friday, Feb 24
⚜
WEEK #6: Monday, Feb 27 to Friday, Mar 03
- Reading Assignment:
- Study: section 4.6
- Skim: chapter 4 solved exercises
- Lecture Topics:
- Finish up Dijkstra's (greedy) algorithm for single-source,
all nodes, shortest paths
- Take questions on solutions to the first and second homework problems.
- Kruskal's (greedy) algorithm for finding a minimum cost spanning tree
- PRACTICE FOR QUIZ PROBLEM #3: Due Thursday, Mar 02,
for participation credit, turn in a solution to
this exercise on Dijkstra's Algorithm.
WEEK #7: Monday, Mar 06 to Friday, Mar 10
- Reading Assignment:
- Study: sections 5.1 and 5.2
- Lecture Topics:
- Problem Session for QUIZ #1:
Tuesday, March 07, on:
- Chapters 1 and 4 (sections 1.1, 1.2, 4.1, 4.2, and 4.4)
- QUIZ #1: 🌷
Thursday, March 09, on:
- Material on Chapters 1 and 4 (sections 1.1, 1.2, 4.1, 4.2, and 4.4)
With you, bring
- a photo ID (Details);
-
a Scantron 882-E form (The 882-E forms are long forms with room for
50 answers on each side, and they are sold in the University
bookstore.);
- a #2 pencil; and
- an eraser.
You may need scratch paper for doing some calculations.
I will provide that during test time.
WEEK #8: Monday, Mar 13 to Friday, Mar 17
- Reading Assignment:
- Study: sections 5.3 and 5.5
- Skim: section 5.4 and chapter 5 solved exercises
- Lecture Topics:
☘
WEEK #9: Monday, Mar 20 to Friday, Mar 24
Monday, March 20
春
WEEK #10: Monday, Mar 27 to Thursday, Mar 30
SPRING BREAK: Saturday, April 1 - Sunday, April 9
WEEK #11: Monday, Apr 10 to Friday, Apr 14
- Reading Assignment:
- Skim: chapter 6 solved exercises
- Study: section 7.1
- Lecture Topics:
WEEK #12: Monday, Apr 17 to Friday, Apr 21
WEEK #13: Monday, Apr 24 to Friday, Apr 28
- Reading Assignment:
- Study: section 7.5
- Skim: section 7.7
- Study: section 7.8
- Lecture Topics:
- The Bipartite Matching Problem, Part I [7.5]
- The Bipartite Matching Problem, Part II [7.5]
- Extensions to the Maximum Flow Problem [7.7]
- Survey Design and Airline Scheduling [7.8-7.9]
-
Screencasts and Notes on Network Flow
- PRACTICE FOR QUIZ PROBLEM #7: Due Tuesday, Apr 25,
for participation credit, turn in a solution to
this exercise on The Knapsack
Problem.
WEEK #14: Monday, May 01 to Friday, May 05
- Reading Assignment:
- Study: section 7.9
- Skim: sections 7.10, 7.12, and the chapter 7 solved exercises
- Lecture Topics:
- PRACTICE FOR QUIZ PROBLEM #8: Due Tuesday, May 2,
for participation credit, turn in a solution to
this exercise on The Max Flow, Min Cut
Problem before the start of class time.
(Place it on the "counter" in front of me as you enter
class.)
- Problem Session for QUIZ #2:
Tuesday, May 02, on:
- Material in sections 4.5, 4.6, 5.1, 5.2, 5.3,
5.4, 5.5, 6.1, 6.2, 6.4, 6.6, 6.7 7.1, and 7.2
-
QUIZ #2: 🌷
Thursday, May 04 on:
- Material in sections 4.5, 4.6, 5.1, 5.2, 5.3,
5.4, 5.5, 6.1, 6.2, 6.4, 6.6, 6.7 7.1, and 7.2
With you, bring
- a photo ID (Details);
-
a Scantron 882-E form (The 882-E forms are long forms with room for
50 answers on each side, and they are sold in the University
bookstore.);
- a #2 pencil; and
- an eraser.
You may need scratch paper for doing some calculations.
I will provide that during test time.
WEEK #15: Monday, May 08 to Thursday, May 11
- Go over quiz #2. Tuesday, May 09 🌷
- Friday, May 12 is Warrior Day.
No afternoon classes meet on that day.
- Reading Assignment:
- Study: sections 8.1, 8.2, and 8.3
- Lecture Topics:
WEEK #16: Monday, May 15 to Tuesday, May 16
- Tuesday May 16 is the last day of class 🌷 for the university.
- Reading Assignment:
- Study: sections 8.4 and 8.5
- Catch Up!!
- Lecture Topics:
- Maybe sections 8.4 and 8.5
Finals Week Runs from Thursday, May 18 to Wednesday, May 24.
FINAL EXAMS: 🌷
Your final exam will be comprehensive of sections 1.1, 1.2, 4.1, 4.2, 4.4, 4.5, 4.6, 5.1, 5.2, 5.3, 5.5, 6.1, 6.2, 6.4, 6.6, 6.7, 7.1, 7.2, 8.1, 8.2, 8.3, and 8.4.
🌸 The final exam for section 002 (the 11:00 class) of Theory of Algorithms (CS 4440) is scheduled for Thursday, May 18, 2023 from 11:15 to 13:15.
The exam is currently scheduled to be in the regular classroom: B-210.
🌺 The final exam for section 001 (the 2:00 class) of Theory of Algorithms (CS 4440) is scheduled for
Thursday, May 18, 2023 from 14:00 to 16:00.
The exam is currently scheduled to be in the regular classroom: B-103.
With you, bring
- a photo ID (Details);
-
a Scantron 882-E form (The 882-E forms are long forms with room for
50 answers on each side, and they are sold in the University
bookstore.);
- a #2 pencil; and
- an eraser.
You may need scratch paper for doing some calculations.
I will provide that during test time.