CSE 203A: Randomized Algorithms

Spring 2026

Announcements:

• First day of class March 30th at noon in WLH 2204.

Homeworks:

• Homework 1 [pdf][LaTeX] and Solutions.
• Homework 2 [pdf][LaTeX] and Solutions.
• Homework 3 [pdf][LaTeX] Due on gradescope Friday May 15th at 11:59pm.

Exams:

• Exam 1 and Solutions
  

Scribe Notes:

Optional LaTeX template

• Lecture 2 (A,B,C)
• Lecture 3 (A)
• Lecture 7 (A,B,C)
• Lecture 8 (A,B,C)
• Lecture 9 (A,B,C)
• Lecture 13 (A,B)
• Lecture 14 (A,B)

Other:

• Course Syllabus
• Lecture podcasts
• Course discord
  
• Archive of problems from past versions of this course
  
• Notes on streaming algorithms (from Jelani Nelson's big data course)
  

Course Description: CSE 203A covers topics on modern advances in the design and analysis of algorithms. This quarter, we will be focusing on randomized algorithms. Topics will include: hashing and fingerprinting algorithms, random walks, concentration bounds, sampling and counting algorithms, and streaming algorithms.