Question

3.Question for further thought Imagine the two-dimensional space {0, 1, . . . , 10).(0, 1, . . . , 10) = (0,0), (0,1),(10, 10)J. We locate a mouse on the (0,0) point and we locate a piece of cheese on the (10, 10) point. We somehow make sure that the mouse will reach the cheese with 20 steps, by either going steps right (for example, from (0, 0) to (0,1)) or by going steps up (for example, from (0,0) to (1,0 (i) In how many ways can the mouse reach the cheese? (ii) If these ways are equally likely, what is the probability that the mouse will go all the way right first (up to (0, 10)) and then all the way up? What is the probability that the mouse will go all the way up and then all the way right? (iii) We locate two mousetraps, such that, if the mouse goes through the points (0, 10) or (10,0), wl be unable to move further. Otherwise, it will reach the cheese and then stop. Suppose that it takes exactly 5 seconds for the mouse to move from one location to the other (for example, from (i,j) to (i,j+1) or to (i+1,j. What is the expected time until the mouse will stop moving (we start counting from the beginning - at the (0,0) point) (to answer this part, consider, as in ii), that al the possible routes are equally likely)?
0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
3.Question for further thought Imagine the two-dimensional space {0, 1, . . . , 10).(0, 1,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Question number 9 player A ends Up match, where the match ut r is (b) How...

    Question number 9 player A ends Up match, where the match ut r is (b) How many possible outcomes for I up with 4 points and B ends up with 3 points? (c) Now assume that they are playing a best-of when either player has 4 points or when 7 games hav ti For example, if after 6 games the score is 4 to 2 in favor of A, then A wins th s fitst are there, such that the...

  • QUESTION 3 (10 Marks) Suppose you are given an array A[0..n 1 of integers, each of...

    QUESTION 3 (10 Marks) Suppose you are given an array A[0..n 1 of integers, each of which may be positive, negative, or zero. A contiguous subarray A|i..j] which includes all the items starting at array index i and ending at array index j is called a positive interval if the sum of its entries is at least zero. For example let A-{-1, 3,-5, 2, 0,-4, 3,-6,-2). Ten A[3, 6) is a positive interval since its sum is 2+0+(-4)+3-1, but Al4,7isnot...

  • 1. (10 marks) (a) Let m events Bi, , Bm form a partition of the sample space Ω and let event A be...

    1. (10 marks) (a) Let m events Bi, , Bm form a partition of the sample space Ω and let event A be any event such that A c S2. Then show that given Bi > 0 for j = 1,.. ., m (b) Considcr a clinical trial where group of paticnts arc trcated for depression. As in many such trials a patient has two possible out- comes, in this study a relapse and no relapse. Refer to a relapse...

  • That All Information and No Further Information. Could Anyone Help Response Part A To D Response...

    That All Information and No Further Information. Could Anyone Help Response Part A To D Response Questions Part A To D In this exercise you will use the Correlation and Regression applet to make scatterplots with 10 points that have correlation close to 0.7. The lesson here is that many patterns can have the same correlation. Always plot your data before you trust a correlation. (a) Stop after adding the first two points. What is the value of the correlation?...

  • 8. (Extra Credits: You can get up to 60% more!) A grid in Cartesian coordinates with...

    8. (Extra Credits: You can get up to 60% more!) A grid in Cartesian coordinates with size 6 x 4 is shown in Figure 2a. We start from the original point (0,0) and repeat moving 1 unit length to the next grid point by either moving up (denoted as U-action or right (denoted as R-action), until we reach the destination point (6,4). Each sequence of such R- and U-actions forms a path. Figure 2b shows an example path of this...

  • [10 marks] Assume that we have two decimal positive numbers A and B. Both numbers have n digits. ...

    [10 marks] Assume that we have two decimal positive numbers A and B. Both numbers have n digits. We want to know what is the minimum number of swaps that we need in order to get from number A to B, where in each swap we choose two digits of a number and simply swap them For simplicity, we assume that A and B do not have the digit 0 in them, and that A and B have the set...

  • 0 3 1116 5 Question 4# An irrigation systern is being laid | 3 0 8 8 5 1 1 down to connect 7 fields. The cost of the pi...

    0 3 1116 5 Question 4# An irrigation systern is being laid | 3 0 8 8 5 1 1 down to connect 7 fields. The cost of the pipelines1 8 0 9 10 1 9 between field i and field j is given by the matrix at right 18 902 4 5 1 5 10 207 6 11147 0 2 Find a set of pipelines that connects all fields at a minimal cost. Branching is allowed. 519542 0 3...

  • Question 5 (1 point) userGuess ← 0, secretNumber ← 5 PRINT “Enter a number between 1...

    Question 5 (1 point) userGuess ← 0, secretNumber ← 5 PRINT “Enter a number between 1 and 10” READ userGuess WHILE (userGuess < 1 OR userGuess > 10) PRINTLINE “That is not between 1 and 10. Try again.” READ userGuess ENDWHILE IF (userGuess == secretNum) THEN PRINTLINE “That’s right! ”, userGuess, “ is the secret!” ELSE PRINTLINE userGuess, “ is not the secret!” ENDIF What is the first WHILE loop being used for? Question 5 options: Input validation Random number...

  • Question 2 In the minimum grid-path problem we are given a two-dimensional grid, where each point...

    Question 2 In the minimum grid-path problem we are given a two-dimensional grid, where each point on the grid has a value, which is a non-negative integer. We have to find a path from the top left corner of the grid to the bottom right corner, where each single step on the path must lead from one grid point to its neighbour to the right or below. The cost of the path is the sum of all values of the...

  • Discretization, ODE solving, condition number. Consider the differential equation 5y"(x) - 2y'(x) +10y(x)0 on the interval x E [0,10] with boundary conditions y(0)2 and y (10) 3 we set up a f...

    Discretization, ODE solving, condition number. Consider the differential equation 5y"(x) - 2y'(x) +10y(x)0 on the interval x E [0,10] with boundary conditions y(0)2 and y (10) 3 we set up a finite difference scheme as follows. Divide [0,10] into N-10 sub-intervals, i.e. {xo, X1, [0,1,. 10. Denote xi Xo + ih (here, h- 1) and yi E y(x). Approximate the derivatives as follows X10- 2h we have the following equations representing the ODE at each point Xi ,i = 1,...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT