It is time for you to demonstrate your skills in a project of your own choice. You must DESIGN, ANALYSE AND CODE any method for the GENERIC MyLinkedList class that will manipulate the linked list. You can decide yourself what it should be following the specification below:

1. Purpose: The method must make logical sense – it should be of some purpose to somebody. You should describe in the text who will use the method for which purpose.

2. Clearly explain the problem. Then clearly explain how your method will solve it.

3. Test program: Test the method using a wrapped class like Integer however you will get extra mark if you can test it with the new classes you created in I_Do1 and I_Do2.

Note: i. No code that does not compile will be mark – simplify your program until you have something that compiles. ii. You mark will depend on the level of difficulty [see marking scheme below].

The marking scheme indicating a basic pass requirement and a distinction requirement:

Basic pass requirement Test Class (10)

Declare linked list used Place object in the linked list. Test special case 1 Test special case 2 Test special case 3 Use Wrapper class/Use own created class Method creativity (10)

Single for loop using one pointer similar to method done in class More than one pointer similar to example done in class. Creative method that make cleaver use of pointers to manipulation linked list to do something creative.