University of Michigan

WINTER 2014

EECS301: Homework 2
Assigned: January 23, 2014 Due: January 29, 2014 at 5PM in the EECS301 Box in EECS 4230 (EE-Systems oce) Text: Probability, statistics and random processes for electrical engineering by Alberto LeonGarcia (third edition) Reading assignment: Please read Chapter 1 and Chapter 2 till Section 2.3. Advice: For all questions asked in this course, unless the question is simply asking about definitions, please justify all answers. Stating the correct answer without justication will earn no credit. For example, if you write down a string of equations, each successive equation should be accompanied by some justication such as by the additivity axiom or because the outcomes are equally likely or by the distributive property of set operations. Extra Reading: If you want to solve more problems (than what is given here), you can look at Chapter 1 and 2 of book by Ross and Section 1.6 of book by Bertsekas and Tsitsiklis. These books are on course reserves in the library. 1. Elevator Problem [15 points each] Twelve people enter an elevator at the basement of an empty building with 50 oors above. Assume that each person selects a oor to exit with equal probability, and the selection of each person does not inuence that of the others. What is the probability that exactly 4 people get out on either oor 49 or 50 ? What is the probability that exactly 4 people get out on at least one of oors 48, 49 and 50 ? What is the probability that the elevator makes exactly 4 stops where exactly 1, 2, 3 and 4 persons get out (not necessarily in that order)? Example: A realization of the experiment is as follows: the elevator makes stops at oors 5, 21, 37 and 49, where 3, 2, 4 and 1 persons get out, respectively. 2. Dice problem [15 points] 10 fair dice are rolled. Find the probability of observing at least 4 ves, and at least 4 fours. 3. G4 problem [15 points] The presidents and their wives of USA, Canada, Argentina and Brazil are meeting in Ann Arbor for a dinner party. They are randomly seated at a circular table having 8 chairs. What is the probability that at least one North American wife is sitting next to her husband ? 4. Sampling into buckets [15 points] Suppose there are n distinct objects and k buckets. Assume the i-th bucket can hold ri objects. An experiment consists of selecting objects and placing them in buckets (without replacement) until all buckets are lled to capacity. Thus a total of r = r1 + + rk objects are selected (assume r n). The order in which objects are placed into buckets is not recorded, but each bucket has a distinct label. What is the total number of distinguishable outcomes of the experiment? Use the counting principle to derive a formula in terms of n, r, r1 , . . . , rk .

5. Password Problem [10 points] Joe wants to create an 8-letter password for his computer, where each character can take values from letter a through letter d, and from number 1 through 4 without any repetition. In other words, each character can take one of 8 possibilities. Find the number of distinct passwords that can be made with no two numbers appearing together.