This course covers the organiztation of data and the algorithms that act
upon them.  The topics of stacks, queues, sets, hash tables, trees, and maps
are introduced.  Fundamentals of algorythm performance are also introduced
with an emphasis placed on time complexity analysis.  Applications to data
structure searching and sorting, memory allocation, and file management
are inlcuded within the context of the Standard Template Library (STL).  It is
assumed that the student is already familar with the C++ language and has
successfully completed at least one Algebra course.
