Assignments

General instructions

1. At the top of your solutions, be sure to write down the names of anyone you discussed this assignment with or any resources you used!
2. Please copy the description of the problem as well as your solution.
3. Submit your work through Gradescope. Refer to Tools for details.

1. Assignment 1, due Tuesday Sept 17 at 11:59pm
   • stable matchings
2. Assignment 2, due Tuesday Sept 24 at 11:59pm
   • asymptotic analysis, graphs
3. Assignment 3, due Tuesday Oct 1 at 11:59pm
   • graphs
4. Assignment 4, due Tuesday Oct 8 at 11:59pm
   • graphs, greedy
5. Assignment 5, due Tuesday Oct 22 at 11:59pm
   • greedy
   • note that Midterm 1 goes out Wednesday Oct 16, due Monday Oct 21
   • submit by Friday Oct 11 at 11:59pm for 5 points of extra credit
   • submit by Wednesday Oct 16 at 11:59pm for 3 points of extra credit
6. Assignment 6, due Tuesday Oct 29 at 11:59pm
   • divide-and-conquer (recursion tree/unrolling, master theorem)
7. Assignment 7, due Tuesday Nov 5 Thursday Nov 7 at 11:59pm
   • divide-and-conquer (substitution)
8. Assignment 8, due Thursday Nov 14 at 11:59pm
   • dynamic programming
9. Assignment 9, due Friday Nov 19 Wednesday Nov 27 at 11:59pm
   • network flow
   • note that Midterm 2 goes out Wednesday Nov 20, due Tuesday Nov 26 at 11am
   • submit by Wednesday Nov 20 at 11:59pm for 5 points of extra credit
   • submit by Friday Nov 22 at 11:59pm for 3 points of extra credit
10. Assignment 10, due Tuesday Dec 10 at 11:59pm
    • P and NP

Extra credit opportunities -- submit no later than December 10 at 11:59pm