HOMEWORK ASSIGNMENTS

We expect to have 8 homework assignments during this course. Your lowest score will be dropped at the end of the course and your remaining scores will be averaged.

Please make sure you understand the policy towards Academic Integrity.

Homework assignments are due at the beginning of class. Late assignments will be penalized in accordance with our Late Policy.

The table below gives the assignments, and associated dates. All future dates/topics are tentative until such assignments are made available.

Assignment Topic Due in Class Solutions
hw01 Object-Oriented Programming soln
hw02 Recursion soln
hw03 Stacks, Queues soln
hw04 Asymptotics and Singly Linked Lists soln
hw05 Linked Lists soln
hw06 Amortization, Vectors and Lists soln
hw07 Trees soln
hw08 Priority Queues soln


Last modified: Friday, 29 April 2005