CSE373
Course  CSE373 
Title  Analysis of Algorithms 
Credits  3 
Course Coordinator 
Steven S. Skiena 
Description 
Mathematical analysis of a variety of computer algorithms including searching, sorting, matrix multiplication, fast Fourier transform, and graph algorithms. Time and space complexity. Upperbound, lower bound, and averagecase 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 
CSE 150 or CSE 215 or MAT 200 or MAT 250; AMS 210 or MAT 211; CSE 214 or CSE 260; CSE or MAT major 
Course Outcomes 

Textbook 
Steven Skiena, The Algorithm Design Manual, second edition, SpringerVerlag, 2008. 
Major Topics Covered in Course 

Laboratory Projects 
Not applicable since it is a theory course. 
Course Webpage 