WORK SCHEDULE FOR CS 4440 -- Spring 2019

🌷 The first day of university classes is Friday, January 25.

There are two sections of Theory of Algorithms (CS 4440). Both meet on Tuesdays and Thursdays. Class meetings start next week.

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

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


• 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 two of the thirteen pages. You'll need to study the rest very thoroughly.
  
  
• Reading Assignment:
  • Read the course description & this schedule (important!!)
  • Study: Kleinberg-Tardos sections 1.1 and 1.2
  
  
• Possible Lecture Topics (for next 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:
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Five Representative Problems

• 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
  
  
• TENTATIVE DATE: Problem Session for QUIZ #1: Tuesday, February 26 on:
  • Chapters 1 and 4
  
  
• TENTATIVE DATE: QUIZ #1: 🌷
  Thursday, February 28 on:
  • Material on Chapters 1 and 4 (specifics 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.
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Study: sections 5.3 and 5.5
  • Skim: section 5.4 and chapter 5 solved exercises
  
  
• Any day this week: for participation credit, turn in any of the first three exercises you have not yet done. You can get one credit for either the Dijkstra's algorithm exercise or an Interval scheduling problem. You can also get one credit for the exercise on the stable matching problem.
  
  
• Problem Session for QUIZ #1: Tuesday, March 5 on:
  • We review parts of what we covered in chapters 1 and 4 (up to, and including, Dijkstra's Algorithm)
  
  
• QUIZ #1: 🌷
  Thursday, March 7 on:
  • Material on Chapters 1 and 4 (all assigned sections up to, and including, Dijkstra's Algorithm)
  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
  
  
• Any day this week: for participation credit, turn in any of the first three exercises you have not yet done. You can get one credit for either the Dijkstra's algorithm exercise or an Interval scheduling problem. You can also get one credit for the exercise on the stable matching problem.
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Study: sections 6.6 and 6.7
  
  
• Possible Lecture Topics:
  • (TBA)

• No Classes Monday, April 01 (For César Chávez Holiday)
  
  
• Reading Assignment:
  • Skim: chapter 6 solved exercises
  • Study: section 7.1
  
  
• Possible Lecture Topics:
  • (TBA)
  
  
• Practice Exercises for QUIZ #2: to be turned in Tuesday, April 09
  For additional participation credit, do the "day16" and "day17" exercises here
  
  
• TENTATIVE DATE: Problem Session for QUIZ #2: Tuesday, April 02 on:
  • Material in chapters and sections (TBA)
  
  
• TENTATIVE DATE: QUIZ #2: 🌷
  Thursday, April 04 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:
  • (TBA)
  
  
• Problem Session for QUIZ #2:
  Tuesday, April 09
  on material in sections
  • 4.5 (The Minimum Spanning Tree Problem),
  • 4.6 (Implementing Kruskal's Algorithm : The Union-Find Data Structure),
  • 5.1 (A First Recurrence: The Mergesort Algorithm),
  • 5.2 (Further Recurrence Relations),
  • 5.3 (Counting Inversions),
  • 5.5 (Integer Multiplication)
  • 6.1 (Weighted Interval Scheduling: A Recursive Procedure), and
  • 6.2 (Principles of Dynamic Programming: Memoization or Iteration over Subproblems)
  
  
• QUIZ #2: 🌷
  Thursday, April 11
  on material in sections
  • 4.5 (The Minimum Spanning Tree Problem),
  • 4.6 (Implementing Kruskal's Algorithm : The Union-Find Data Structure),
  • 5.1 (A First Recurrence: The Mergesort Algorithm),
  • 5.2 (Further Recurrence Relations),
  • 5.3 (Counting Inversions),
  • 5.5 (Integer Multiplication)
  • 6.1 (Weighted Interval Scheduling: A Recursive Procedure), and
  • 6.2 (Principles of Dynamic Programming: Memoization or Iteration over Subproblems)
  
  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: section 7.5
  • Skim: section 7.7
  • Study: section 7.8
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Study: section 7.9
  • Skim: sections 7.10, 7.12, and the chapter 7 solved exercises
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Study: sections 8.1 and 8.2
  
  
• TENTATIVE DATE: Problem Session for QUIZ #3: Tuesday, April 30 on:
  • Material in chapters and sections (TBA)
  
  
• TENTATIVE DATE: QUIZ #3: 🌷
  Thursday, May 02 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.
  
  
• Possible Lecture Topics:
  • (TBA)

• Friday, May 10 is Warrior Day. No afternoon classes on this day
  
  
• Reading Assignment:
  • Study: sections 8.3 and 8.4
  • Skim: chapter 8 solved exercises
  
  
• Possible Lecture Topics:
  • (TBA)
  
  
• For participation credit, turn in the practice exercise on network flow on Tuesday, May 07.
  
  
• For participation credit, turn in the practice exercise on the weighted intervals problem on Thursday, May 09.
  
  
• TENTATIVE DATE: Problem Session for QUIZ #3: Tuesday, May 07 on:
  • Material in chapters and sections (TBA)
  
  
• TENTATIVE DATE: QUIZ #3: 🌷
  Thursday, May 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.
  
  

• Wednesday May 15 is the last day of class 🌷
  for the university.
  
  
• Reading Assignment:
  • Catch Up!!
  
  
• Possible Lecture Topics:
  • (TBA)