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

• Introduction
• Arrays, One and Two Dimensional
• Dynamic Allocation
• Structures
• Stacks
• Stack Applications
• Recursion
• Applications of Recursion
• Queues
• Linked Lists
• Array Implementation of Linked Lists
• Dynamic Implementation of Linked Lists
• Applications of Linked Lists
• Generalizations of Linked Lists
• Stacks Revisited
• Queues Revisited
• Trees
• Binary Trees
• Huffman Encoding
• Applications of Trees
• Sorting
• Bubble Sort
• Insertion Sort
• Selection Sort
• Quicksort
• Heapsort
• Mergesort
• Treesort
• Shell's Improvement of Sorting Algorithms
• Analysis of Algorithms
• Searching
• Sequential Search
• Binary Search
• Binary Search Tree
• Insertion and Deletion from a Binary Search Tree
• Generalizations
• Tree Balancing
• Hashing
• Graph Theory

Return to Dr. Eggen's Home Page