Files

• list.h - implementation for linked list ADT
• list.c - test for linked list ADT
• poly.c - implementation and test for Polynomial ADT

Linked List ADT

1. append(list,element) - appends element to end of list
2. Next(list) - returns next position in list (Node *)
3. Current(list) - returns current node in list (Node *)
4. Length(list) - returns length of list (int)
5. Retrieve(list,pos) - returns Data at position pos in list (void *)
6. Reset(list) - sets current pointer to head of list
7. Delete(list,pos) - removes element at position pos from list
8. insert(list,value,pos) - inserts "value" at position pos in list
9. initlist() - returns pointer to a blank list

Polynomial ADT

1. order(list) - returns order of magnitude (int)
2. evaluate(list,x) - returns evaluation of F(x) using Horner's rule (int)
3. add(poly1, pol2) - adds the elements of poly1 and poly2 and returns result (List *)
4. sub(poly1, poly2) - subtracts the elements of poly2 from poly1 and returns result (List *)
5. mult(poly1, poly2) - multiplies poly1 and poly2 and returns result (List *)
6. differentiate(list, z) - differentiates the polynomial Z times