3 credits
Fall 2025 Lecture Upper DivisionData from last updated 10/3/2025
Fall 2025
Fall 2025 Instructors:
Basic techniques for designing and analyzing algorithms: dynamic programming, divide and conquer, balancing. Upper and lower bounds on time and space costs, worst case and expected cost measures. A selection of applications such as disjoint set union/find, graph algorithms, search trees, pattern matching. The polynomial complexity classes P, NP, and co-NP; intractable problems.
Course CS 580 from Purdue University - West Lafayette.Prerequisites
One of
Student attribute GR
Restrictions
BoilerCoursesis an unofficial catalog for Purdue courses
made by Purdue students.
made by Purdue students.