School of Engineering and Applied Science Department of Computer Science CSci 133 -- Algorithms and Data Structures I http://www.seas.gwu.edu/~csci133/spring04 Prof. Michael B. Feldman mfeldman@gwu.edu

This two-stage project depends mostly on Chapter 3 of Lewis & Chase, Java Software Structures. Lewis & Chase present a linked implementation of the bag ADT in Chapter 3. In Project 3 you developed a set ADT; in this project you will just re-implement the set ADT using linked lists to store the sets.

Since you've already developed ArraySet, you might find it easiest to

1. copy ArraySet into a new file LinkedSet;
2. stub out the methods and make only the changes necessary to make LinkedSet compilable;
3. produce the javadoc page for LinkedSet;
4. implement and test the method bodies incrementally. You should be able to reuse your test program(s) with very few changes!

This is only a suggestion; you don't have to follow this exact order as long as you get the project done.

(end of project)