The lab assignments for this course are designed with the intent that they can be completed - start-to-finish - during the 50 minute lab period. Furthermore, many labs are designed to be preliminary versions of tasks which will show up in programming assignments due the following week. For these reasons, You must attend the lab and turn in your results at that time, in order to receive credit. No credit will be give for ``late'' labs without advanced arrangments between the student and the TA.
Labs will be graded almost on a pass/fail basis. The intent is for you to make reasonable progress in solving the given task. Each lab is worth a maximum of two points. Full credit will be given to anyone making reasonable progress towards the goal. One of two points will be given to those making an effort, but having more serious difficulties. Zero points will be given for those who make no effort (e.g., do not attend).
The table below gives the assignments, and associated dates. All future dates are tentative until such assignments are made available.
| Lab | Topic | Date |
|---|---|---|
| lab00 | Welcome (not graded) | Tuesday, 27 August 2002 |
| lab01 | Vectors | Tuesday, 3 September 2002 |
| lab02 | (Singly) Linked Lists | Tuesday, 10 September 2002 |
| lab03 | Medians (Doubly-Linked Lists) |
Tuesday, 17 September 2002 |
| lab04 | "Grouping" (Lists and Positions) |
Tuesday, 24 September 2002 |
| lab05 | An Euler Tour of a Tree | Tuesday, 1 October 2002 |
| lab06 | Building a Binary Tree | Tuesday, 8 October 2002 |
| lab07 | Building Heaps | Tuesday, 22 October 2002 |
| lab08 | Animating Quicksort | Tuesday, 29 October 2002 |
| lab09 | (continuation of lab08) | Tuesday, 5 November 2002 |
| lab10 | Binary Search Trees | Tuesday, 12 November 2002 |
| lab11 | Binary Search of an Array | Tuesday, 19 November 2002 |
| lab12 | (continuation of lab 11) | Tuesday, 26 November 2002 |