| CSE 373 |
|
Back to CSE Courses |
| Course | CSE373 |
| Title | Analysis of Algorithms |
| Credits | 3 |
| 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. |
| Prerequisite |
AMS 210 or Mat 211; CSE 214 or CSE 260 |
| Course Outcomes |
|
| Textbook |
|
| Major Topics Covered in Course |
|
| Laboratory Projects |
Not applicable since it is a theory course. |
| Course Webpage | /~cse373 |
