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 |
instructor's
peers' |
|
| hw2 | Asymptotics, Dynamic Programming |
instructor's
peers' |
|
| hw3 | Dynamic Programming, Greedy Algorithms |
instructor's
peers' |
|
| midterm | Various | instructor's | |
| hw4 | Amortization, Graph Algorithms |
instructor's
peers' |
|
| hw5 | MST, Shortest Paths |
instructor's
|
|
| hw6 | Network Flow | instructor's |