A study of abstract data types including trees, hash tables, and graphs. A study of the analysis of algorithms, algorithm design techniques, and the study of computational complexity and levels of intractability.
- Prerequisite: CS 132 and MA 208.
- Credits: 3
- Offered: Spring