The topics to be covered in this course include, but are possibly not limited to, the following (unordered) list. For additional information, please contact Dr. Eggen.

• Sorting
• Searching
• Numerical applications
• Linear algebra
• Linked data structures, lists, trees, etc.
• Hashing
• Trees, AVL trees, B-trees, B+-trees, Red Black trees, 2-3 trees, etc.
• Queue, heap, priority queue, binary heap
• Advanced topics

Return to Dr. Eggen's Home Page