COSC-052: Computer Science II
Project 4
Spring 2017
Due: W 4/12 @ 5 PM
10 points
This project involves implementing a List ADT using a doubly-linked list.
To traverse the elements of the List, we will implement an iterator.
- You can use the implementation of Deque<T> from p3
as the basis for the implementation of List<T>.
You can also use the Makefile from p3 for this project, with the
appropriate modifications.
- The design of
List<T>
is inspired by the design of Java's
LinkedList<T>
and the design of
ListIterator<E>
is inspired by the design of Java's
ListIterator<E>
- We did the dirty work of producing documentation for these two
classes, which you can use as design documents:
[ html | pdf ].
Also see list.txt and
iterator.txt, which contain the public
interfaces of the class definitions.
Instructions for Electronic Submission:
In a file named HONOR, please include the statement:
In accordance with the class policies and Georgetown's Honor Code,
I certify that, with the exceptions of the class resources and those
items noted below, I have neither given nor received any assistance
on this project.
Include this file in your zip file submit.zip.
Submit p4 exactly like you submitted p3.
Plan B
If something goes wrong with Autolab, upload your zip file to
Blackboard.
Copyright © 2019 Mark Maloof. All Rights Reserved.
This material may not be published, broadcast, rewritten,
or redistributed.