Weekly exercises are due at the beginning of lecture on the date given. This list is tentative and is to be considered subject to change. Once the exercise moves above the "Exercises below have not yet been updated for Spring 2009" part of the table, no significant changes will be made.
|2||Analysis of algorithms||2/9|
|3||Stacks and queues||2/16|
|7A||Binary search trees||3/2|
|7B||Red-black trees||do not hand in|
|8||Hashing||do not hand in|
|Exercises below have not yet been updated for Spring 2009|
|19||Linear programming||do not hand in|
|19||Reduction||do not hand in|
Grading policy. Grades on the problem set questions will be: 4 (correct), 3 (minor mistake), 2 (major mistake), 1 (poor try) or 0 (all wrong or not submitted). Also, some of the exam question will be based on the exercises, so it is to your advantage to complete these in a timely manner.
Lateness policy. Late exercises will not be accepted without a University-sanctioned excuse or approval by a preceptor.
Collaboration policy. You are permitted to work with up to two other classmates in any precept ( changed March 2009). All group members are responsible for jointly contributing to and understanding all parts of the exercise solutions. Submit one solution for the group, and be sure to include the names of all group members.