CS 574

Fall 2025 Part of Term 1

Part of Term 1
Aug 25-Dec 10

Randomized Algorithms

SHOW FINAL EXAM SCHEDULE

Credit: 4 hours.

Basic and advanced concepts in the design and analysis of randomized algorithms. Sampling; concentration inequalities such as Chernoff-Hoeffding bounds; probabilistic method; random walks, dimension reduction; entropy; martingales and Azuma's inequality; derandomization. Randomized algorithms for sorting and searching; graphs; geometric problems. Basics of pseudorandomness and randomized complexity classes.

Prerequisite: One of CS 473, CSE 414, or MATH 473; one of MATH 461, MATH 463 or STAT 400.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 574 class schedule data for fall 2025
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	65259	Lecture-Discussion	R	9:30AM -10:45AM	WF	0216 Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 08/25/25-12/10/25 Credit: 4 hours Restriction(s): Restricted to Graduate - Urbana-Champaign. Not intended for MCS: Computer Sci OFF - UIUC, MCS:Computer Sci Online -UIUC, or NDEG:Computer Science Onl-UIUC. Not intended for First Time Freshman students.