WORK SCHEDULE FOR CS 4440 -- Fall 2016

• ♥ We meet on Mondays, Wednesdays, and Fridays.
  The first day of class is Wednesday, Aug 24, at 12:00 in room C-108.
  
  
• 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
  
  
• Possible Lecture Topics:
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Five Representative Problems

• Reading Assignment:
  • Kleinberg-Tardos: sections 4.1-4.2
  
  
• Possible Lecture Topics:
  • The Stable Matching Problem & The Gale-Shapley Algorithm
  • Five Representative Problems
  
  
• Homework #1, Due Wednesday, Aug 31:
  • pp 22-23, problems 1, 2, 3
    • Use 8½"x11" paper.
    • Leave lots of room for my comments.
    • Keep a spare copy of your work - I may not hand it back for quite a while.

• No class on Monday, Sept 5 - Labor Day
  
  
• Reading Assignment:
  • Kleinberg-Tardos: sections 4.4-4.6
  
  
• Possible Lecture Topics:
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals
  • Greedy Algorithm: Scheduling to Minimize Lateness
  
  
• Work on homework #2, Due Friday, Sep 16 - problem: #7 on pp 191-192.
  • Do the problem as stated, and also do your best to prove that the algorithm you "give" works - that it always finds a schedule with as small a completion time as possible.
  • Read the problem early this week and give yourself time to think it over.
  • To get a feel for the problem, generate random values for p1, f1, p2, and f2, and figure out what the schedule should be for those values.
  • Use 8½"x11" paper. (REALLY: 8½"x11" - measure it to make sure.)
  • Leave lots of room for my comments.
  • Keep a spare copy of your work - I may not hand it back for quite a while.

• Reading Assignment:
  • Kleinberg-Tardos: ch 4 solved exercises, sections 5.1-5.2
  
  
• Possible Lecture Topics:
  • Dijkstra's (greedy) algorithm for single-source, all nodes, shortest paths.
  • Kruskal's (greedy) for finding a minimum cost spanning tree
  
  
• Homework #2, Due Friday, Sep 16: See assignment details in the "WEEK #3" information. It's problem #7 on pp 191-192, and I asked for a proof along with the algorithm.

• 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
  
  
  秋
  Thurs, Sept 22: Equinox - autumn begins in the Northern Hemisphere.

• Reading Assignment:
  • Kleinberg-Tardos: sections 6.1-6.4
  
  
• Problem Session for QUIZ #1: Wednesday, Sep 28 on:
  • Chapters 1 and 4
  
  
• QUIZ #1: Friday, Sep 30 on:
  • Chapters 1 and 4
  • Bring a Scantron 815-E form, a #2 pencil, and an eraser with you. The 815-E forms are short forms with room for 15 answers, and they are sold in the University bookstore.
  
  
• Possible Lecture Topics:
  • (TBA)

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

• No class on Wednesday, Oct 12
  
  
• Reading Assignment:
  • Kleinberg-Tardos: ch 6 solved exercises, section 7.1
  
  
• Possible Lecture Topics:
  • (TBA)
  
  

• 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 Homework #3, Due Monday, Oct 24 (TBA)
  
  
• Possible Lecture Topics:
  • Shortest Paths in a Graph (Bellman-Ford Algorithm)
  • Homework Problems
  • Network Flow

• Reading Assignment:
  • Kleinberg-Tardos: sections 7.9-7.10, 7.12, ch 7 solved exercises
  
  
• Possible Lecture Topics:
  • (TBA)

• Homework #3, Due Wednesday, Nov 9 (Problem #6, page 248)
  
  
• No class on Friday, Nov 11
  
  
• Reading Assignment:
  • Kleinberg-Tardos: sections 8.1-8.4
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: sections 8.5-8.7
  
  
• Possible Homework #4, Due Monday, Nov 14 (TBA)
  
  
• Problem Session for QUIZ #2: Friday, Nov 18 on:
  • Chapters 5-7
  
  
• Possible Lecture Topics:
  • (TBA)

• No class on Thurs Nov 24 or Fri Nov 25
  
  
• Reading Assignment:
  • Kleinberg-Tardos: sections 8.8-8.10, ch 8 solved exercises, section 9.1
  
  
• QUIZ #2: Monday, Nov 21 on:
  • Chapters 5-7
  • Bring a Scantron 815-E form, a #2 pencil, and an eraser with you. The 815-E forms are short forms with room for 15 answers, and they are sold in the University bookstore.
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: sections 9.2-9.5, ch 9 solved exercises
  
  
• QUIZ #2: Monday, Nov 28 Friday, Dec 02 on:
  • Chapters 5 and 6, plus sections 7.1-7.3 and 7.5
  • Bring a Scantron 815-E form, a #2 pencil, and an eraser with you. The 815-E forms are short forms with room for 15 answers, and they are sold in the University bookstore.
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: Catch up!!
  
  
• Possible Lecture Topics:
  • (TBA)

• Monday December 12 is the last day of class.
  
  
• Reading Assignment:
  • Kleinberg-Tardos: Catch up!!
  
  
• Possible Lecture Topics:
  • (TBA)