WORK SCHEDULE FOR CS 4440 -- Spring 2022

• The first day of university classes is Friday, January 28. 🌷
  
  There are two sections of Theory of Algorithms (CS 4440). Both meet on Tuesdays and Thursdays. The first class meeting is on Tuesday, Feb 01.
  
  🌸 Section 002 (the 11:00 class) meets from 11:00 to 12:15,
  online starting Tuesday, Feb 01,
  and in in Bizzini 208 when we transition to face-to-face instruction
  (currently scheduled to begin Tuesday, Feb 15, 2022).
  
  🌺 Section 001 (the 12:30 class) meets from 12:30 to 13:45,
  online starting Tuesday, Feb 01,
  and in in Bizzini 208 when we transition to face-to-face instruction
  (currently scheduled to begin Tuesday, Feb 15, 2022).
  
  
• Reading Assignment:
  • Read the course description & this schedule (important!!)
  • Study: Kleinberg-Tardos sections 1.1 and 1.2
  
  
• Lecture Topics for next week (screencasts already available):
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Screencasts and Notes on the Stable Matching Problem
  • Five Representative Problems
  • Screencasts and Notes on the Five Representative Problems
  
  
• 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.

• Reading Assignment:
  • Read the course description & this schedule (important!!)
  • Study: Kleinberg-Tardos sections 1.1 and 1.2
  
  
• Lecture Topics for this week:
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Screencasts and Notes on the Stable Matching Problem
  • Five Representative Problems
  • Screencasts and Notes on the Five Representative Problems
  
  
• Administrative Tasks for The First Few Days of Class:
  • Roll check
  • Prerequisite checks, drops, adds

• Reading Assignment:
  • Skim: chapter 1 solved exercises
  • Study: section 4.1
  
  
• Lecture Topics:
  • Stable Matching Problem and the Gale-Shapley Algorithm
  • Five Representative Problems
  • Screencasts and Notes on the Five Representative Problems
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals
  • Screencasts and Notes on Greedy Algorithms
  
  
• PRACTICE FOR QUIZ PROBLEM:
  Due Tuesday, Feb 08 -
  Due Thursday, Feb 10 -
  for participation credit, turn in a solution to this exercise on the Stable Matching Problem.

• Tuesday, Feb 15: discuss the solution to the Stable Matching practice problem
  
  
• Reading Assignment:
  • Study: section 4.2
  
  
• Lecture Topics:
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals
  • Greedy Algorithm: Scheduling to Minimize Lateness
  • Screencasts and Notes on Greedy Algorithms
  
  
• I moved the due date on this problem back to Tuesday, Feb 22
  PRACTICE FOR QUIZ PROBLEM: Due Thursday, Feb 17, for participation credit, turn in a solution to this exercise on the Interval Scheduling Problem and Scheduling All Intervals Problem

• PRACTICE FOR QUIZ PROBLEM: Due Tuesday, Feb 22, for participation credit, turn in a solution to this exercise on the Interval Scheduling Problem and Scheduling All Intervals Problem
  
  
• Thursday, Feb 24: discuss the solution to the practice problems on Interval Scheduling and Interval Partitioning.
  
  
• Reading Assignment:
  • Study: sections 4.4 and 4.5
  
  
• Lecture Topics:
  • Dijkstra's (greedy) algorithm for single-source, all nodes, shortest paths
  • Screencasts and Notes on Greedy Algorithms

• 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: Due Thursday, Mar 03, for participation credit, turn in a solution to this exercise on Dijkstra's Algorithm.

• Reading Assignment:
  • Study: sections 5.1 and 5.2
  
  
• Lecture Topics:
  • Finish up with Kruskal's (greedy) algorithm for finding a minimum cost spanning tree, and the proof that Kruskal's algorithm works.
  • Screencasts and Notes on Greedy Algorithms
  
  
• Problem Session for QUIZ #1: Tuesday, March 08, on:
  • Chapters 1 and 4 (sections 1.1, 1.2, 4.1, 4.2, and 4.4)
  
  
• QUIZ #1: 🌷
  Thursday, March 10, on:
  • Material on Chapters 1 and 4 (sections 1.1, 1.2, 4.1, 4.2, 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.

• Reading Assignment:
  • Study: sections 5.3 and 5.5
  • Skim: section 5.4 and chapter 5 solved exercises
  
  
• Lecture Topics:
  • Prim's (greedy) for finding a minimum cost spanning tree
  • Union-Find data structure for implementing Kruskal's algorithm
  • Screencasts and Notes on Greedy Algorithms
  • Divide and Conquer - Merge Sort
  • Recurrence Relations
  • Counting Inversions
  • Closest Pair of Points
  • Integer Multiplication
  • Matrix Multiplication
  • Screencasts and Notes on Divide and Conquer

• Reading Assignment:
  • Study: sections 6.1, 6.2, and 6.4
  
  
• Lecture Topics:
  • Dynamic Programming
  • Screencasts and Notes on Dynamic Programming
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Tuesday, Mar 22, for participation credit, turn in a solution to this exercise on Minimum Cost Spanning Tree Problems.

• Reading Assignment:
  • Study: sections 6.6 and 6.7
  
  
• Lecture Topics:
  • Dynamic Programming
  • The Knapsack Problem
  • The Sequence Alignment Problem
  • Screencasts and Notes on Dynamic Programming
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Thursday, Apr 7, for participation credit, turn in a solution to this exercise on The Counting Inversions Problem.

• Reading Assignment:
  • Skim: chapter 6 solved exercises
  • Study: section 7.1
  
  
• Lecture Topics:
  • Chapters 6 and 7
  • Sequence Alignment in Linear Space [6.7]
  • Screencasts and Notes on Dynamic Programming
  • Flow Networks, Max Flows, and Min Cuts [7.1-7.2]
  • The Ford-Fulkerson Algorithm for Calculating Max Flow / Min Cut [7.1-7.2]
  • Screencasts and Notes on Network Flow
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Thursday, Apr 14, for participation credit, turn in a solution to this exercise on The Weighted Intervals Scheduling Problem

• Reading Assignment:
  • Study: sections 7.2 and 7.3
  
  
• Lecture Topics:
  • Sections 7.2 and 7.3
  • The Max-Flow, Min-Cut Theorem and the Efficiency of the Ford-Fulkerson Algorithm [7.2]
  • Better Augmenting Paths and An Efficient Version of the Ford-Fulkerson Algorithm [7.3]
  • Screencasts and Notes on Network Flow
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Thursday, Apr 21, for participation credit, turn in a solution to this exercise on The Knapsack Problem.

• 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: Due Thursday, Apr 28, for participation credit, turn in a solution to this exercise on The Max Flow, Min Cut Problem.

• Reading Assignment:
  • Study: section 7.9
  • Skim: sections 7.10, 7.12, and the chapter 7 solved exercises
  
  
• Lecture Topics:
  • Survey Design and Airline Scheduling [7.8-7.9]
  • Image Segmentation [7.10]
  • Baseball Elimination [7.12]
  • Screencasts and Notes on Network Flow
  
  
• Problem Session for QUIZ #2: Tuesday, May 03, 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 05 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
  
  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.

• Go over quiz #2. Tuesday, May 10 🌷
  
  
• Friday, May 13 is Warrior Day. No afternoon classes meet on that day.
  
  
• Reading Assignment:
  • Study: sections 8.1, 8.2, and 8.3
  
  
• Lecture Topics:
  • Introduction to Reduction [8.1]
  • Reduction by Simple Equivalence and Reduction from Special Case to General Case [8.1]
  • Screencasts and Notes on NP and Computational Intractability

• Tuesday May 17 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