Homework_Problem_Set_2
Homework_Problem_Set_2
Problem 2
Let X be a random variable with PMF
2
x
, if x 4, 2, 0, 2, 4
p X (x ) c
0 , otherwise.
1
EEEC10006: Probability Ming-Chun Lee
Problem 3
A packet communication system consists of a buffer that stores packets from
some source, and a communication line that retrieves packets from the buffer and
transmits them to a receiver. The system operates in time-slot pairs. In the first
slot, the system stores a number of packets that are generated by the source
according to a Poisson PMF with parameter ; however, the maximum number
of packets that can be stored is a given integer b , and packets arriving to a full
buffer are discarded. In the second slot, the system transmits either all the stored
packets or c packets (whichever is less). Here, c is a given integer with
0 c b.
(a) Assuming that at the beginning of the first slot the buffer is empty, find
the PMF of the number of packets stored at the end of the first slot and
at the end of the second slot. (6 pts)
(b) What is the probability that some packets get discarded during the first
slot? (4 pts)
Problem 4
Suppose that two teams are playing a series of games, each of which is
(a) If i 4 , find the probability that a total of 7 games are played. (3 pts)
1
(b) Based on part (a), show that the probability is maximized when p .
2
(2 pts)
2
EEEC10006: Probability Ming-Chun Lee
(c) Find the expected number of games that are played when i 2 . (2 pts)
(d) Find the expected number of games that are played when i 3 . (2 pts)
Problem 5
Answer the following questions:
(b) A random variable X has mean 2 and variance 7. Find E[X 2 ] . (2 pts)
E[X ]
P(X 2) . (3 pts)
2
(d) Let X be a random variable that takes values from 0 to 9 with equal
Problem 6
Paul is heavily addicted to mobile games. In these games, players can acquire
powerful weapons and characters through a gacha system, which boosts their in-
game combat capability. Each gacha pull is independent, with the probability of
obtaining the desired character in a single pull being q, and the probability of not
student and can only afford to make n pulls during this event’s banner. Let X be
3
EEEC10006: Probability Ming-Chun Lee
the total number of desired characters in the n pulls. Given this limitation, please
(e) After Paul has made 19 pulls without obtaining the desired character, he
claims the probability of getting the desired character will be much
higher than 1%. He reasons that he has already pulled out many
undesirable items, so the probability of obtaining the desired character
on the 20th pull is very high. Is he correct? Explain your reasoning.
(2 pts)
Problem 7
probability p.
1
(b) What is E[N ] ? (Hint: 2
kx k 1
) (3 pts)
(1 x) k 0
4
EEEC10006: Probability Ming-Chun Lee
(d) Suppose we want to be 99% sure that at least 1000 characters are received
(2 pts)
Problem 8
Let a and b be positive integers with a b , and let X be the uniform
discrete random variable that take on values in set {a, a 1, ..., b} with equal
probability. Let Y 3X .
(Hint: express the variance as V ar (Y ) E[Y 2 ] E[Y ]2 , and you don’t need to
simplify)
Problem 9
For a Poisson RV, with parameter b, it takes values 0, 1,… with probability
b bk
pX (k ) P(X k) e .
k!
(Hints: E[X 2 ] E[X (X 1)] E[X ] and the Talyor series of exponential)
5
EEEC10006: Probability Ming-Chun Lee
Problem 10
A certain photo-sensor fails to activate if it receives fewer than four photons in a
random variable X .
(a) Find the probability that the sensor activates. (5 pts)
(b) A new photon sensor is designed such that the number of photons it
receives in a certain time interval follows a Poisson distribution with a
mean of 4 . The sensor is required to activate with a probability of