DOC PREVIEW
Berkeley COMPSCI 70 - Problem Set

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

U.C. Berkeley — CS70: Discrete Mathematics and Probability Problem Set 10Lecturers: Umesh Vazirani & Christos H. Papadimitriou Due November 13, 2006 at 4:00pmProblem Set 101. Independence(a) Show that, for independent random variables X, Y , we have E[XY ] = E[X]E[Y ] (Hint: Showfirst that, even if the r.v.’s are not independent, E[XY ] =PaPbab · Pr[X = a ∧ Y = b].)(b) Give a simple example to show that the conclusion of part (a) is not necessarily true when X andY are not independent.2. Pairwise IndependenceThis problem illustr ates that events may be pairwise independent but not mutually independent. Twofair dice are thrown. Consider the following three events: A = the fir st die is odd; B = the second die is odd;C = the sum of the dice is odd.(a) Show by directly counting s ample points that events A, B are independent; that B, C are inde-pendent; and that A, C are independent.(b) Show that the three events are not mutually independent.3. Variance(a) Let X and Y be independent r andom variables. Express V ar(X − Y ) in terms of V ar(X) andV ar(Y ).(b) Given a rando m varia ble X with E(X) = µ and V ar(X) = σ2, let the random variable Y = XZwhere Z is defined as follows: Flip a fair coin. If it comes up H, then Z = 1, otherwise Z = −1.Find V ar(Y ).4. ChebyshevEach pixel in a 32 × 8 display is turned on o r off with equal probability. The display shows a horizontalline if all 8 pixels in a given row are turned on. Let X denote the number of horizontal lines that thedisplay s hows.• What is E[X]?• What is V ar[X]?• how that P r[X ≥ 2] ≤ 1/25.5. RunsA biase d coin is tossed n times, and heads shows with probability p on e ach toss. A ru n is a maximalsequence of throws which result in the same outcome, so that, for example, the se quence HHT HT T Hcontains five runs.• Show that the expected number of runs is 1 + 2(n − 1)p(1 − p).1• What is the varia nce of the number of runs?6. Extra C reditI think of two dis tinct real numbers between 0 and 1 but do not reveal them to you. I now chooseone of the two numbers at random and give it to you. Can you give a procedure for guessing whetheryou were shown the smaller or the larger of the two numbers, such that your g uess is correct withprobability strictly gre ater than 0.5 (although exactly how much better than 0.5 may depend on theactual values of the two


View Full Document

Berkeley COMPSCI 70 - Problem Set

Documents in this Course
Notes 1

Notes 1

12 pages

Note 2

Note 2

6 pages

Notes

Notes

6 pages

Notes

Notes

7 pages

Note 10

Note 10

8 pages

n20

n20

10 pages

n19

n19

10 pages

n18

n18

10 pages

n17

n17

6 pages

n16

n16

9 pages

n15

n15

10 pages

n14

n14

9 pages

n13

n13

6 pages

n12

n12

7 pages

n11

n11

6 pages

n10

n10

8 pages

n9

n9

5 pages

n8

n8

7 pages

n7

n7

8 pages

n6

n6

5 pages

n5

n5

8 pages

n4

n4

7 pages

n3

n3

10 pages

n2

n2

7 pages

n1

n1

5 pages

Load more
Download Problem Set
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Problem Set and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Problem Set 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?