WORK SCHEDULE FOR CS 4440 -- Spring 2016

• ♥ The first day of classes at CSU Stanislaus is Thursday, Jan 28.
  CS 4440 is a Monday/Wednesday class, so it does not meet in the first week.
  
  
• 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

• WEEK #2 CS 4440 meets for the first time in P-101 on Monday, Feb 01 at 3:00 p.m..
  
  
• 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 Monday, Feb 08:
  • 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.
• ♭ ♬

• Reading Assignment:
  • Kleinberg-Tardos: sections 4.4-4.6
  
  
• Homework #1, Due Monday, Feb 08:
  • pp 22-23, problems 1, 2, 3
  
  
• Possible Lecture Topics:
  • Greedy Algorithm: Interval Scheduling
  • Greedy Algorithm: Scheduling All Intervals
  • Greedy Algorithm: Scheduling to Minimize Lateness

• 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

• 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
  
  
• Homework #2, Due Monday, Feb 29:
  • Pages 189-190; problem 5.
  • Create a small undirected graph with five nodes and eight edges. Use both Krusal's and Prim's algorithms to compute (by hand) a minimum spanning tree. Show your work.
  • Create a small directed graph with five nodes and nine edges, and use Dikjstra's algorithm to compute (by hand) all the shortest paths from a start node to all the other nodes. Show your work.
  • Pages 188-189; problems 1, 2.
  • 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.
  
  
• Problem Session for QUIZ #1: Wednesday, Mar 02 on:
  • Chapters 1, 4, and 5
  
  
• Possible Lecture Topics:
  • (TBA)

• Reading Assignment:
  • Kleinberg-Tardos: sections 6.6-6.8
  
  
• QUIZ #1: Monday, Mar 07 on:
  • Chapters 1, 4, and 5
  • 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: section 6.9, 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
  
  
• Homework #3 Due, Monday, April 11:
  • Do problem #6 on p. 248. Give pseudo-code for your algorithm, and demonstrate that your algorithm is O(logN) by appropriately applying and citing the divide and conquer theorem.
  • Do problem #1 on pages 312-313.
  • Do problem #2 on pages 313-314.
  
  
• 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)

• Reading Assignment:
  • Kleinberg-Tardos: sections 8.1-8.4
  
  
• Problem Session for QUIZ #2: Monday, Apr 18 on:
  • Chapters 5-7
  
  
• QUIZ #2: Wednesday, Apr 20 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 8.5-8.7
  
  
• HOMEWORK #4 Due, Monday, May 02:
  • Do problems 1, 2, 4, and 6 on pages 415-417.
  
  
• Problem Session for QUIZ #2: Monday, Apr 25 on:
  • Chapters 5-7
  
  
• QUIZ #2: Wednesday, Apr 27 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 8.8-8.10, ch 8 solved exercises, section 9.1
  
  
• Problem Session for QUIZ #2: Monday, May 02 on:
  • Chapters 5-7
  
  
• QUIZ #2: Wednesday, May 04 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
  
  
• Possible Lecture Topics:
  • (TBA)

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