|
Dec 22, 2024
|
|
|
|
2016-2017 Graduate Catalog ARCHIVED CATALOG: CONTENT MAY NOT BE CURRENT. USE THE DROP DOWN ABOVE TO ACCESS THE CURRENT CATALOG.
|
CS 677 - Analysis of Algorithms Credits 3
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.
Notes This course is crosslisted with CS 477. Credit at the 600-level requires additional work.
Prerequisites CS 302 and MATH 351
|
|