| |
Apr 05, 2026
|
|
|
|
|
2025-2026 Undergraduate Catalog
|
CS 477 - Analysis of Algorithms
Analysis of the time and space complexity of algorithms. Techniques for efficient algorithm design and effect of structure choice on efficiency. Fast algorithms for problems such as set, graph and matrix manipulations, pattern matching, sorting, and storage organization. Exponential time problems and introduction to NP-completeness.
Credits: 3
Prerequisites: and MATH 251 . Prerequisites must be completed with a grade of C or better. The maximum number of attempts for this course is three, including earned grades, withdrawals, and audits.
Notes: This course is crosslisted with CS 677. Credit at the 600-level requires additional work.
|
|