• have a thorough understanding of commonly used library data structures.

Create a class called DoublyLinkedList<E> that implements the List<E> interface. Your class should store elements of the collection in a doubly linked list. You may provide dummy implementations for the following methods:

• hashCode() (here you can just inherit the implementation from Object)
• iterator()
• listIterator()
• listIterator(int index)
• subList()

It is likely that this class will be used in at least one future lab project.

You should indicate how much time you spend on this assignment in the FAST system. You are encouraged to log your activity as you work on the project. At a minimum, you should log all of the time spent during the first week before the due date given above.

Here is a template file to use as a starting point for this report.

Your report should include:

• Your reaction (a couple of paragraphs on what you learned and what you thought about while working on this assignment, including the most surprising thing that you forgot since you last programmed, and had to relearn to do this assignment)
• An analysis of the asymptotic time complexity for each method in the DoublyLinkedList class.
• A discussion of how you tested your class implementation to ensure that it is defect free.
• Results from a test program that calls each method at least once.
• The Documented source code for your program.

As with any report you submit, correct spelling and grammar are required. In addition, your report should be submitted electronically following the Electronic submission guidelines. (You may wish to consult the XML help video and/or sample report before submitting your report.) Be sure to keep copies of all your files, in case something gets lost.

If you have any questions, consult your instructor.

This assignment was originally developed by Dr. Chris Taylor.

© 2001-2006 Dr. Christopher C. Taylor

Office: CC-36C

Phone: 277-7339