HOMEWORK ASSIGNMENTS

Please make sure you understand the policy towards Academic Integrity.

No late assignments will be accepted.

The table below gives the assignments, and associated dates. All future dates/topics are tentative until such assignments are made available. Please note that there is a somewhat unusual numbering system for problems from the textbook. The book has what it terms "Exercises" that are at the end of each section, and "Problems" that are at the very end of each chapter. For example, Exercise 3.1-1 is at the end of Section 3.1 on page 52, whereas Problem 3-1 is at the end of Chapter 3, on page 61.

Assignment	Topic	Due in Class	Solutions
hw1	Introduction, Fundamental Data Structures, Divide and Conquer	10:00am, Monday, September 8, 2014	instructor's peers'
hw2	Asymptotics, Dynamic Programming	10:00am, Monday, September 22, 2014	instructor's peers'
hw3	Dynamic Programming, Greedy Algorithms	10:00am, Monday, October 6, 2014	instructor's peers'
midterm	Various	10:00am, Wednesday, 22 October, 2014	instructor's
hw4	Amortization, Graph Algorithms	10:00am, Monday, 3 November, 2014	instructor's peers'
hw5	MST, Shortest Paths	10:00am, Monday, 17 November, 2014	instructor's
hw6	Network Flow	10:00am, Monday, 1 December, 2014	instructor's

Procedures for Submitting Homework

Please carefully read the following:

• During the semester there will be 6 homeworks, designed as HW1 through HW6.

• Each homework assignment will have 5 parts, denoted as A, B, C, D, and E. For example, the third part of the first homework might be designated as HW1, Part C.

• Each student in the class will be assigned a three character "code name" (e.g., XML) to provide sufficient level of anonymity in peer assessment. Only that code name should appear on homework assignments.

When submitting a homework, it is important that the following procedures be strictly followed.

• Homework is to be turned in at the beginning of class, on the assigned due date. No late homeworks will be accepted.

• For each homework, a single cover page must be submitted with the following information:

  STUDENT:       <actual name>
  CODENAME:      <code name>
  HW:            <number>	    
  COLLABORATORS: <hw part, other names>	    
  

  Note well that collaboration will only be allowed in limited fashion as described in the syllabus.

  As an example, a cover page (from many years ago) might appear as

  STUDENT:       Michael Goldwasser
  CODE NAME:     XML
  HW:            1
  COLLABORATORS: Part B - David Letscher
  	       Part C - Erin Chambers, Kevin Scannell
  

• Each of the five parts of the homework must be submitted as a separate packet. If a packet has multiple pages, those should be securely stapled/fastened, but the packets should not be fastened to each other or to the cover page, as there will be a separate pile for turning in each part.

• The top of the first page for each packet must include the following header:

  CODENAME:      <code name>
  HW:            <number>	    
  PART:          <letter>	    
  

  For example, student XML might have the following header for the third part of the first homework:

  CODENAME: XML
  HW:       1
  PART:     C