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. Upper-bound, lower-bound, and average-case analysis. Randomization. Introduction to NP completeness. Some machine computation is required for the implementation and comparison of algorithms. |
Prerequisite |
CSE 150 or CSE 215 or MAT 200 or MAT 250; AMS 210 or MAT 211; CSE 214 or CSE 260; Computer Science Honors Program or the Honors College or the WISE Honors Program or University Scholars. |
Course Outcomes |
|
Textbook |
None |
Major Topics Covered in Course |
|
Laboratory Projects |
N/A |
Course Webpage |