SUNY Korea Computing Society
CSE 373 - Analysis of Algorithms
CSE 373 - Analysis of Algorithms
Mathematical analysis of a variety of computer algorithms including searching, sorting, matrix multiplication, fast Fourier transform, and graph algorithms. Time and space complexity. Upper-bound, lower- bound, and average-case analysis. Introduction to NP completeness. Some machine computation is required for the implementation and comparison of algorithms. This course is offered as CSE 373 and MAT 373.
| Details | Description |
|---|---|
| Credits | 3 |
| Prerequisites | C or higher in MAT 211 or AMS 210; CSE 214 or CSE 260 |
| Coordinator | Jihoon Ryoo |
Course Outcomes
Ability to perform worst-case asymptotic algorithm analysis Ability to define and use classical combinatorial algorithms for problems such as sorting, shortest paths and minimum spanning trees Knowledge of computational intractability and NP completeness
Course Topics
| Topic | Materials |
|---|---|
| No topics added |
Textbooks
Steven Skiena, The Algorithm Design Manual, second edition, Springer-Verlag, 2008.
Edit this page on GitHub