|
Dec 21, 2024
|
|
|
|
2017-2018 Undergraduate Catalog ARCHIVED CATALOG: CONTENT MAY NOT BE CURRENT. USE THE DROP DOWN ABOVE TO ACCESS THE CURRENT 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 . Prerequisites must be completed with a grade of C or better. Notes This course is crosslisted with CS 677. Credit at the 600-level requires additional work.
|
|