{Assignment Five: Lists}

* <strong>Assigned</strong>: Monday, October 27, 1997 <br>
* <strong>Suggested due date</strong>: Friday, October 31, 1997 <br>
* <strong>Due</strong>: 4pm, Monday, November 3, 1997 

<strong>Summary</strong>:
In this assignment, you will implement singly linked lists using
arrays.

<strong>Note</strong>:
I'd recommend you get this done by Thursday, October 30, since
support is generally available on Tuesday and Wednesday and the
next assignment will be due the following Thursday.  However,
I have given you some extra time since it's post-break.

<strong>Collaboration</strong>: 
You can work on this assignment in groups of up to size three.
You may discuss your design with any size group.  You may also
work with each other on general debugging issues.  

If you work as part of a group, you are responsible for ensuring
that all members of the group understand all sections of the
assignment.  

<h2>Assignment</h2>

Develop an array-based implementation of lists of integers, called
<code>IntList</code>.  Your implementation should include a
"current" reference to the list.  Your implementation should
support the following routines (and they should
have the same names):

* Two constructors:
  + <code>IntList()</code> that creates a list with some reasonable
    default maximum size.
  + <code>IntList(int maxsize)</code> that creates a list that can hold
    up to <code>maxsize</code> elements.
* Three ways to manipulate the current pointer.
  + <code>void advanceCurrent() throws ListException</code> which advances 
    the current pointer
  + <code>void resetCurrent() throws ListException</code> which resets the
    current pointer to the front of the list.
  + <code>boolean find(int elt) throws ListException</code> which advances
    the current pointer to the first element that matches the given element.
    It returns true if the element is found, and false otherwise.  (Note
    that you'll need to specify where the current pointer ends up if the
    element isn't found.)
* Three ways to insert elements:
  + <code>void insertAtHead(int val) throws ListException</code> which
    inserts an element at the head (front) of the list.  It should throw
    an execption when it is impossible to do the insertion (e.g., when
    the list is full).
  + <code>void appendAtEnd(int val) throws ListException</code> which
    appends an element at the end of the list.  It should throw an
    exception when it is impossible to append the element.
  + <code>void replaceCurrent(int val) throws ListException</code> which
    replaces the current element of the list.
* One way to remove elements:
  + <code>int deleteHead() throws ListException</code> which deletes
    the first element of the list.
* Two ways to retrieve elements:
  + <code>int head() throws ListException</code> which returns the first 
    element of the list.
  + <code>int current() throws ListException</code> which returns the 
    current element of the list.
* A few utility functions:
  + <code>int size()</code> which returns the size of the list.
  + <code>int capacity()</code> which returns the capacity of the list.
  + <code>int min() throws ListException</code> which returns the smallest element of the list.
  + <code>int max() throws ListException</code> which returns the largest element of the list.

Note that you will need to define your own  <code>ListException</code>
class (and perhaps subclasses of that class).  You should also develop
an appropriate test suite for your class.