- About Us
- Helpful Links
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. This course is offered as both AMS 542 and CSE 548.
3 credits, ABCF grading
THIS COURSE IS STAFFED AND SCHEDULED BY THE COMPUTER SCIENCE DEPARTMENT.
Text: Introduction to Algorithms. by Cormen, 3rd Edition. Triliteral