|CSE 373||Back to CSE Courses|
|Title||Analysis of Algorithms|
|Course Coordinator||Steven S. Skiena|
|Current Catalog Description||
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.
AMS 210 or Mat 211; CSE 214 or CSE 260
|Major Topics Covered in Course||
Not applicable since it is a theory course.