Set 1 - Coupon Collector, Quick Sort and Randomized Median. Simulation of the Coupon Collector problem, compared against the expected n ln n. Plots of the number of comparisons made by randomized Quick Sort, and the comparisons needed by the Randomized Median algorithm as n grows.
Set 2 - Balls & Bins and Hamiltonian Cycles. Maximum load in the n-balls/n-bins experiment against its high-probability lower and upper bounds. Implementation of the two-stage randomized algorithm that finds Hamiltonian cycles in large random G(n,p) graphs, with a check that each cycle is valid.
Set 3 - Max-Cut and Concentration of Empty Bins. Randomized and deterministic Large-Cut algorithms on random G(n,p) graphs. How tightly the number of empty bins in the m-balls/n-bins experiment clusters around its expected value.
Set 4 - Johnson-Lindenstrauss Lemma and Randomized 2-SAT. Random projection of high-dimensional data, checking empirically how often pairwise distances stay within 1 ± ε. Implementation of the randomized 2-SAT algorithm on randomly generated clauses.