OUTLINE FOR COSC 2006 TEST
   ==========================

   Question 1: Bag<E> interface and DynamicBag<E> class

   Question 2: Array<E> interface and DynamicArray<E> class

   Question 3: Set<E> interface with TreeSet and HashSet classes

   Question 4: Map<K,V> interface with HashMap class

   You should know the Iterator<E> interface (hasNext(), next())
   and the for each loop for traversals.

   Summaries of the Bag<E>, Array<E>, Set<E> and Map<K,V>
   interfaces will be provided.

   Questions will ask you to write a method or some statements to
   do something.


Interface summaries
===================

The Bag interface
-----------------

public interface Bag<E>
{
   int size();
   boolean isEmpty();
   boolean add(E element);
   boolean remove(E element);
   boolean contains(E element);
}


The Array interface
-------------------

public interface Array<E>
{
   int size();
   boolean isEmpty();
   boolean add(E element);
   E get(int index);
   void set(int index, E element);
   void add(int k, E element);
   E remove(int k);
}


The Set interface
-----------------

public interface Set<E>
{
   int size();
   boolean isEmpty();
   boolean add(E element);
   boolean contains(Object element)
   Iterator<E> iterator();
   boolean remove(Object obj);
}


The Map interface
-----------------

public interface Map<K,V>
{
   int size();
   boolean isEmpty();
   boolean containsKey(Object key);
   V get(Object key);
   V put(K key, V value); // put new key value pair into map
   Set<K> keySet(); // return keys as a set
   // ... Other methods not needed
}


Useful result

System.arraycopy(Object source, int sourceIndex, Object dest, int destIndex,
   int n);

Here source is a reference to the source array, 
sourceIndex is the starting index in the source array,
dest is a reference to the destination array, 
destIndex is the starting index in the destination array,
and n is the number of array elements to copy.