CSE385
Course  CSE385  
Title  Analysis of Algorithms: Honors  
Credits  4  
Course Coordinator 
Michael Bender 

Description 
Algorithmic design and analysis for Computer Science Honors students. Mathematical analysis of a variety of computer algorithms including searching, sorting, matrix multiplication, fast Fourier transform, and graph algorithms. Time and space complexity. Upperbound, lowerbound, and averagecase analysis. Randomization. Introduction to NP completeness. Some machine computation is required for the implementation and comparison of algorithms. 

Prerequisite 
CSE 260; AMS 210 or MAT 211; Computer Science Honors Program or Honors College or WISE 

Course Outcomes 


Textbook 
Introduction to Algorithms, Third Edition 

Major Topics Covered in Course 


Laboratory Projects 
N/A 

Course Webpage 