COSC 202 - Data Structures and Algorithms

Introduces foundational methods in the design and analysis of information-processing and problem-solving techniques. Asymptotic time and space complexity are used as an evaluation framework throughout. Data structures include maps, trees, and heaps. Algorithmic approaches include greedy, divide-and-conquer, dynamic programming, and dealing with intractability. Graphs are used extensively, and important graph problems and their algorithms are examined closely.

Credits: 1
Corequisite: COSC 202L
Prerequisites: COSC 102 (Juniors and Seniors must also be declared majors or minors to register)
Major/Minor Restrictions: None
Class Restriction: None
Area of Inquiry: Natural Sciences & Mathematics
Liberal Arts Practices: Quantitative and Algorithmic Reasoning
Core Component: None

Click here for Course Offerings by term