Computing and Software Systems 343, Autumn 2003
Mathematical Principles of Computing II

Assignments

Current Assignment

All Assignments

  1. Assignment 1 : Due Monday, Oct. 6. Code for programming part.
  2. Assignment 2 : Due Monday, Oct. 13. Code for programming part.
  3. Assignment 3 : Due Monday, Oct. 20.
  4. Assignment 4 : Due Wednesday, Oct. 29.
  5. Assignment 5 : Due Wednesday, Nov. 5.
  6. Assignment 6 : Due Wednesday, Nov. 12. ArrayIO Code from assignment 1.
  7. Assignment 7 : Due Wednesday, Nov. 26. SimpleGraph Code .
  8. Assignment 8 : Due Monday, Dec. 8. Warning: This assignment is longer than normal!
    SimpleGraph Code .
You may also browse the directory of all assignments.

practice problems

Here are some suggested practice problems in the area of greedy algorithms and dynamic programming. Solutions to these problems can be found in the solutions directory, in file greedydynamic.doc.

  1. C-5.9
  2. R-5.11
  3. R-5.12
  4. R-5.2. (Provide pseudocode).
  5. Write pseudocode for computing the linebreaking penalty using the following greedy algorithm: Put as many words as will fit on the current line, then move on to the next line.
R-5.1 and R-5.3 are also good problems.

For more practice, you can do the problems from a previous quarter. You can check both previous quarter assignments, as well as previous quarter practice problems. Link to spring03 and winter03.

Send mail to: edhong@u.washington.edu
Last modified: 12/10/2003 2:22 pm