WORK SCHEDULE FOR CS 4440 -- Spring 2020

The first day of university classes is Monday, January 27. 🌷

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

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

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


• 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
  
  
• Possible Lecture Topics for this week:
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Five Representative Problems

• Reading Assignment:
  • Skim: chapter 1 solved exercises
  • Study: section 4.1
  
  
• Follow up on Class Administrative Tasks
  
  
• Possible Lecture Topics:
  • Five Representative Problems
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals
  
  
• Office Hour Friday, Feb 07, from 3:00-4:00 is cancelled because a candidate for a faculty position in CS has recently been scheduled to give a talk during that time.
  
  
• ♭ ♬

• Thursday, Feb 13, for participation credit, turn in a solution to this exercise at 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
  
  
• Possible Lecture Topics:
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals
  • Greedy Algorithm: Scheduling to Minimize Lateness

• Reading Assignment:
  • Study: sections 4.4 and 4.5
  
  
• Possible Lecture Topics:
  • Dijkstra's (greedy) algorithm for single-source, all nodes, shortest paths
  • Kruskal's (greedy) algorithm for finding a minimum cost spanning tree

• Reading Assignment:
  • Study: section 4.6
  • Skim: chapter 4 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
  ⚜
  

• Reading Assignment:
  • Study: sections 5.1 and 5.2
  
  
• Tuesday, Mar 3, for participation credit, turn in a solution to this exercise at 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.)
  
  
• Thursday, Mar 5, for participation credit, turn in a solution to this exercise at 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.)
  
  
• Possible Lecture Topics:
  • Union-Find data structure for implementing Kruskal's algorithm
  • Divide and Conquer - Merge Sort

• Reading Assignment:
  • Study: sections 5.3 and 5.5
  • Skim: section 5.4 and chapter 5 solved exercises
  
  
• Problem Session for QUIZ #1: Tuesday, March 10, on:
  • Chapters 1 and 4 (sections 1.1, 1.2, 4.1, 4.2, and 4.4)
  
  
• QUIZ #1: 🌷
  Thursday, March 12, 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.
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Study: sections 6.1, 6.2, and 6.4
  
  
• Possible Lecture Topics:
  • (TBA)

• No Classes Tuesday, Mar 31 (For César Chávez Holiday)
  
  
• Due to the suspension of face-to-face classes, many details of this schedule have become subject to change. I am trying to arrange online testing. Watch for announcements concerning upcoming tests to be sent to the class mailing list: cs4440@cs.csustan.edu. Also, watch the mailing list for announcements about availability of screencast versions of lectures and discussion of solutions to homework problems. The schedule of readings remains unchanged, and my intention is to continue covering about three sections per week in (screencast) lectures.
  
  
• This week we try out sample testing. For the first test, use the Respondus LockDown Monitor to sign in to Blackboard and take the test. (See the directions in my message of April 1 to the class mailing list. The message was sent at about 1:30 in the afternoon.) Here is a link for downloading the LockDown Monitor
  
  
• Reading Assignment:
  • Study: sections 6.6 and 6.7
  
  
• Possible Lecture Topics:
  • Dynamic Programming
  • Screencast I on The Weighted Intervals Scheduling Problem
  • Screencast II on The Weighted Intervals Scheduling Problem -Examples
  • Screencast on The Knapsack Problem
  • Screencast on The Sequence Alignment Problem

• Reading Assignment:
  • Skim: chapter 6 solved exercises
  • Study: section 7.1
  
  
• Possible Lecture Topics:
  • Chapters 6 and 7
  • Screencast on Sequence Alignment in Linear Space
  • Screencast on Flow Networks, Max Flows, and Min Cuts
  • Screencast on The Ford-Fulkerson Algorithm for Calculating Max Flow / Min Cut
  
  
• TENTATIVE DATE: Problem Session for QUIZ #2: Tuesday, April 07 on:
  • Material in chapters and sections (TBA)
  
  
• TENTATIVE DATE: QUIZ #2: 🌷
  Thursday, April 09 on:
  • Material in chapters and sections (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:
  • Study: sections 7.2 and 7.3
  
  
• Possible Lecture Topics:
  • Sections 7.2 and 7.3
  • Screencast on The Max-Flow, Min-Cut Theorem and the Efficiency of the Ford-Fulkerson Algorithm [7.2]
  • Screencast on Better Augmenting Paths and An Efficient Version of the Ford-Fulkerson Algorithm [7.3]

• Reading Assignment:
  • Study: section 7.5
  • Skim: section 7.7
  • Study: section 7.8
  
  
• Possible Lecture Topics:
  • Screencast on The Bipartite Matching Problem, Part I [7.5]
  • Screencast on The Bipartite Matching Problem, Part II [7.5]
  • Screencast on Extensions to the Maximum Flow Problem [7.7]
  • Screencast on Survey Design and Airline Scheduling [7.8-7.9]
  
  
• Friday, Apr 24, for participation credit, turn in a solutions to the following
  1. Minimum Cost Spanning Tree Problem
  2. Sort and Count Problem
  3. Weighted Intervals Problem
  Note that the directions to these problems call for you to submit your solutions individually - three separate e-mails to tester2@cs.csustan.edu
  
  

• Reading Assignment:
  • Study: section 7.9
  • Skim: sections 7.10, 7.12, and the chapter 7 solved exercises
  
  
• Possible Lecture Topics:
  • Screencast on Survey Design and Airline Scheduling [7.8-7.9]
  • Screencast on Image Segmentation [7.10]
  • Screencast on Baseball Elimination [7.12]
  • Screencast on Introduction to Reduction [8.1]
  • Screencast on Reduction by Simple Equivalence and Reduction from Special Case to General Case [8.1]
  
  
• Friday, May 01, for participation credit, turn in a solutions to the following
  1. Knapsack Problem
  2. Network Flow Problem
  Note that the directions to these problems call for you to submit your solutions individually - two separate e-mails to tester2@cs.csustan.edu
  
  

• Reading Assignment:
  • Study: sections 8.1, 8.2, and 8.3
  
  
• Possible Lecture Topics:
  • Screencast on Introduction to Reduction [8.1]
  • Screencast on Reduction by Simple Equivalence and Reduction from Special Case to General Case [8.1]
  
  
• QUIZ #2: 🌷
  Thursday, May 07 on:
  • Material in sections 4.5, 4.6, 5.1, 5.2, 5.3, 5.4, 5.5, 6.1, and 6.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.
  
  
• TENTATIVE DATE: Problem Session for QUIZ #3: Tuesday, May 05 on:
  • Material in chapters and sections (TBA)
  
  
• TENTATIVE DATE: QUIZ #3: 🌷
  Thursday, May 07 on:
  • Material in chapters and sections (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.
  
  
• Friday, May 08 is Warrior Day. No afternoon classes meet on this day.
  
  

• Friday May 15 is the last day of class 🌷
  for the university.
  
  
• Reading Assignment:
  • Study: sections 8.4 and 8.5
  • Catch Up!!
  
  
• Possible Lecture Topics:
  • Maybe sections 8.4 and 8.5