HOMEWORK ASSIGNMENTS

We expect to have 6-8 homework assignments during this course. Unless otherwise specified, all assignments will be equally weighted.

Please make sure you understand the policy towards Academic Integrity.

Late assignments will be penalized in accordance with our Late Policy.

The table below gives the assignments, and associated dates. All future dates/topics are tentative until such assignments are made available.

Assignment	Topic	Due in Class	Solutions
hw01	Stable Matching	Friday, 1 Februrary 2008 (snow) Monday, 4 February 2008	soln
hw02	Algorithm Analysis	Friday, 8 Februrary 2008	soln
hw03	Graphs	Friday, 22 Februrary 2008	soln
hw04	Strongly Connected Components	Monday, 10 March 2008
hw05	Greedy Algorithms	Friday, 4 April 2008, 1:10pm	soln
hw06	Divide and Conquer Algorithms	Friday, 18 April 2008, 1:10pm
hw07	Dynamic Programming	Friday, 2 May 2008, 1:10pm