Four cities A, B, C, D sit at the vertices of a square ABCD, connected by roads forming the four sides. If Mr. Rand Walker is at city in period , then in period he moves, with probability each, to one of the two vertices adjacent to . If he is at city A at time , the respective probabilities that he is at A, B, C, D in period are:
Tap an option to check your answer.
Checking your account…
Four cities A, B, C, D sit at the vertices of a square ABCD, connected by roads forming the four sides. If Mr. Rand Walker is at city i in period t, then in period t+1 he moves, with probability 1/2 each, to one of the two vertices adjacent to i. If he is at city A at time t=0, the respective probabilities that he is at A, B, C, D in period t=10 are: (A) 1/4, 1/4, 1/4, 1/4 (B) 0, 1/2, 0, 1/2 (C) 1/2, 0, 0, 1/2 (D) 1/2, 0, 1/2, 0
Probability and Bayes' theorem has come up 190 times in 7 exams since 2004.
This question is on Markov chains and random walks, part of Probability and Bayes' theorem in Statistics.
Probabilities when the next step depends only on the present state.
TestStop has 6 past-paper questions on this subtopic.
Question from the DSE 2016 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.