Computer Science 314
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. 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||Style||Topic||Due in Class||Solutions|
|asgn01||written||Introduction to Algorithms||Friday, 7 September 2012||soln|
|asgn02||written||Asymptotics and Divide and Conquer||Friday, 14 September 2012||soln|
|asgn03||oral||Dynamic Programming||Monday, 24 September 2012, by appointment||soln|
|asgn04||written||Greedy Algorithms||Wednesday, 3 October 2012, 1:10pm||soln|
|asgn05||written||Graph Fundamentals||Friday, 12 October 2012, 1:10pm||soln|
|asgn06||written||Midterm Revisited||Monday, 29 October 2012, 1:10pm||soln|
|asgn07||programming||Shortest Path Algorithms||Monday, 5 November 2012, 11:59pm|
|asgn08||written||Network Flow||Friday, 16 November 2012, 1:10pm||soln|
|asgn09||written||Complexity Theory||Friday, 30 November 2012, 1:10pm||soln|
|asgn10||written||Approximation Algorithms||Monday, 10 December 2012, 1:10pm||soln|