This quiz has sections regarding:

• Generics
  • MyStack
  • Group
  • SortedGroup
  • GenericUtils - Difficult
  • ComparableTreeSet - Very Difficult

• The purpose of this class is to implement a proper Stack.

• void push(T value)
• T peek()
• T pop()
• Boolean isEmpty()

• The purpose of this class is to create a generic wrapper for a List object

• Integer count()
• void insert(T value)
• Boolean has(T value)
• T fetch(int indexOfValue)
• void delete(T value)
• void clear()
• Iterator<T> iterator()

• The purpose of this class is to create a generic wrapper for sorted List object.

• insert(T value)
• delete(T value)
• Integer indexOf(T value)

• The purpose of this class is to create a procedure to generate the power set of an Set of objects.

• <T extends Comparable> Iterable<? extends Iterable<T>> powerSet(Set<T> originalSet)
• <T extends Comparable> Iterable<? extends Iterable<T>> powerSet(T... originalSet)

• The purpose of this class is to create subclass of a TreeSet<T> which can compareTo other objects of the same type.
• This shit is hard.

• int compareTo(ComparableTreeSet<T> o)