Spring 1996
Daily Homework Problems - Tentative Schedule
This is a course on problem solving. The best way to really learn the material is by solving problems, and then comparing your solutions with a correct one. To aid in your understanding of the material, at the begining of each class I will solve a problem based on the material from the previous lecture.
These problems will be collected at the begining of class. Although the daily problems count for only a small percentage of the grade, I believe they are very important to make sure that you are keeping up with the material. My hope is that the daily problem will be solvable with about fifteen minutes of effort.
We will not grade them carefully but keep track of what was turned in.
All problems come from Introduction to Algorithms by Cormen, Leiserson, and Rivest.
