The George Washington University
School of Engineering and Applied Science
Department of Electrical Engineering and Computer Science

CSci 131 -- Data Structures
Project #5

Due Date: March 31, 1998

Copy the generic table handler and backup/restore packages into a new set of files, then modify the private section, and bodies, of the original files so that a table is implemented as an ordered singly linked list with head and tail pointers. The idea is not to throw away the array version, and also not to change the public part of the specs at all!

Re-test using Employees and Vehicles. An important goal of this project is to show the advantage of having a general and well-thought-out interface to a package like this, so that it is possible to change implementations without causing any client code to be modified.

Students in a course like this need to get an oppportunity to write their own linked-list operations. Therefore, you are not permitted to use the generic list package from Chapter 9. Use dynamic allocation and access types directly in implementing the table operations; use the various procedures from Chapter 8 as your starting point.