Course Description

• A course in advanced data structures and high-level algorithms.
• Varied uses of recursion.
• Graph representations and algorithms including traversals, path finding, closure, and spanning trees.
• Sorting files.
• Weighted and balanced trees;
• Hashing and collision handling.
• Complexity and analysis of algorithms.

Prerequisites

• Computer Science 102 or equivalent

Classes

3 lecture hours
3 semester hours