Exam Study Outline

1 Write some methods for the ArrayBag and ArraySet
  classes [12 marks]

      See project main for ArrayBag, we did IntArraySet
      on assignment 3

2 Write some methods for the Node<E> class
  (generic version of the IntNodeClass) [9 marks]

      See project main for Node<E>

3 Write some methods for the LinkedBag<E> class
  (it uses the Node<E> class) [8 marks]

      See project main, we dod IntLinkedBag on Assignment 4

4 Write a class that implements the Iterator<E>
  interface [5 marks]

      We did an example in SimpleLinkedList class
      on Assignment 4

5 Write some recursive methods that use the List<E>
  class (list game) [12 marks]

      See project list-game and Assignment 5

6 Write some methods for the DynamicArrayStack<E> class
  [10 marks]

      See stacks-queues project.

7 Write some methods for the LinkedQueue<E> class
  [10 marks]

      See stacks-queues project.

8 Write some methods for the LinkedDeque<E> class that
  uses the DLNode<E> class [4 marks]

      See stacks-queues project.