"Trio"

"Three" member group Clarence Cheng and Kevin Lin

Development Plan

1. Create interface Deque, including methods from the Java API entry for Deque
2. Create class QQKachoo to implement Deque
3. Decide to use linked nodes, an array, or an ArrayList
4. Implement methods from Deque
5. Test methods from Deque

Method List

• addFirst(Card e)
• removeFirst()
• peekFirst()
• addLast(Card e)
• removeLast()
• peekLast()
• isEmpty()
• size()

Method Choices

We chose to implement the adding, removing, and peeking methods for both ends of the array, and the size and isEmpty methods, because those methods are similar to the methods we have created for other types of queues.

Why Nodes?

We are choosing to use a node-based architecture because the only parts of the list we need access to are the front and the end. There will be no need to copy over the list every time its size limit is reached, because there is no size limit. Dequeuing is also faster, since elements do not have to be shifted over, like they do in an array or ArrayList.

To Do

• Wait for more feedback