CSE203: Randomized Algorithms

Course on randomized algorithms, meant for graduate students with a good mathematical background. Students need familiarity with discrete math, analysis of algorithms, basic analysis, probability theory, and graph theory.

Prerequisite(s): CSE 201. Students need a solid background in analysis of algorithms, discrete math, probability theory, graph theory, and overall mathematical maturity. Enrollment is restricted to graduate students. Undergraduates with a good understanding of the material in CSE 101, CSE 102, and CSE 103, and real analysis can enroll with permission of the instructor.

5 credits

Year	Fall	Winter	Spring	Summer

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.