The course will cover a range of topics where randomized algorithms play essential roles. Tentative topics include Randomized Rounding in Approximation Algorithms, Randomized algorithm in metric embedding and streaming algorithms. We will probably cover some tools in designing and analyzing randomized algorithms, including Lovasz Local Lemma and some concentration of measure results like Chernoff bounds, Martingales inequalities and Talagrand isoperimetric inequalities.