This course is an introduction to randomized algorithms, and studies the use of "randomized choices" in algorithms. The introduction is both theoretical and practical, and describes a number of efficient randomized algorithms, together with a careful performance estimation.
Some complements on probability theory are included.
Lecture notes (in French) are available. The classical reference is: R. Motwani, P. Raghavan - Randomized Algorithms