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 Honesty.

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 Stacks and Queues Thursday, 5 September 2002 soln01
hw02 Asymptotics, Singly Linked Lists Thursday, 12 September 2002 soln02
hw03 Linked Lists, Amortization Thursday, 19 September 2002 soln03
hw04 List and Sequence ADT Thursday, 3 October 2002 soln04
hw05 Trees Thursday, 10 October 2002 soln05
hw06 Priority Queues and Heaps Thursday, 24 October 2002 soln06
hw07 Radix Sort Thursday, 14 November 2002 soln07
hw08 Search Trees Tuesday, 26 November 2002 soln08


Last modified: 17 October 2002