CSE 373Prereq: CSE 215 or MAT 200; AMS 210 or MAT 211; CSE 214 or CSE 260
CSE 373: Analysis of Algorithms
38 ratings across the web · no written reviews yet
Planning Spring 2027? Save classes to your plan.
From 38 ratings across the web
Mostly positive ratings. It's demanding, and good grades are within reach.
No written reviews yet. Yours would be the first.
Took CSE 373? How hard was it?
1 is easy, 5 is hard. Anonymous, no account.
Difficulty
What we know
- From the catalog
- Mathematical analysis of algorithms including searching, sorting, matrix multiplication, fast Fourier transform, and graph algorithms. Time and space complexity, upper-bound, lower-bound, average-case analysis, and introduction to NP completeness.
- Ratings across the web
- 4.0 out of 5 stars4.0from 38 ratings
- Department
- Computer Science
What students say
Be the first to review CSE 373
Six short steps, about two minutes. Anonymous, no account, no email.
Questions students ask
Classes next to CSE 373
CSE courses at Stony Brook with the closest numbers
- CSE 219Computer Science III3.3 out of 5 stars3.3· difficulty 75/100· 58 ratings
- CSE 303Introduction to the Theory of Computation2.3 out of 5 stars2.3· difficulty 69/100· 60 ratings
- CSE 316Fundamentals of Software Development3.4 out of 5 stars3.4· difficulty 71/100· 19 ratings
- CSE 320Systems Fundamentals II3.9 out of 5 stars3.9· difficulty 86/100· 57 ratings
- CSE 337Scripting Languages2.4 out of 5 stars2.4· difficulty 82/100· 40 ratings
- CSE 373Analysis of AlgorithmsThis class
- CSE 416Software Engineering1.4 out of 5 stars1.4· difficulty 80/100· 8 ratings