2.11 You start with five dice. Roll all the dice and put aside those dice that come up 6. Then, roll the remaining dice, putting aside those dice that come up 6. And so on. Let X, be the number of dice that are sixes after n rolls. (a) Describe the transition matrix P for this Markov chain. (b) Find the probability of getting all sixes by the third play. (c) What do you expect P00 to look like? Use technology to confirm your answer.

2.11 You start with five dice. Roll all the dice and put aside those dice that come up 6. Then, roll the remaining dice, putting aside those dice that come up 6. And so on. Let X, be the number of dice that are sixes after n rolls. (a) Describe the transition matrix P for this Markov chain. (b) Find the probability of getting all sixes by the third play. (c) What do you expect P00 to look like? Use technology to confirm your answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question A Locker can be opened by A and B when they are both there, as the locker has two keys, one of which is with A and other with B. C has both the keys, but he is permitted to open the locker only when B is not there. show that locker can be opened always if both A and C are there. Give boolean identify that symbolises this situation.
From the question 1, given P(D|M) = P(M|D)P(D) p(M) solve the following a. Draw the probability tree for the situation.
P(M|D)P(D) given P(D|M) = solve the following p(M) а. Draw the probability tree for the situation. b. Draw the reverse tree for the situation.
Let X N(3,9) and consider Y = -5 X + 4. Which of the following describes the distribution of Y? Y-N(19, 225 ) OY-N(-11,45 ) OY-N(-11, 225 ) OY-N(-11,-41) Y N(-15, -45) Y-N(7,-45)
7. Let X be a random variable with expectation EX <∞o. Prove that Var(X) = E(X²) – E(X)².
Problem 7: Use Wang's algorithm to answer whether or not Mary will go to the party, given that: If Bob goes to the party, then Anna goes (B → A). If Mary goes to the party, then Bob goes (M → B). Anna will not go to the party (not A). Show all the steps clearly stating the rule applied at each step.
Consider the joint probability distribution on the right. a) What is P(A = false)? Show your work. b) What is P(A=true or B=true)? Explain. c) What is P(A=true|C=false)? d) Are A and C independent? Why?
The following Markov model of the weather assumes that the weather on day t is influenced by the weather on day (1-1). It is sunny today. What is the probability that it will stay sunny for three mare days? Please show your work. Also give your final result with three significant digits. You don't need to upload a fie T = 0.4 Sunny 0.75 0.3 0.25 T = 0.6 Rainy 0.7
3. Suppose that we want to know which agents are connected by a walk of length two in a given network. That is, want to know the set of ordered pairs (i, j) such that there exists a walk of length 2 between any i and j. Define n as the number of nodes and m as the number of links. (a) One way to do this is to input the adjacency matrix A, calculate A², then output all pairs (i, j) for which A(i) > 0. Defining scalar multiplication and addition as "basic operations," up to a constant c, how many "basic operations" are required to calculate A², in terms of n and m? (Hint: First think about how many operations are required to calculate each entry of A², then multiply by the number of entries.) (b) Suppose that we want to know the number of agents who are connected by a walk of length k in a given network, where k≥ 1. Up to a constant, how many basic operations are required to calculate Ak, in terms of n and m? (c) (Harder) We showed in class (Lecture 4) that a simple adaptation of…
Please give handwritten
Explain the “memoryless” property of the exponential distribution.