Calendar, CS 255, Section 1, Spring 2007 First day of class: Wednesday, January 24 Last day to drop or withdraw without a "W" grade: Monday, February 5 Last day to add courses: Monday, February 12 Problem set #1 due date: Monday, February 19 Test #1: Wednesday, February 28 coverage: Sections 9.1, 9.3, 15.1, 16.1, 16.2, 16.4, 16.5 Sections 5.2-3, 7.3, 9.2, 11.3.3 topics from Problem Set #1 Section 34.1 (but not polynomially relatable encodings) Section 34.2 (but not the Hamiltonian cycle problem) Section 34.3 (definitions of poly. reducibility and NP-complete only) Problem set #2 due date: Wednesday, March 14 Spring break (no class or office hours): Monday, March 26 - Friday, March 30 Test #2: Wednesday, April 4 emphasis will be on the material covered since the last test, which is Section 34.2 (the Hamiltonian cycle problem) Sections 34.3-34.5 Sections 35.1-35.3 and several issues covered on the slides but not in the text e.g., First-Fit Decreasing scheduling Problem set #3 due date: Monday, April 9 Problem set #4 due date: Monday, April 23 Test #3: Monday, May 7 emphasis will be on the material covered since the last test, which is Section 35.5 Chapter 27 Chapter 30 of the first edition of the text, through p 706 Also Theorems 30.1, 30.2, 30.4, and Amdahl's law, and definitions of speedup and efficiency Section 12.5, Johnsonbaugh & Schaefer Sections 31.1-31.2 but not Theorems 31.2, 31.4, 31.5, 31.6, or 31.8 Section 31.3 -- know the definitions of Zn*, of phi, of unit, and of zero divisor know how to find phi(n) Section 31.6 -- the MOD-EXPN algorithm only Last day of class: Monday, May 14 Problem set #5 due date: Monday, May 14 Final Exam: Wednesday, May 23, 1715-1930 the material covered will be all material covered on Tests 1, 2, and 3 plus Theorems 31.8, 31.30, 31.31, and Sections 31.7 and 31.8 you are also responsible for the material of problem sets 1, 2, 3, 4, and 5