Question 1

  1. Calculate expectation and variance of each dice: Dice :

    Dice :

  2. Calculate p.m.f. for their sum :

    1 & 2 & 4 & 5 & 6 & 7 & 9 \\ 2 & 3 & 5 & 6 & 7 & 8 & 10 \\ 3 & 4 & 6 & 7 & 8 & 9 & 11 \\ 4 & 5 & 7 & 8 & 9 & 10 & 12 \\\end{matrix}$$ | $k$ | $2$ | $3$ | $4$ | $5$ | $6$ | $7$ | $8$ | $9$ | $10$ | $11$ | $12$ | | ------------ | --- | --- | --- | --- | --- | --- | --- | --- | ---- | ---- | ---- | | $p_(x+y)(k)$ | $\frac{1}{36}$ | $\frac{2}{36}$ | $\frac{3}{36}$ | $\frac{4}{36}$ |$\frac{5}{36}$ | $\frac{6}{36}$ | $\frac{5}{36}$ | $\frac{4}{36}$ |$\frac{3}{36}$ | $\frac{1}{36}$ | $\frac{1}{36}$ |
  3. Verify that for this pair of dice. Find from the new p.m.f.:

    in the p.m.f. so we know that it is .

    There is symmetry over

    Or otherwise: Hence, . As from earlier,

Question 2

  1. Draw computational tree for on input :

  2. Calculate probability that accepts :

  3. Calculate expected termination time of on input : (we add the probabilities of expected steps and then find expectation)

Question 3

If run times:

  1. What is probability that the algorithm returns correct answer all times?
  2. What is probability the algorithm returns correct answer more often than not? See 4-7. Four ways of selecting items. Either , , or are correct:
    • correct:
    • correct: The probability is:
  3. Design a poly-time Monte Carlo algorithm that has a probability of returning correct answer at least 90% of the time. Recommendation is to write a script for brute force.

    There is a mathematical proof that will be released on solutions.