MSO 201a: Probability and Statistics 2016-2017-II Semester Assignment-I

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

MSO 201a: Probability and Statistics

2016-2017-II Semester
Assignment-I

A. Illustrative Discussion Problems

1. (i) Let = {0, 1, 2, . . .}. In each of the following cases, verify if (, P(), P ) is a
probability space:
(a) P (A) = xA e x /x!, A P(), > 0;
P

(b) P (A) = 0, if A has a finite number of elements, and P (A) = 1, if A has infinite
number of elements, A P().
(ii) Let (, P(), P ) be a probability space and let A, B, C, D P(). Suppose that
P (A) = 0.6, P (B) = 0.5, P (C) = 0.4, P (A B) = 0.3, P (A C) = 0.2, P (B C) =
0.2, P (A B C) = 0.1, P (B D) = P (C D) = 0, P (A D) = 0.1 and P(D)=0.2.
Find:
(a) P (A B C) and P (Ac B c C c ); (b) P ((A B) C) and P (A (B C));
(c) P ((Ac B c ) C c ) and P ((Ac B c ) C c ); (d) P (D B C) and P (A C D);
(e) P (A B D) and P (A B C D); (f) P ((A B) (C D)).

2. Suppose that n ( 3) persons P1 , . . . , Pn are made to stand in a row at random.


Find the probability that there are exactly r persons between P1 and P2 ; here
r {1, 2, . . . , n 2}.

3. Suppose that we have n ( 2) letters and corresponding n addressed envelopes. If


these letters are inserted at random in n envelopes, find the probability that no letter
is inserted into the correct envelope. Find the approximate value of this probability
when there are n = 50 letters.

4. Let = (0, 1] and let probability function P be such that P ((a, b]) = b a, where
0 a < b 1.
(a) Show that {b} = 1
n=1 (b n+1 , b], b (0, 1];
(b) Show that P ({b}) = 0, b (0, 1];
(c) Show that, for any countable set A P(), P (A) = 0;
(d) For n N, let An = (0, n1 ] and Bn = ( 12 + n+2 1
, 1]. Verify that An , Bn ,
P (limn An ) = limn P (An ) and P (limn Bn ) = limn P (Bn ).

5. Consider four coding machines M1 , M2 , M3 and M4 producing binary codes 0 and


1. The machine M1 produces codes 0 and 1 with respective probabilities 14 and 43 .
The code produced by machine Mk is fed into machine Mk+1 (k = 1, 2, 3) which
may either leave the received code unchanged or may change it. Suppose that each
of the machines M2 , M3 and M4 change the code with probability 34 . Given that the

1
machine M4 has produced code 1, find the conditional probability that the machine
M1 produced code 0.

6. A student appears in the examinations of four subjects Biology, Chemistry, Physics


and Mathematics. Suppose that probabilities of the student clearing examinations
in these subjects are 12 , 13 , 14 and 15 respectively. Assuming that the performances of
the student in four subjects are independent, find the probability that the student
will clear examination(s) of
(a) all the subjects; (b) no subject; (c) exactly one subject;
(d) exactly two subjects; (e) at least one subject.

7. For independent events A1 , A2 , . . . (i.e., any finite sub-collection of {A1 , A2 , . . .} is a


collection of independent events), show that:

\ P
P( Aci ) e i=1 P (Ai )
.
i=1

Hence show that if


P
i=1 P (Ai ) = , then with certainty atleast one of the events
A1 , A2 , . . . will occur.

8. Let A, B and C be three events such that P (B C) > 0. Prove or disprove each of
the following:
(a) P (A B|C) = P (A|B C)P (B|C); (b) P (A B|C) = P (A|C)P (B|C) if A and
B are independent events.

B. Practice Problems from the Text Book

Problem Nos.: 3.11, 3.13, 3.14, 3.17, 4.6, 4.7, 4.9, 4.14, 4.18, 4.20, 4.21, 4.25, 4.30, 4.31,
4.34.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy