MATH 303 Midterm: MATH 303 2007 Winter Test 2 sec201
Document Summary
Math 303 sect 201 2007/2008: fill this cover-page with your name and student number, prepare to produce your id upon request. Calculators, books, formula sheets and collaborations are not allowed. (in case of violation your work will be confiscated). This exam has 6 problems (and some blank pages) A markov chain has space state {1, 2, 3, 4, 5, 6} and transition matrix. 0: find the communicating classes, for each state of the chain, write, with a short explanation, if it is transient, null recurrent or positive recurrent, for each state of the chain, write, with a short explanation, the period. Henry has three houses, one in vancouver, one in berlin and one in prague, and he likes to spend some years in each of them. He may change place in the end of the year, and decides his destination according to the following rule:
