CSCI 161 Assignment 4,   Spring 1997

DUE:  
The assignment is due on or before 3am, Thursday Feb 27.  This
assignment is worth 20 objective points.  Your solution will be graded
on the basis of its run-time behaviour and on the clarity and
simplicity of the source code.  Your implementation must have no side
effects, including file input or output.  See the marking guide in
~csci161/Pex4/markingGuide. With regard to simplicity and clarity,
follow the ASAP principle: as simple as possible.

INSTRUCTIONS:
Issue the command:
               cp -r ~csci161/DPSet .
to copy the module directory to your account.  Locate to DPSet and
use the  Makefile  to test, verify and submit you assignment.  Your
task is to implement the DPSet module according to the module interface
specification in ~csci161/DPSet/DPSetInt.p.

Be sure that you make no changes to DPSetInt.p.  

You must use a linked list to store the elements of the set.  Local
declarations/definations and some code are given in DPSetImp.p.  Study
the given code carefully!  Each node in the linked list contains an
array. Set elements are stored in these arrays.  Newly allocated nodes
must be inserted at the head of the linked list.  The first node in the
list may contain up to MAXNODESIZ elements.  All other nodes in the
list must contain exactly MAXNODESIZ elements.  The following is a
representation of the list containing the elements {1,7,9,0,6,8,2}
where MAXNODESIZ=5. Note, your code must work for all values of
MAXNODESIZ in the range [1,1000] inclusive.

     head
    ------       -------------       ---------------
    |  --|-----> |8|2| | | |-|-----> |1|7|9|0|6|nil|
    ------       -------------       ---------------

     siz       firstNodeSiz
    ------        ------
    | 7  |        | 2  |
    ------        ------

You must use the given code to advantage and, you are not allowed to change
the given code in any way.

The access routine DPSInit does NOT have to dispose of any memory
associated with an existing list.  The access routine DPSDel must
dispose of the memory associated with a node containing no elements.



This assignment is to completed by each student.  Submit only one
implementation; if you send more than one, we will discard all but the
last one.  The assignment identifier is  CSCI 161 Pex 4 (see Course
Information Sheet).  Your assignment  must be received before the due
date and time.  In addition, your e-mail  must have the assignment
identifier as its subject.  All other methods of submission will not be
accepted.  You will receive no credit for an assignment submission that
fails to adhere to this convention.