CSci 131 -- Project 3

The George Washington University
School of Engineering and Applied Science
Department of Electrical Engineering and Computer Science
CSci 131 -- Algorithms and Data Structures I -- Spring 2001

Project #3
Due Date: start of class, Wednesday, March 7, 2001

In this project you will explore doubly-linked lists. The project depends on Chapters 1, 2, 3, 5, and 8.

Program 5.15 (p. 205) contains the interface to a generic sets package that can handle sets of discrete (integer or enumeration) values. That package uses a Boolean array implementation of sets. This project requires simply that you reimplement the sets package using doubly-linked lists to represent the sets. Implement all the operations in the package, and also add an equality operator "=" that returns True if its two set operands have exactly the same members.

What to submit:

Test plans, listings, and test runs demonstating that the package was completed and all operations behave properly. No Type 1 (end-user) user guide is necessary because the deliverable is a package and there is no end-user program. However, you should write a Type 2 (programmer) user guide. You can use a suitably annotated copy of the package interface for this.

WARNING:

This is not a terribly difficult project, but it is not one you can do at the last minute. Linked-list manipulation has a lot of subtlety, and you will need to give yourself time to think, design before you code, design test plans carefully, and (if necessary) debug. START NOW!