WORK SCHEDULE FOR CS 4440 -- Spring 2021

The first day of university classes is Thursday, January 28. 🌷

There are two sections of Theory of Algorithms (CS 4440). Both meet on Tuesdays and Thursdays. The first class meeting is on Thursday, January 28.

🌸 Section 001 (the 11:00 class) meets from 11:00 to 12:15 in DBH-101 (aka P-101)

🌺 Section 002 (the 12:30 class) meets from 12:30 to 13:45 in DBH-101 (aka P-101)


• 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
  • 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.
  
  
• 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
  
  
• Follow up on Class Administrative Tasks
  
  
• No Office Hour on Friday, Feb 5
  I won't be available during the scheduled office hour time of 15:00-16:00 (3:00-4:00) on Friday. If you want something, please send me a message and I'll get back to you as soon as I can.

• Reading Assignment:
  • Skim: chapter 1 solved exercises
  • Study: section 4.1
  
  
• Lecture Topics:
  • 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 09 - for participation credit, turn in a solution to this exercise on the Stable Matching Problem before the start of class time.
  (Just place it on the "counter" in front of me as you enter class. )

• 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
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Thursday, Feb 18, for participation credit, turn in a solution to this exercise on the Interval Scheduling Problem and Scheduling All Intervals Problem before the start of class time.
  (Place it on the "counter" in front of me as you enter class.)

• I won't be available during the office hour on Wednesday, Feb 24, but I WILL be available most of that day.
• I won't be available during the office hour on Thursday, Feb 25, and I WILL NOT be available most of that day.
  
  
• We have Zoom meeting, Tuesday, Feb 23, to discuss the solution to the practice problem
  
  
• Census Date is Wednesday, February 24.
  
  
• Reading Assignment:
  • Study: sections 4.4 and 4.5
  
  
• Lecture Topics:
  • Dijkstra's (greedy) algorithm for single-source, all nodes, shortest paths
  • Kruskal's (greedy) algorithm for finding a minimum cost spanning tree
  • Screencasts and Notes on Greedy Algorithms

• I probably won't be able to answer e-mail all day Friday, March 5, but I'll be around on Thursday and also over the weekend.
  
  
• Reading Assignment:
  • Study: section 4.6
  • Skim: chapter 4 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
  • Screencasts and Notes on Divide and Conquer
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Thursday, Mar 04, for participation credit, turn in a solution to this exercise on Dijkstra's Algorithm before the start of class time.
  (Place it on the "counter" in front of me as you enter class. Your paper(s) must be 8.5 X 11 inches, with neatly cut edges only. If you use multiple pages, staple them together.)

• Reading Assignment:
  • Study: sections 5.1 and 5.2
  
  
• Lecture Topics:
  • Union-Find data structure for implementing Kruskal's algorithm
  • Screencasts and Notes on Greedy Algorithms
  • Divide and Conquer - Merge Sort
  • Recurrence Relations
  • Screencasts and Notes on Divide and Conquer
  
  
• Problem Session for QUIZ #1: Tuesday, March 09, on:
  • Chapters 1 and 4 (sections 1.1, 1.2, 4.1, 4.2, and 4.4)
  
  
• QUIZ #1: 🌷
  Thursday, March 11, 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:
  • Recurrence Relations
  • Counting Inversions
  • Closest Pair of Points
  • Integer Multiplication
  • Matrix Multiplication
  • Screencasts and Notes on Divide and Conquer
  
  
• PRACTICE FOR QUIZ PROBLEM: Due Thursday, Mar 18, for participation credit, turn in a solution to this exercise on Minimum Cost Spanning Tree Problems before the start of class time.
  (Place it on the "counter" in front of me as you enter class.)

• 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 Thursday, Mar 25, for participation credit, turn in a solution to this exercise on The Counting Inversions Problem before the start of class time.
  (Place it on the "counter" in front of me as you enter class.)

• No Classes Wednesday, Mar 31 (For the César Chávez Holiday)
  
  
• 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 01, for participation credit, turn in a solution to this exercise on The Weighted Intervals Scheduling Problem before the start of class time.
  (Place it on the "counter" in front of me as you enter class.)

• 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 15, for participation credit, turn in a solution to this exercise on The Knapsack Problem before the start of class time.
  (Place it on the "counter" in front of me as you enter class.)

• 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

• 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: Due Thursday, Apr 29, 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.)

• 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 04, on:
  • Material in sections 4.5, 4.6, 5.1, 5.2, 5.3, 5.4, 5.5, 6.1, 6.2, 7.1, and 7.2
  
  
• QUIZ #2: 🌷
  Thursday, May 06 on:
  • Material in sections 4.5, 4.6, 5.1, 5.2, 5.3, 5.4, 5.5, 6.1, 6.2, 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.

• We have a Zoom Meeting to go over quiz #2.
  • Tuesday, May 11 🌷
  
  
• Friday, May 14 is Warrior Day. No afternoon classes meet on this 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

• Wednesday May 19 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