|
|
|
Fall 2025 Graduate Catalog
|
AMS 542 - Analysis of Algorithms
Techniques for designing efficient algorithms, including choice of data structures, recursion, branch and bound, divide and conquer, and dynamic programming. Complexity analysis of searching, sorting, matrix multiplication, and graph algorithms. Standard NP-complete problems and polynomial transformation techniques.
3 credits
Grading Letter graded (A, A-, B+, etc.)
Cross-Listed This course is offered as both AMS 542 and CSE 548 .
|
|