Analysis of Algorithms and Data Structures

Data structures are organized containers of information designed for efficient access or updates. This course provides a comprehensive introduction to the design, analysis, and implementation of non-linear data structures and algorithms that operate on them. The concepts are language-independent but we use C++ for implementations.

Upon successful completion of the course, students will be able to:

Topics include asymptotic analysis, binary trees, sorting, search trees, graph algorithms, dynamic programming, and NP-completeness.

Drue Coles
Mathematical and Digital Sciences
Bloomsburg University of Pennsylvania