Homework Four

The next homework is to experiment with linked lists. 

We shall create an application of linked lists which will model
sparse polynomials. A sparse polynomial is a polynomial in which
the coefficients of many of the terms are zero. 

Each node in the linked list should (minimally) have a field for
the coefficient, a field for the exponent, and a link to the next
term. You may use the model partially developed in lecture for 
your polynomial class. 

Your application should at least be able to construct, destruct,
add polynomials, and multiply a polynomial by a scalar (real number).
If you wish to add additional functionality to your class, you may
do so for extra credit. Suggestions include multiplication, division, and
remainder. 

This homework assignment is due Thursday, March 1, 2000.