Lecture 23

Learning objectives

After this class, you should be able to:

1. Explain the idea behind the better randomized selection algorithm.
2. Prove the Markov and Chebyshev inequalities.

Reading assignment

1. Class notes and section 3 of http://www.csee.wvu.edu/~ksmani/courses/fa01/random/lecnotes/lecture4.pdf.
2. Review statistics from Appendix A of the above URL.

Exercises and review questions

• Questions on current lecture's material
  1. Give tight examples for Markov and Chebyshev inequalities.

• Questions on next lecture's material
  1. None.