CSE 373
3 credits
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. Not for credit in addition to CSE 385.
All of
One of
CSE 113Foundations of Computer Science IC or higher
CSE 150Foundations of Computer Science: HonorsC or higher
CSE 215C or higher
MAT 200Logic, Language and ProofC or higher
MAT 250Introduction to Advanced MathematicsC or higher
CSE or MAT or DAS major
C or higher in: CSE 113 or CSE 150 or CSE 215 or MAT 200 or MAT 250; MAT 211 or AMS 210; CSE 214 or CSE 260; CSE or MAT or DAS major
| Section | Days | Time | Room | Instructor |
|---|---|---|---|---|
| LEC 01 | TuTh | 2:00PM–3:20PM | ENGINEERING 145 WESTCAMPUS | Steven Skiena★ 4.3 |
| LEC 90 · SUNY Korea | MoWe | 9:00AM–10:20AM | Korea OUTOFCNTRY | James Finn |
| Section | Days | Time | Room | Instructor |
|---|---|---|---|---|
| LEC 01 | MoWe | 5:00PM–6:20PM | ENGINEERING 145 WESTCAMPUS | Dominik Kempa★ 1.0 |
| LEC 90 · SUNY Korea | MoWe | 3:30PM–4:50PM | Korea OUTOFCNTRY | Jihoon Ryoo |
Compass