All Classes and Interfaces

Class	Description
AbstractBinaryTree<E>	An abstract base class providing some functionality of the BinaryTree interface.
AbstractHashMap<K,V>	An abstract base class supporting Map implementations that use hash tables with MAD compression.
AbstractMap<K,V>	An abstract base class to ease the implementation of the Map interface.
AbstractMap.MapEntry<K,V>	A concrete implementation of the Entry interface to be used within a Map implementation.
AbstractPriorityQueue<K,V>	An abstract base class to ease the implementation of the PriorityQueue interface.
AbstractPriorityQueue.PQEntry<K,V>	A concrete implementation of the Entry interface to be used within a PriorityQueue implementation.
AbstractProgression	Generates a simple progression.
AbstractSortedMap<K,V>	An abstract base class to ease the implementation of the SortedMap interface.
AbstractTree<E>	An abstract base class providing some functionality of the Tree interface.
AdaptablePriorityQueue<K,V>	Interface for the adaptable priority queue ADT.
AdjacencyMapGraph<V,E>	An implementation for a graph structure using an adjacency map for each vertex.
ArithmeticProgression	A class producing an arithmetic progression of the form start, start+step, start+2*step, ...
ArrayList<E>	Realization of a list by means of a dynamic array.
ArrayMax	Demonstration of a recursive method to find the maximum value in an array.
ArrayQueue<E>	Implementation of the queue ADT using a fixed-length array.
ArrayReverse	Demonstration of recursive method for reversing an array's elements.
ArrayScale	Example of valid and invalid method for scaling a numeric array.
ArrayStack<E>	Implementation of the stack ADT using a fixed-length array.
ArraySum	Example of a static method that analyzes an array
ArraySum	Demonstration of two recursive approaches to computing the sum of an array of integers.
ArraySumForeach	Example of a static method that analyzes an array using for-each loop.
AVLTreeMap<K,V>	An implementation of a sorted map using an AVL tree.
BinarySearch	Simple demonstration of the binary search algorithm.
BinaryTree<E>	An interface for a binary tree, in which each node has at most two children.
BoxedItem	Class for objects that can be sold, packed, and shipped.
BoxedItem2	Class for objects that can be sold, packed, and shipped.
CaesarCipher	Class for doing encryption and decryption using the Caesar Cipher.
ChainHashMap<K,V>	Map implementation using hash table with separate chaining.
CircularlyLinkedList<E>	An implementation of a circularly linked list.
CircularQueue<E>	This provides one additional method not part of the general Queue interface.
CostPerformanceDatabase	Maintains a database of maximal (cost,performance) pairs.
Counter	An integer counter that can be incremented and reset to zero.
CounterDemo	A demonstration of the use of the Counter class.
CreditCard	A simple model for a consumer credit card.
DeepClone	Class to demonstrate a deep clone of a 2D array.
DefaultComparator<E>	Comparator based on the compareTo method of a Comparable element type.
Deque<E>	Interface for a double-ended queue: a collection of elements that can be inserted and removed at both ends; this interface is a simplified version of java.util.Deque.
DiskSpace	Supports the computation of the total disk space usage within a file system.
DoublyLinkedList<E>	A basic doubly linked list implementation.
Edge<E>	An edge of a graph.
Entry<K,V>	Interface for a key-value pair.
EnumDemo	An example that uses an enumerated type.
EnumDemo.Day	An enumerated type for days of the week.
ExceptionDemo	A demonstration of a try-catch structure.
Factorial	Demonstration of recursive factorial function.
FavoritesList<E>	A list of elements, ordered from most frequently to least frequently accessed.
FavoritesList.Item<E>
FavoritesListMTF<E>	A list of elements, ordered from most recently to least recently accessed.
Fibonacci	Demonstration of two recursive approaches to computing Fibonacci numbers.
FibonacciProgression	A class producing a Fibonacci progression from two starting values.
GameEntry	A representation of an entry on a scoreboard.
GenericDemo	A demonstration of a generic function with a parameterized type.
GeometricProgression	A class producing a geometric progression of the form start, start*factor, start*factor*factor, ...
Graph<V,E>	An interface for a graph structure.
GraphAlgorithms	A collection of graph algorithms.
GraphExamples	This class provides a utility to build a graph from a list of edges.
HashMultimap<K,V>	An adaptation of a map into a multimap, by mapping to a list of values.
HeapAdaptablePriorityQueue<K,V>	An implementation of an adaptable priority queue using an array-based heap.
HeapAdaptablePriorityQueue.AdaptablePQEntry<K,V>	Extension of the PQEntry to include location information.
HeapPriorityQueue<K,V>	An implementation of a priority queue using an array-based heap.
InputExample
InsertionSort	Provides an insertion sort implementation for arrays.
InsertionSort	Provides an insertion sort implementation for a PositionalList.
Insurable	Interface for objects that can be insured when shipped.
IteratorDemo
Josephus	The classic Josephus problem as a Case study for a CircularQueue
LCS	Algorithms for computing the longest common subsequence of two character sequences.
LinkedBinaryTree<E>	Concrete implementation of a binary tree using a node-based, linked structure.
LinkedBinaryTree.Node<E>	Nested static class for a binary tree node.
LinkedCircularQueue<E>	Realization of a circular FIFO queue as an adaptation of a CircularlyLinkedList.
LinkedDeque<E>	Realization of a double-ended queue as an adaptation of a DoublyLinkedList.
LinkedPositionalList<E>	Implementation of a positional list stored as a doubly linked list.
LinkedQueue<E>	Realization of a FIFO queue as an adaptation of a SinglyLinkedList.
LinkedStack<E>	Realization of a stack as an adaptation of a SinglyLinkedList.
List<E>	A simplified version of the java.util.List interface.
Map<K,V>	An interface for an associative map which binds a key uniquely to a value.
Maryland
MatchDelimiters	Simplified test of matching delimiters in a string.
MatchHTML	Simplified test of matching tags in an HTML document.
MatrixChain	Demonstration of dynamic programming.
ObjectPair
Pair<A,B>
Partition<E>	A Union-Find structure for maintaining disjoint sets.
PatternMatching	Implementation of several pattern-matching algorithms on character sequences.
Person
Photograph	Class for photographs that can be sold.
Portfolio<T>
Position<E>	An interface for a position which is an abstraction for the location at which a single element is stored in a positional container.
PositionalList<E>	An interface for positional lists.
Power	Demonstration of the more efficient method for computing the power function.
PQSort	Sorting with a priority queue.
PredatoryCreditCard	A demonstration of inheritance.
PrimitiveDemo	A demonstration of primitive types.
PriorityQueue<K,V>	Interface for the priority queue ADT.
ProbeHashMap<K,V>	Map implementation using hash table with linear probing.
Progression	Generates a simple progression.
Queue<E>	Interface for a queue: a collection of elements that are added and removed according to the first-in first-out principle.
RBTreeMap<K,V>	An implementation of a sorted map using a red-black tree.
ReverseWithStack	Case study for using a Stack to reverse a sequence.
Robot	An example of nested conditional statements
Ruler	Provides support for drawing an English ruler.
Scoreboard	Class for storing high scores in an array in nondecreasing order.
Sellable	Interface for objects that can be sold.
SinglyLinkedList<E>	A basic singly linked list implementation.
SortedMap<K,V>	A map with additional support for keys from a total ordering.
SortedPriorityQueue<K,V>	An implementation of a priority queue with a sorted list.
SortedTableMap<K,V>	An implementation of a map using a sorted table.
SplayTreeMap<K,V>	An implementation of a sorted map using a splay tree.
Stack<E>	A collection of objects that are added and removed according to the last-in first-out principle.
StringExperiment	Provides an empirical test of the efficiency of repeated string concatentation versus use of the StringBuilder class.
StringLengthComparator
Student
TestProgression	Test program for the progression hierarchy.
TicTacToe	Simulation of a Tic-Tac-Toe game (does not do strategy).
Transportable	Interface for objects that can be transported.
TraversalExamples	Several applications of tree traversals.
TraversalExamples.Geometric
Tree<E>	An interface for a tree where nodes can have an arbitrary number of children.
TreeMap<K,V>	An implementation of a sorted map using a binary search tree.
TreeMap.BalanceableBinaryTree<K,V>	A specialized version of the LinkedBinaryTree class with additional mutators to support binary search tree operations, and a specialized node class that includes an auxiliary instance variable for balancing data.
TreeMap.BalanceableBinaryTree.BSTNode<E>	A specialized version of Node that includes an auxiliary int for balancing algorithms
Unique3	Demonstration of a recursive (and very bad) solution to element uniqueness problem.
Universe	Our version of the classic Hello World.
UnsortedPriorityQueue<K,V>	An implementation of a priority queue with an unsorted list.
UnsortedTableMap<K,V>	An implementation of a map using an unsorted table.
Vertex<V>	A vertex of a graph.
WordCount	A program that counts words in a document, printing the most frequent.
WrapperDemo	A demonstration of Java's wrapper types.