CS 353
Analysis of Algorithm Complexity
University of Wisconsin-La Crosse · UGRD · Fall 2026
1 section
Catalog description
An in-depth analysis of the computational complexity of a wide range of algorithms for problems of fundamental importance to computer science. Algorithms to be examined include: sorting, pattern matching and various graph algorithms. Prerequisite: CS 340 ; MTH 207 . Offered Fall - Even Numbered Years.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #wisconsin_la_crosse-0429Fall 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?