WORK SCHEDULE FOR CS 4440 -- Spring 2017

• 🌷 First day of class is Thursday, January 26. class meets in P-101, 11:00-12:15.
  
  
• 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.
  
  
• Figure on having to cover an average of close to 19 pages per week in our text book: "Kleinberg-Tardos".
  
  
• Reading Assignment:
  • Read the course description & this schedule (important!!)
  • Kleinberg-Tardos: chapter 1, plus chapter 1 solved exercises

• Reading Assignment:
  • Kleinberg-Tardos: sections 4.1-4.2
  
  
• Possible Lecture Topics:
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Five Representative Problems
  
  
• ♭ ♬

• Reading Assignment:
  • Kleinberg-Tardos: sections 4.4-4.6
  
  
• Possible Lecture Topics:
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals

• Reading Assignment:
  • Kleinberg-Tardos: ch 4 solved exercises, sections 5.1-5.2
  
  
• Possible Lecture Topics:
  • Greedy Algorithm: Scheduling to Minimize Lateness
  • Dijkstra's (greedy) algorithm for single-source, all nodes, shortest paths.
  • Kruskal's (greedy) for finding a minimum cost spanning tree

• Reading Assignment:
  • Kleinberg-Tardos: sections 5.3-5.4, ch 5 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:
  • Kleinberg-Tardos: sections 6.1-6.4
  
  
• 🌷 QUIZ #1: Thursday, Mar 02 on:
  • Material on Chapters 1 and sections 4.1 to 4.4 of Chapter 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)
• February 28 (Mardi Gras): ⚜

• Reading Assignment:
  • Kleinberg-Tardos: sections 6.6-6.8
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: finish up chapter 6, ch 6 solved exercises, section 7.1
  
  
• Possible Lecture Topics:
  • (TBA)
  
  
• March 17: ☘
  
  
• March 20: 春

• Reading Assignment:
  • Kleinberg-Tardos: sections 7.2-7.3
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: sections 7.5, 7.7-7.8
  
  
• Possible Lecture Topics:
  • Shortest Paths in a Graph (Bellman-Ford Algorithm)
  • Homework Problems
  • Network Flow

• Reading Assignment:
  • Kleinberg-Tardos: sections 7.9, ch 7 solved exercises
  
  
• 🌷 QUIZ #2: Thursday, April 13 on:
  • Material in sections 4.5-4.6, 5.1-5.4, and 6.1-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.
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: sections 8.1-8.3
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: sections 8.4-8.5
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: finish 8.1-8.5, ch 8 solved exercises
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: ???
  
  
• 🌷 QUIZ #3: Tuesday, May 09 Thursday, May 11 on:
  • Material in sections
    • 6.3 (Segmented Least Squares),
    • 6.4 (Subset Sums & Knapsacks),
    • 6.6 (Sequence Alignment),
    • 7.1 (The Max Flow Problem & The Ford-Fulkerson Algorithm),
    • 7.2 (Max Flows & Min Cuts),
    • 7.3 (Choosing Good Augmenting Paths), and
    • 7.5 (The Bipartite Matching Problem)
  • 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:
  • Kleinberg-Tardos: Catch up!!
  
  
• Possible Lecture Topics:
  • (TBA)