Exam (elaborations) TEST BANK FOR Probability and Stochastic Processes A Friendly Introduction for Electrical and Computer Engineers 2nd Edition By Roy D. Yates, David Goodman (Solution Manual)

TEST BANK FOR Probability and Stochastic Processes A Friendly Introduction for Electrical and Computer Engineers 2nd Edition By Roy D. Yates, David Goodman (Solution Manual) Probability and Stochastic Processes A Friendly Introduction for Electrical and Computer Engineers SECOND EDITION Problem Solutions September 28, 2005 Draft Roy D. Yates, David J. Goodman, David Famolari September 28, 2005 • This solution manual remains under construction. The current count is that 678 (out of 687) problems have solutions. The unsolved problems are 12.1.7, 12.1.8, 12.5.8, 12.5.9, 12.11.5 – 12.11.9. If you volunteer a solution for one of those problems, we’ll be happy to include it . . . and, of course, “your wildest dreams will come true.” • Of course, the correctness of every single solution reamins unconfirmed. If you find errors or have suggestions or comments, please send email: . • If you need to make solution sets for your class, you might like the Solution Set Constructor at the instructors site . • Matlab functions written as solutions to homework problems can be found in the archive (available to instructors) or in the directory matsoln. Other Matlab functions used in the text or in these homework solutions can be found in the archive or directory matcode. The .m files in matcode are available for download from the Wiley website. Two other documents of interest are also available for download: – A manual describing the matcode .m functions is also available. – The quiz solutions manual . • A web-based solution set constructor for the second edition is available to instructors at • The next update of this solution manual is likely to occur in January, 2006. 1 Problem Solutions – Chapter 1 Problem 1.1.1 Solution Based on the Venn diagram M O T the answers are fairly straightforward: (a) Since T ∩M = φ, T and M are not mutually exclusive. (b) Every pizza is either Regular (R), or Tuscan (T). Hence R ∪ T = S so that R and T are collectively exhaustive. Thus its also (trivially) true that R ∪ T ∪M = S. That is, R, T and M are also collectively exhaustive. (c) From the Venn diagram, T and O are mutually exclusive. In words, this means that Tuscan pizzas never have onions or pizzas with onions are never Tuscan. As an aside, “Tuscan” is a fake pizza designation; one shouldn’t conclude that people from Tuscany actually dislike onions. (d) From the Venn diagram, M∩T and O are mutually exclusive. Thus Gerlanda’s doesn’t make Tuscan pizza with mushrooms and onions. (e) Yes. In terms of the Venn diagram, these pizzas are in the set (T ∪M ∪ O)c. Problem 1.1.2 Solution Based on the Venn diagram, M O T the complete Gerlandas pizza menu is • Regular without toppings • Regular with mushrooms • Regular with onions • Regular with mushrooms and onions • Tuscan without toppings • Tuscan with mushrooms Problem 1.2.1 Solution (a) An outcome specifies whether the fax is high (h), medium (m), or low (l) speed, and whether the fax has two (t) pages or four (f) pages. The sample space is S = {ht, hf,mt,mf, lt, lf} . (1) 2 (b) The event that the fax is medium speed is A1 = {mt,mf}. (c) The event that a fax has two pages is A2 = {ht,mt, lt}. (d) The event that a fax is either high speed or low speed is A3 = {ht, hf, lt, lf}. (e) Since A1 ∩ A2 = {mt} and is not empty, A1, A2, and A3 are not mutually exclusive. (f) Since A1 ∪ A2 ∪ A3 = {ht, hf,mt,mf, lt, lf} = S, (2) the collection A1, A2, A3 is collectively exhaustive. Problem 1.2.2 Solution (a) The sample space of the experiment is S = {aaa, aaf, afa, faa, ffa, faf, aff, fff} . (1) (b) The event that the circuit from Z fails is ZF = {aaf, aff, faf, fff} . (2) The event that the circuit from X is acceptable is XA = {aaa, aaf, afa, aff} . (3) (c) Since ZF ∩ XA = {aaf, aff} = φ, ZF and XA are not mutually exclusive. (d) Since ZF ∪XA = {aaa, aaf, afa, aff, faf, fff} = S, ZF and XA are not collectively exhaustive. (e) The event that more than one circuit is acceptable is C = {aaa, aaf, afa, faa} . (4) The event that at least two circuits fail is D = {ffa, faf, aff, fff} . (5) (f) Inspection shows that C ∩ D = φ so C and D are mutually exclusive. (g) Since C ∪ D = S, C and D are collectively exhaustive. Problem 1.2.3 Solution The sample space is S = {A♣, . . . , K♣,A♦, . . . , K♦,A♥, . . . , K♥,A♠, . . . , K♠} . (1) The event H is the set H = {A♥, . . . , K♥} . (2) 3 Problem 1.2.4 Solution The sample space is S = ⎧⎨ ⎩ 1/1 . . . 1/31, 2/1 . . . 2/29, 3/1 . . . 3/31, 4/1 . . . 4/30, 5/1 . . . 5/31, 6/1 . . . 6/30, 7/1 . . . 7/31, 8/1 . . . 8/31, 9/1 . . . 9/31, 10/1 . . . 10/31, 11/1 . . . 11/30, 12/1 . . . 12/31 ⎫⎬ ⎭. (1) The event H defined by the event of a July birthday is described by following 31 sample points. H = {7/1, 7/2, . . . , 7/31} . (2) Problem 1.2.5 Solution Of course, there are many answers to this problem. Here are four event spaces. 1. We can divide students into engineers or non-engineers. Let A1 equal the set of engineering students and A2 the non-engineers. The pair {A1,A2} is an event space. 2. We can also separate students by GPA. Let Bi denote the subset of students with GPAs G satisfying i − 1 ≤ G < i. At Rutgers, {B1,B2, . . . , B5} is an event space. Note that B5 is the set of all students with perfect 4.0 GPAs. Of course, other schools use different scales for GPA. 3. We can also divide the students by age. Let Ci denote the subset of students of age i in years. At most universities, {C10, C11, . . . , C100} would be an event space. Since a university may have prodigies either under 10 or over 100, we note that {C0, C1, . . .} is always an event space 4. Lastly, we can categorize students by attendance. Let D0 denote the number of students who have missed zero lectures and let D1 denote all other students. Although it is likely that D0 is an empty set, {D0,D1} is a well defined event space. Problem 1.2.6 Solution Let R1 and R2 denote the measured resistances. The pair (R1,R2) is an outcome of the experiment. Some event spaces include 1. If we need to check that neither resistance is too high, an event space is A1 = {R1 < 100,R2 < 100}, A2 = {either R1 ≥ 100 or R2 ≥ 100} . (1) 2. If we need to check whether the first resistance exceeds the second resistance, an event space is B1 = {R1 > R2} B2 = {R1 ≤ R2} . (2) 3. If we need to check whether each resistance doesn’t fall below a minimum value (in this case 50 ohms for R1 and 100 ohms for R2), an event space is C1 = {R1 < 50,R2 < 100}, C2 = {R1 < 50,R2 ≥ 100} , (3) C3 = {R1 ≥ 50,R2 < 100}, C4 = {R1 ≥ 50,R2 ≥ 100} . (4) 4. If we want to check whether the resistors in parallel are within an acceptable range of 90 to 110 ohms, an event space is D1 =  (1/R1 + 1/R2)−1 < 90  , (5) D2 =  90 ≤ (1/R1 + 1/R2)−1 ≤ 110  , (6) D2 =  110 < (1/R1 + 1/R2)−1 . (7) 4 Problem 1.3.1 Solution The sample space of the experiment is S = {LF,BF,LW,BW} . (1) From the problem statement, we know that P[LF] = 0.5, P[BF] = 0.2 and P[BW] = 0.2. This implies P[LW] = 1 − 0.5 − 0.2 − 0.2 = 0.1. The questions can be answered using Theorem 1.5. (a) The probability that a program is slow is P [W] = P [LW] + P [BW] = 0.1 + 0.2 = 0.3. (2) (b) The probability that a program is big is P [B] = P [BF] + P [BW] = 0.2 + 0.2 = 0.4. (3) (c) The probability that a program is slow or big is P [W ∪ B] = P [W] + P [B] − P [BW] = 0.3 + 0.4 − 0.2 = 0.5. (4) Problem 1.3.2 Solution A sample outcome indicates whether the cell phone is handheld (H) or mobile (M) and whether the speed is fast (F) or slow (W). The sample space is S = {HF,HW,MF,MW} . (1) The problem statement tells us that P[HF] = 0.2, P[MW] = 0.1 and P[F] = 0.5. We can use these facts to find the probabilities of the other outcomes. In particular, P [F] = P [HF] + P [MF] . (2) This implies P [MF] = P [F] − P [HF] = 0.5 − 0.2 = 0.3. (3) Also, since the probabilities must sum to 1, P [HW] = 1 − P [HF] − P [MF] − P [MW] = 1 − 0.2 − 0.3 − 0.1 = 0.4. (4) Now that we have found the probabilities of the outcomes, finding any other probability is easy. (a) The probability a cell phone is slow is P [W] = P [HW] + P [MW] = 0.4 + 0.1 = 0.5. (5) (b) The probability that a cell hpone is mobile and fast is P[MF] = 0.3. (c) The probability that a cell phone is handheld is P [H] = P [HF] + P [HW] = 0.2 + 0.4 = 0.6. (6) 5 Problem 1.3.3 Solution A reasonable probability model that is consistent with the notion of a shuffled deck is that each card in the deck is equally likely to be the first card. Let Hi denote the event that the first card drawn is the ith heart where the first heart is the ace, the second heart is the deuce and so on. In that case, P[Hi] = 1/52 for 1 ≤ i ≤ 13. The event H that the first card is a heart can be written as the disjoint union H = H1 ∪ H2 ∪ · · · ∪ H13. (1) Using Theorem 1.1, we have P [H] = 13 i=1 P [Hi] = 13/52. (2) This is the answer you would expect since 13 out of 52 cards are hearts. The point to keep in mind is that this is not just the common sense answer but is the result of a probability model for a shuffled deck and the axioms of probability. Problem 1.3.4 Solution Let si denote the outcome that the down face has i dots. The sample space is S = {s1, . . . , s6}. The probability of each sample outcome is P[si] = 1/6. From Theorem 1.1, the probability of the event E that the roll is even is P [E] = P [s2] + P [s4] + P [s6] = 3/6. (1) Problem 1.3.5 Solution Let si equal the outcome of the student’s quiz. The sample space is then composed of all the possible grades that she can receive. S = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} . (1) Since each of the 11 possible outcomes is equally likely, the probability of receiving a grade of i, for each i = 0, 1, . . . , 10 is P[si] = 1/11. The probability that the student gets an A is the probability that she gets a score of 9 or higher. That is P [Grade of A] = P [9] + P [10] = 1/11 + 1/11 = 2/11. (2) The probability of failing requires the student to get a grade less than 4. P [Failing] = P [3] + P [2] + P [1] + P [0] = 1/11 + 1/11 + 1/11 + 1/11 = 4/11. (3) Problem 1.4.1 Solution From the table we look to add all the disjoint events that contain H0 to express the probability that a caller makes no hand-offs as P [H0] = P [LH0] + P [BH0] = 0.1 + 0.4 = 0.5. (1) In a similar fashion we can express the probability that a call is brief by P [B] = P [BH0] + P [BH1] + P [BH2] = 0.4 + 0.1 + 0.1 = 0.6. (2) The probability that a call is long or makes at least two hand-offs is P [L ∪ H2] = P [LH0] + P [LH1] + P [LH2] + P [BH2] (3) = 0.1 + 0.1 + 0.2 + 0.1 = 0.5. (4) 6 Problem 1.4.2 Solution (a) From the given probability distribution of billed minutes, M, the probability that a call is billed for more than 3 minutes is P [L] = 1 − P [3 or fewer billed minutes] (1) = 1− P [B1] − P [B2] − P [B3] (2) = 1− α − α(1 − α) − α(1 − α)2 (3) = (1 − α)3 = 0.57. (4) (b) The probability that a call will billed for 9 minutes or less is P [9 minutes or less]= 9 i=1 α(1 − α)i−1 = 1− (0.57)3. (5) Problem 1.4.3 Solution The first generation consists of two plants each with genotype yg or gy. They are crossed to produce the following second generation genotypes, S = {yy, yg, gy, gg}. Each genotype is just as likely as any other so the probability of each genotype is consequently 1/4. A pea plant has yellow seeds if it possesses at least one dominant y gene. The set of pea plants with yellow seeds is Y = {yy, yg, gy} . (1) So the probability of a pea plant with yellow seeds is P [Y ] = P [yy] + P [yg] + P [gy] = 3/4. (2) Problem 1.4.4 Solution Each statement is a consequence of part 4 of Theorem 1.4. (a) Since A ⊂ A ∪ B, P[A] ≤ P[A ∪ B]. (b) Since B ⊂ A ∪ B, P[B] ≤ P[A ∪ B]. (c) Since A ∩ B ⊂ A, P[A ∩ B] ≤ P[A]. (d) Since A ∩ B ⊂ B, P[A ∩ B] ≤ P[B]. Problem 1.4.5 Solution Specifically, we will use Theorem 1.7(c) which states that for any events A and B, P [A ∪ B] = P [A] + P [B] − P [A ∩ B] . (1) To prove the union bound by induction, we first prove the theorem for the case of n = 2 events. In this case, by Theorem 1.7(c), P [A1 ∪ A2] = P [A1] + P [A2] − P [A1 ∩ A2] . (2) 7 By the first axiom of probability, P[A1 ∩ A2] ≥ 0. Thus, P [A1 ∪ A2] ≤ P [A1] + P [A2] . (3) which proves the union bound for the case n = 2. Now we make our induction hypothesis that the union-bound holds for any collection of n − 1 subsets. In this case, given subsets A1, . . . , An, we define A = A1 ∪ A2 ∪ · · · ∪ An−1, B= An. (4) By our induction hypothesis, P [A] = P [A1 ∪ A2 ∪ · · · ∪ An−1] ≤ P [A1] + · · · + P [An−1] . (5) This permits us to write P [A1 ∪ · · · ∪ An] = P [A ∪ B] (6) ≤ P [A] + P [B] (by the union bound for n = 2) (7) = P [A1 ∪ · · · ∪ An−1] + P [An] (8) ≤ P [A1] + · · · P [An−1] + P [An] (9) which completes the inductive proof. Problem 1.4.6 Solution (a) For convenience, let pi = P[FHi] and qi = P[VHi]. Using this shorthand, the six unknowns p0, p1, p2, q0, q1, q2 fill the table as H0 H1 H2 F p0 p1 p2 V q0 q1 q2 . (1) However, we are given a number of facts: p0 + q0 = 1/3, p1 + q1 = 1/3, (2) p2 + q2 = 1/3, p0 + p1 + p2 = 5/12. (3) Other facts, such as q0 + q1 + q2 = 7/12, can be derived from these facts. Thus, we have four equations and six unknowns, choosing p0 and p1 will specify the other unknowns. Unfortunately, arbitrary choices for either p0 or p1 will lead to negative values for the other probabilities. In terms of p0 and p1, the other unknowns are q0 = 1/3 − p0, p2 = 5/12 − (p0 + p1), (4) q1 = 1/3 − p1, q2 = p0 + p1 − 1/12. (5) Because the probabilities must be nonnegative, we see that 0 ≤ p0 ≤ 1/3, (6) 0 ≤ p1 ≤ 1/3, (7) 1/12 ≤ p0 + p1 ≤ 5/12. (8) 8 Although there are an infinite number of solutions, three possible solutions are: p0 = 1/3, p1 = 1/12, p2 = 0, (9) q0 = 0, q1 = 1/4, q2 = 1/3. (10) and p0 = 1/4, p1 = 1/12, p2 = 1/12, (11) q0 = 1/12, q1 = 3/12, q2 = 3/12. (12) and p0 = 0, p1 = 1/12, p2 = 1/3, (13) q0 = 1/3, q1 = 3/12, q2 = 0. (14) (b) In terms of the pi, qi notation, the new facts are p0 = 1/4 and q1 = 1/6. These extra facts uniquely specify the probabilities. In this case, p0 = 1/4, p1 = 1/6, p2 = 0, (15) q0 = 1/12, q1 = 1/6, q2 = 1/3. (16) Problem 1.4.7 Solution It is tempting to use the following proof: Since S and φ are mutually exclusive, and since S = S ∪ φ, 1 = P [S ∪ φ] = P [S] + P [φ] . (1) Since P[S] = 1, we must have P[φ] = 0. The above “proof” used the property that for mutually exclusive sets A1 and A2, P [A1 ∪ A2] = P [A1] + P [A2] . (2) The problem is that this property is a consequence of the three axioms, and thus must be proven. For a proof that uses just the three axioms, let A1 be an arbitrary set and for n = 2, 3, . . ., let An = φ. Since A1 = ∪∞ i=1Ai, we can use Axiom 3 to write P [A1] = P [∪∞ i=1Ai] = P [A1] + P [A2] + ∞ i=3 P [Ai] . (3) By subtracting P[A1] from both sides, the fact that A2 = φ permits us to write P [φ] + ∞ n=3 P [Ai] = 0. (4) By Axiom 1, P[Ai] ≥ 0 for all i. Thus, ∞ n=3 P[Ai] ≥ 0. This implies P[φ] ≤ 0. Since Axiom 1 requires P[φ] ≥ 0, we must have P[φ] = 0. 9 Problem 1.4.8 Solution Following the hint, we define the set of events {Ai|i = 1, 2, . . .} such that i = 1, . . . , m, Ai = Bi and for i > m, Ai = φ. By construction, ∪m i=1Bi = ∪∞ i=1Ai. Axiom 3 then implies P [∪m i=1Bi] = P [∪∞ i=1Ai] = ∞ i=1 P [Ai] . (1) For i > m, P[Ai] = P[φ] = 0, yielding the claim P[∪m i=1Bi] = m i=1 P[Ai] = m i=1 P[Bi]. Note that the fact that P[φ] = 0 follows from Axioms 1 and 2. This problem is more challenging if you just use Axiom 3. We start by observing P [∪m i=1Bi] = m −1 i=1 P [Bi] + ∞ i=m P [Ai] . (2) Now, we use Axiom 3 again on the countably infinite sequence Am,Am+1, . . . to write ∞ i=m P [Ai] = P [Am ∪ Am+1 ∪ · · ·] = P [Bm] . (3) Thus, we have used just Axiom 3 to prove Theorem 1.4: P[∪m i=1Bi] = m i=1 P[Bi]. Problem 1.4.9 Solution Each claim in Theorem 1.7 requires a proof from which we can check which axioms are used. However, the problem is somewhat hard because there may still be a simpler proof that uses fewer axioms. Still, the proof of each part will need Theorem 1.4 which we now prove. For the mutually exclusive events B1, . . . , Bm, let Ai = Bi for i = 1, . . . , m and let Ai = φ for i > m. In that case, by Axiom 3, P [B1 ∪ B2 ∪ · · · ∪ Bm] = P [A1 ∪ A2 ∪ · · ·] (1) = m −1 i=1 P [Ai] + ∞ i=m P [Ai] (2) = m −1 i=1 P [Bi] + ∞ i=m P [Ai] . (3) Now, we use Axiom 3 again on Am,Am+1, . . . to write ∞ i=m P [Ai] = P [Am ∪ Am+1 ∪ · · ·] = P [Bm] . (4) Thus, we have used just Axiom 3 to prove Theorem 1.4: P [B1 ∪ B2 ∪ · · · ∪ Bm] = m i=1 P [Bi] . (5) (a) To show P[φ] = 0, let B1 = S and let B2 = φ. Thus by Theorem 1.4, P [S] = P [B1 ∪ B2] = P [B1] + P [B2] = P [S] + P [φ] . (6) Thus, P[φ] = 0. Note that this proof uses only Theorem 1.4 which uses only Axiom 3. 10 (b) Using Theorem 1.4 with B1 = A and B2 = Ac, we have P [S] = P [A ∪ Ac] = P [A] + P [Ac] . (7) Since, Axiom 2 says P[S] = 1, P[Ac] = 1 − P[A]. This proof uses Axioms 2 and 3. (c) By Theorem 1.2, we can write both A and B as unions of disjoint events: A = (AB) ∪ (ABc) B = (AB) ∪ (AcB). (8) Now we apply Theorem 1.4 to write P [A] = P [AB] + P [ABc], P[B] = P [AB] + P [AcB] . (9) We can rewrite these facts as P[ABc]