A continuation of the study of data structures begun in CS 210 with emphasis on the design and analysis of algorithms. Also, an introduction to questions of efficiency and NP completeness.

OWU Units: 1.00. Crosslisting(s): None. Prerequisite(s): CS 210 and one of CS 220 or MATH 250 . Corequisite(s): None. Antirequisite(s): None. Fee: None. Core Competency: None. Offered: Alternating Years (Fall Semesters). Next offered in 2025-2026, 2027-2028.