Professional Documents
Culture Documents
Instructions:
1. Verify at the start of the exam that you have a total of seven (7) questions printed on
eighteen (18) pages including this title page.
2. Attempt all questions on the question-book and in the given order.
3. Read the questions carefully for clarity of context and understanding of meaning and
make assumptions wherever important, for neither the invigilator will address your
queries, nor the teacher/examiner will come to the examination hall for any assistance.
4. Wherever computations are required, direct answers are not acceptable. You need to
show your working in a neat and concise way to get credited.
5. Fit in all your answers in the provided space. You may use extra space provided at the
end if required. If you do so, clearly mark question/part number on that page to avoid
confusion.
6. Use your own stationery and calculator only. If you do not have your own calculator, use
manual calculations.
7. Use permanent ink-pens. Questions attempted with lead-pencils will be considered for
checking but cannot be claimed for rechecking.
1
d. P [ { 1 } ] =
9
g. P
[ { }] [ ]
1 1
×
2 3
=P
1 1
=
6 9
h. P
[ { }] [ { }]
1
2
.P
1
3
1 1 1
= . =
9 9 81
[{ } ]
2
1
i. P ,cannot determine since square of a set is not defined
2
j. P P
[{ {[ 12 }]+ P [ {13 }]+ P [ {14 }]}]=P [{ 19 + 19 + 19 }]=P [ {13 }]= 19
[{∑ [{ }]}] [{∑ }] [{ }]
3 3
1 1 1 1
k. P P =P =P =
k=1 k k=1 9 3 9
[{ }]
4 4
1 1 4
l. ∑P k
=∑ =
k =1 k=1 9 9
a. Three friends Ava, Bob, and Chris put their names in a hat and each picks a name
from the hat randomly. (Assume Ava picks first, then Bob, then Chris). Event A : “Ava
picks her name”, event B: “Bob picks his name”, and event C : “Chris picks his
name”. Find the probability that everyone draws his own name.
P [ A ∩ B ∩C ]
b. Computer A and computer B are connected by two unreliable links, link 1 and link 2.
Computer A sends a message to computer B on both links simultaneously. Computer
B can detect when errors occur in either link. Let the probability of message
transmission error in link 1 and link 2 be q 1 and q 2, respectively. Computer B
requests retransmission until it receives an error-free message on either link. Find
the probability that more than k transmissions are required.
P [ A k+1 ∪ A k +2 ∪ Ak +3 ∪ … ]OR
P [ ¿ n=k +1 ¿ ∞ A n ]
(iii) Convert the mathematical expression into a statement to explain what is being specified
in each of the following questions. Do not solve it. [4 marks]
a. Seven cards are drawn from a deck of 52 cards. If event A describes the seven cards
to be all possible combinations of being only from hearts and event B describes the
seven cards to be non-numeric cards (treat aces as numeric cards of value 1). What
does P[ A ∩B ] mean?
The probability that the seven cards are hearts AND non-numeric.
b. A coin is tossed until a heads is obtained. If event A contains all sample points where
heads occur in more than 5 tosses but less than 10 tosses and event B contains all
sample points where heads occur in less than 5 tosses and more than 10 tosses,
what does P[ A c ∩ B c ] mean?
a. Write S. [4 marks]
…,
p ,− p ,−−p ,−−− p , … }
where p is the last prime less than 231 −1. A dash ‘−¿ ‘ represents a call to the
function that does not return a prime number.
c. Create a partition, events N i based on number of calls to the function mint(). Clearly
write how many events will be there in this partition and how many sample points
will be there in each event? [4 marks]
N 1= {2 , 3 ,5 ,7 , 11 , … }
As seen there are infinite sample points in each event and infinite events in the
partition.
As seen there are infinite sample points in each event but finite events in the
partition. Total number of events in the partition are equal to number of
primes in the range 1−231 −1.
(ii) A system has two key subsystems. The system is up if both subsystems are functioning.
Triple redundant systems are configured to provide high reliability. The overall system is
operational as long as one of the three systems is up. Let A jk corresponds to the event
“unit k in system j is functioning” for j=1 ,2 , 3 and k =1 ,2. Assume each subsystem
fails independently. Write an expression for the event “overall system is up”. [6 marks]
This is same as #ways we can put 3 red balls in 5 bins and for each of this assignment,
the number of ways blue and green ball can be arranged in the remaining 2 bins.
#ways to arrange 3 red, one blue and one green ¿ ( 53) . P =20
2
2
(ii) In how many ways we can have 2 balls picked from these five?
The word ‘have’ stresses that possession matters, not the order in which picked.
A0 : 0 balls picked from red, A1: 1 ball picked from red, A2: both balls picked from red.
(iii) In how many ways we can order 2 balls picked from these five?
In addition to part (ii) above, there are GR, BR, BG, i.e., 3 more combinations. So there
are a total of 7 ways to pick and order 2 balls from these 5.
(iv) In how many ways we can have 2 balls picked from these five with replacement?
‘Have’ means unordered. With replacement means, we pick, note color, and pick from 5
again. So besides those in part (ii) above, there are GG, BB as well, i.e., 6 ways.
(v) In how many ways we can order 2 balls picked from these five with replacement?
So besides part (iii) above, there are GG, BB, as well, i.e., 9 ways.
P [ one picked isred if two are picked ] =P [ first picked is red ] . P [ second picked is not red ] + P [ first pic
3 2 2 3 12 3
¿ . + . = =
5 4 5 4 20 5
OR
E : two picked from five, with order matters, and without replacement.
|S|¿ n Pk ¿5 P 2=5.4=20
A=A 1 ∪ A 2
| A| 12 3
P [ A ]= = =
|S| 20 5
Verification: Assume each red ball has a label
S={R1 R 2 , R1 R 3 , R2 R3 , R1 G , R2 G , R 3 G , R 1 B , R 2 B , R 3 B , BG ,
A={R1 G, R2 G , R3 G , R1 B , R2 B , R3 B ,
P [ H 1 ]=0.5
P [ H 2 ] =P [ H 2 ∩ H 1 ] . P [ H 2 ∩T 1 ]=0.375+ 0.125=0.5
(
1 1
)
P [ H 1 ∩ H 2 ]=P [ { HH } ] = . ×1.5 =0.375
2 2
Since
(a) Event HW : Exam is HW based, Event CB : Exam is closed book, Event OB : Exam is
open book, Event F : student fail the course, Event F c: student pass the course.
(b)
(c) P [ F c ] =?
P [ F ] =P [ F ∩ H ] + P [ F ∩ C ] + P [ F ∩O ]=0.32+0.175+0.1=0.595
c c c c
(d) P [ O|F ] =?
{
p X ( x )= x , x ∈ {0.1,0 .2,0 .3,0.4 }
0 , otherwise
Evaluate the following if they are in correct notation, otherwise mention what is wrong
[7 marks].
b. p X ( 0.2 ) =0.2
c. E [ 0.2 ] =0.2
1
The expectation of a geometric RV is . The sample mean of these 10 values is
p
14
=1.4 . If the sample mean is considered an approximation of the expectation
10
1
then 1.4 ≈ → p ≈ 0.714
p
Thus the parameter, p of the RV would be around 0.714 or we can approx. say it is
1
likely to be greater than .
2
The RV cannot be Bernoulli (which can take up values of 0 or 1 only). The value of 0
eliminates the possibility that the RV is geometric. So either it can be a uniform RV
or Binomial RV. Based on the nature of the data, there are more chances of it being
Binomial than Uniform since more values around 10 occur.
a. X represents the waiting time (in integer minutes) for an empty taxi to come if the
passenger waits by the road and not at the taxi stand. Fractional time is rounded to
next minute.
X is geometric.
b. X represents the waiting time (in integer minutes) for an empty taxi at the taxi
1
stand. An empty taxi is already waiting with a probability of .
3
c. There are 5 parking slots for taxis labelled 1 to 5. X represents the parking slot used
to engage an empty taxi.
d. X represents the direction a taxi moves after being engaged at a road side. 1 is
assigned if the taxi takes a U-turn whereas 0 is assigned if the taxi keeps moving in
the direction it was originally moving before being engaged.
X is Bernoulli.
(iv) If the following random variables are legitimate, find their support and pmf. If not, write
why they are not legitimate. [5 marks]
a. U represents the binary status of an electrical switch. The switch controls a light
that is lit for 9 hours on average per day.
SU ={0 , 1}
pU (u)
9 9
pU ( 1 ) = , pU ( 0 )=1−
24 24
SV =¿ Cannot describe the random variable since it does not take up real values.
pV (v )
p X ( x ), p X ( salary amount ) =1
SY ={0,1,2, … }
pY ( 1 ) =P ¿
SZ ={2,3,4 ,… }
Let
2
() ()
P [ heads∈one toss ] =p , p Z ( 2 )= p2 , p Z ( 3 )= 3 ( 1− p ) p2 , p Z ( 4 ) = 4 ( 1− p ) p2.
2 2
There are 3 ways in which to have 2 Heads in 3 tosses etc. OR
()
pZ ( k ) = k ( 1− p ) p
2
k−2 2
∞ ∞
∑( )
k ( 1− p )k−2 p 2= p2
2
∑ ()
k ( 1− p )k−2= p2 [ 1+3 ( 1− p ) +6 ( 1− p )2 +10 ( 1− p )3 +… ]
k =2 k =2 2
(a)
(b)
(c) (d)
a. Find E [ X ] =0.2 ( 0.1 ) +0.4 ( 0.35 )+ 0.6 ( 0.1 )+ 0.8 ( 0.2 )+ 1.0 ( 0.25 )=0.63
HHHHHTTHTHHHHTHHHHTTHHHTHTHTHHTHHTHTHTHTHTHTHTTTTT
29
⟨ X ⟩ n=
50
25
E [ X ] = p=0.5=
50
(iv) For each of the following cases, write 2 typical sample points ( si) of the sample space of
the underlying experiment, and the value of the random variable X for each sample
point chosen. Choose si such that X ( si ) maps each to different value of X . [8 marks]:
X ( s1 ) =1 X ( s2 ) =0
X ( s1 ) =1 X ( s2 ) =2
(c) An Urn has 100 balls labelled in binary from 0000001 to 01100100 .
s1=0011001 s2=0000100
X ( s1 ) =25 X ( s2 ) =4
s1=SFFSFFSS s2=SFSFSFSFFFSS
X ( s1 ) =8 X ( s2 ) =12
The player may loose his $1 (gain of -1), loos $2 (gain of -2) or give $1 to get $100, i.e.,
gain of $99.
S X ={−2 ,−1 , 99 }
To get $100, the player rolls a sum of 11 or 12, i.e., {( 5,6 ) , ( 6,5 ) ,(6,6) }
1 6
p X (−2 ) =P [ X =−2 ] =P [ 11 ]= =
6 36
3 5 4 18+5+
p X (−1 )=P [ X =−1 ] =P [(21 ∩31 ∩ 4 1)∪ ( ( 1,2,3,4,5 )2 ∩5 1)∪( ( 1,2,3,4 )2 ∩61 ) ]= + + =
6 36 36 36
X
X Geometric ( p ) , Y =⌊ ⌋
2
where ⌊ a ⌋ is the floor function that equals the largest integer equal to or less than a .
Find the pmf of Y [6 marks] and prove that it is a legitimate pmf [4 marks].
SY = {0 , 1 , 2, … }
pY ( 0 )=P [ Y =0 ]=P [ X =1 ] = p X ( 1 )= p
pY ( 1 ) =P [ Y =1 ] =P [ X =2 ] + P [ X =3 ] = p X ( 2 ) + p X ( 3 )=( 1− p ) p+ ( 1− p )2 p
pY ( 2 ) =P [ Y =2 ] =P [ X =4 ] + P [ X=5 ] = p X ( 4 )+ p X (5 )=( 1− p )3 p+ ( 1− p )4 p
Thus
2 y−1 2y
pY ( y ) =P [ Y = y ] =P [ X =2 y ] + P [ X =2 y +1 ]= p X ( 2 y ) + p X ( 2 y +1 )=( 1− p ) p + ( 1− p ) p
Proof of validity:
∞ ∞ ∞
∑ pY ( y )= pY ( 0 )+ ∑ p Y ( y )= p+∑ ( 1− p )2 y−1 p +( 1− p )2 y p
y=0 y=1 y=1
¿ p+ [ ( 1− p ) p + ( 1− p ) p ]+ [ ( 1− p ) p+ ( 1− p ) p ] +…
1 2 3 4
¿ p [ 1+ ( 1− p ) + ( 1− p )2 + ( 1− p )3 + … ]= p
( 1−( 1−p
1
))
=1