Intermediate Programming 600.120

   Project 1
   ---------

1. Design and develop a linked list based repository 
   that maintains a dynamic list of unique numbers in the order
   they were inserted.
   The repository should support the following operations:

   Insert - insert a number into the repository. Each number
            should only appear at most once in the repository.
            The operation should return 1 if the number was
            inserted, 0 if the number was not inserted, and
            -1 if the operation had a problem completing correctly.

   Delete - remove a number from the repository if such exists.
            The operation should return 1 if the number was
            removed, 0 if the number was not found in the repository,
            and -1 if the operation had a problem completing
            correctly.
 
   Get    - get a specific number from the repository if such 
            exists. The operation should return 1 if the number
            was found in the repository, 0 if the number was
            not found, and -1 if the operation had a problem
            completing correctly.

   Print  - print the current size of the repository, the number
            of 'next' steps performed so far (see below), and
            the current numbers in it.


   A counter should maintain the number of steps performed on 
   the list. The counter should be initialized to 0 and should
   be incremented each time a pointer is set to point to another
   member of the list. This gives an indication of how much effort
   was spent so far.

   Write a program that will use the repository with random
   operations generated by the "Get_next_op" function provided
   in class as a solution to the Getting_started_quiz.

1.a  Run it with numbers between 1..10, for 1000 operations, 
     printing every 100 operations.
1.b  Run it with numbers between 1..100, for 10,000 operations, 
     printing every 1000 operations.
1.c  Run it with numbers between 1..100, for 1,000,000 operations, 
     printing every 100,000 operations.
1.d  Run it with numbers between 1..1000, for 10,000,000 operations, 
     printing every 1,000,000 operations. Avoid printing the actual
     numbers in this case(just the size and number of steps).






2. Design and develop a similar repository with the
   modification that the list is maintained sorted (smaller
   numbers first). Re-run 1.a, 1.b, 1.c, 1.d for this case as
   well.

3. Re-run 1.d and 2.d with 5 different seeds 2,4,6,8, and 10. Include 
   in your document the number of steps in each case and calculate
   the average number of steps for the original repository and for the
   sorted repository. Please comment on the results and explain
   them if possible.

Please complete your design by Monday Sep 24 and development by 
Wednesday Sep 26 (this will not be delivered or graded).

Submission date of complete project (including original documented
code, design, and results) is: Monday, October 1, 12pm.

Submission is accomplished by e-mailing a tar file that
contains the source, the design document, and files containing
the results (not the executables) to cs120@cs.jhu.edu .