COMPSCI 450
Theory of Algorithms
University of Wisconsin-Green Bay · UGRD · Fall 2026
1 section
Catalog description
Design, analysis and comparison of algorithms; divide and conquer techniques, greedy method, dynamic programming and smart searching. Applications to optimization with constraints and decision problems. Theory of computability including examples of NP-complete problems such as the "traveling salesman" problem. P: COMP SCI 351 with at least a C grade, and MATH 202 with at least a C grade Spring.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #wisconsin_green_bay-0357Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?