UMBC CMSC 202, Computer Science II, Fall 1999,

Project 1 Notes

1. There is no assumption or requirement about the ordering of the list. The order of the nodes in the list will be dictated only by the particular sequence of function calls (i.e., Append(), Prepend(), Insert(), Delete()), and not by any automatic sorting or re-ordering of the list. Sorting of the list will be addressed in a future project.

2. The Proj1.c file that you turn in should be one I have supplied, using the main() function exactly as I have provided. For testing purposes, however, you are free (and encouraged) to write other main()'s that test things not tested by mine.

   For example, my main() only tests the Insert() function for position 2. It should also work for any possible valid position beginning with 1 and ending with 1 greater than the current number of nodes. Be sure to get this working NOW as you will need this function again for a future project. It is your responsibility to write some suitable code to test the Insert() function thoroughly.