{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Sol II - ENGM2032 Applied Probability and Statistics Winter...

This preview shows pages 1–3. Sign up to view the full content.

ENGM2032, Applied Probability and Statistics Winter 2010 Assignment #2: Solutions 1) a) n = 10 8 b) n = 10 9 8 3 = 10 P 8 = 1 , 814 , 400 c) n = (10 9 8 7) (26 25 24 23) = 10 P 4 26 P 4 = 1 , 808 , 352 , 000 d) If we know the first, second, fourth, and seventh character of the code, then we don’t know 4 characters, of which 2 are digits and 2 are roman letters. We also only have 8 digits left to choose from and 24 roman letters. The remaining number of possible codes are n = (8 7) (24 23) = 8 P 2 24 P 2 = 30 , 912 So our chanceof correctly guessing thecorrect codein thenext 1000 guesses is 1000 / 30912 1 / 31. Notice that knowing half of the code increases the probability of guessing the code by a factor of almost 60,000. 2) a) n = 4 2 3 = 24 possible routes from A to D. b) This problem is best addressed by enumerating the possible routes, adding up the average driving times for the route, and then counting those routes with average total driving times below 7.8 hours. Let T ijk be the total average driving time when route i is taken between cities A and B, route j is taken between B and C, and route k is taken between C and D. Then T 111 = 2 . 3 + 3 . 2 + 1 . 8 = 7.3 T 121 = 2 . 3 + 2 . 8 + 1 . 8 = 6.9 T 211 = 2 . 6 + 3 . 2 + 1 . 8 = 7.6 T 221 = 2 . 6 + 2 . 8 + 1 . 8 = 7.2 T 311 = 2 . 1 + 3 . 2 + 1 . 8 = 7.1 T 321 = 2 . 1 + 2 . 8 + 1 . 8 = 6.7 T 411 = 3 . 2 + 3 . 2 + 1 . 8 = 8 . 2 T 421 = 3 . 2 + 2 . 8 + 1 . 8 = 7 . 8 T 112 = 2 . 3 + 3 . 2 + 2 . 4 = 7 . 9 T 122 = 2 . 3 + 2 . 8 + 2 . 4 = 7.5 T 212 = 2 . 6 + 3 . 2 + 2 . 4 = 8 . 2 T 222 = 2 . 6 + 2 . 8 + 2 . 4 = 7 . 8 T 312 = 2 . 1 + 3 . 2 + 2 . 4 = 7.7 T 322 = 2 . 1 + 2 . 8 + 2 . 4 = 7.3 T 412 = 3 . 2 + 3 . 2 + 2 . 4 = 8 . 8 T 422 = 3 . 2 + 2 . 8 + 2 . 4 = 8 . 1 T 113 = 2 . 3 + 3 . 2 + 2 . 1 = 7.6 T 123 = 2 . 3 + 2 . 8 + 2 . 1 = 7.2 T 213 = 2 . 6 + 3 . 2 + 2 . 1 = 7 . 9 T 223 = 2 . 6 + 2 . 8 + 2 . 1 = 7.5 T 313 = 2 . 1 + 3 . 2 + 2 . 1 = 7.4 T 323 = 2 . 1 + 2 . 8 + 2 . 1 = 7.0 T 413 = 3 . 2 + 3 . 2 + 2 . 1 = 8 . 5 T 423 = 3 . 2 + 2 . 8 + 2 . 1 = 8 . 1 and we see that there are 14 different routes having average driving time less than 7.8 hours. c) To answer this problem, we just eliminate those legs of the trip which take more than 3 hours. We are left with 3 routes from A to B, 1 route from B to C, and 3 routes from C to D. Then n = 3 1 3 = 9.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
ENGM2032, Applied Probability and Statistics Assignment #2: Solutions Winter 2010: pg 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern