Check your grades here (as of 12/13/1999)
README file (starting on 10/8/1999)

Assignment 1: Slide puzzle ..
Basic Methods (Due Sept 10, 1999, 12:00 PM).
Turnin instructions for assignment 1
Grades for assignment 1

Assignment 2: Solving the puzzle using
basic data structures (Due Sept 21, 1999, 12:00 PM).
Turnin instructions for assignment 2
Grades for assignment 2
Solutions

Assignment 3: Asymptotic analysis and
proof techniques (Due Sept 24, 1999, 12:30 PM).
Grades for assignment 3
Solutions

Assignment 4: Implementing and using heaps
for Unchecked List (Due Oct 15, 1999, 12:00 PM (noon)).
Additional note about assignment 4
Turnin instructions for assignment 4
Grades for assignment 4
Test cases
Solutions

Assignment 5: Implementing
an AVL tree and using it for the checked list of your slide puzzle.
(Due Oct 29, 1999, 12:00 PM (noon)).
Additional note about assignment 5
Turnin instructions for assignment 5
Grades for assignment 5
Solutions

Assignment 6: Using a Hash Table
for your checked list.
(Due Mon, Nov 15, 1999, 12:00 PM (noon)).
PSO materials for Hash Table
Turnin instructions for assignment 6
Grades for assignment 6
Solutions

Assignment 7: Dictionaties and 24/
Red Black Trees (Due Dec. 1, 1999, 12:30 PM).

Assignment 8: RedBlack Trees
(Due Dec 8, 1999, 12:00 PM).
Important additional note about assignment 8
Additional note that may help you
Grading policy for assignment 8