0% found this document useful (0 votes)
40 views6 pages

Midterm 1 Solutions

The document contains several probability problems: 1) It defines probabilities of different types of calls and handoffs. 2) It calculates the probability that a brief call experiences at least one handoff. 3) It identifies two events that are not mutually exclusive or collectively exhaustive, so their probabilities cannot be directly calculated from the information given.

Uploaded by

Pranusha reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views6 pages

Midterm 1 Solutions

The document contains several probability problems: 1) It defines probabilities of different types of calls and handoffs. 2) It calculates the probability that a brief call experiences at least one handoff. 3) It identifies two events that are not mutually exclusive or collectively exhaustive, so their probabilities cannot be directly calculated from the information given.

Uploaded by

Pranusha reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

a.

∑ 𝑝𝑁 (𝑛) = 1

c+4c+9c+16c+25c=1

c=1/55

b.
0, 𝑛<1
𝑐, 1 ≤ 𝑛 < 2
5𝑐, 2≤𝑛<3
𝐹𝑁 (𝑛) =
14𝑐, 3≤𝑛<4
30𝑐, 4 ≤ 𝑛 < 5
{1 𝑛≥5
c.

𝐸 [𝑁] = ∑ 𝑛𝑝𝑁 (𝑛) = 1𝑐 + 2 ∗ 4𝑐 + 3 ∗ 9𝑐 + 4 ∗ 16𝑐 + 5 ∗ 25𝑐


𝑛

𝐸 [𝑁 2 ] = ∑ 𝑛2 𝑝𝑁 (𝑛) = 1𝑐 + 4 ∗ 4𝑐 + 9 ∗ 9𝑐 + 16 ∗ 16𝑐 + 25 ∗ 25𝑐


𝑛

𝑉𝑎𝑟[𝑁] = 𝐸 [𝑁 2 ] − (𝐸[𝑁])2
d. P[C]=P[at least one packet is received correctly|n=1]P[n=1]+ P[at least one packet is received
correctly|n=2]P[n=2]+ P[at least one packet is received correctly|n=3]P[n=3]+ P[at least one packet is
received correctly|n=4]P[n=4]+ P[at least one packet is received correctly|n=5]P[n=5]=p*c+(1-
(1 − 𝑝)2 )*4c+(1-(1 − 𝑝)3 )*9c+(1-(1 − 𝑝)4 )*16c+(1-(1 − 𝑝)5 )*25c

e. T=2N, E[T]=2*E[N]
5
f. 𝑝𝐾 (𝑘) = 𝑃[𝐾 = 𝑘] = ( ) 𝑃 [𝐶 ]𝑘 (1 − 𝑃[𝐶])5−𝑘
𝑘

a. 𝑆𝑌 = {1,2,3}
3
𝑃[𝑌 = 1] =
5
2 3
𝑃[𝑌 = 2] = ∗
5 4
2 1 3
𝑃 [𝑌 = 3] = ∗ ∗
5 4 3
b.
0, 𝑦<1
3
, 1≤𝑦<2
𝐹𝑌 (𝑦) = 5
3 3
+ , 2≤𝑦<3
5 10
{ 1 𝑦>3
3 3 1
c. 𝐸 [𝑌] = ∑𝑦 𝑦𝑝𝑌 (𝑦) = 1 ∗ + 2 ∗ +3∗
5 10 10

3 3 1
𝐸 [𝑌 2 ] = ∑ 𝑦 2 𝑝𝑌 (𝑦) = 1 ∗ +4∗ +9∗
5 10 10
𝑦

𝑉𝐴𝑅 [𝑌] = 𝐸 [𝑌 2 ] − (𝐸[𝑌])2

d. Z=1+3*(Y-1)=3Y-2

E[Z]=3E[Y]-2

VAR[Z]=9VAR[Y]


a. ∫−∞ 𝑓𝑋 (𝑥)𝑑𝑥 = 1
2
∫ 𝑐𝑥 2 + 2𝑥𝑑𝑥 = 1
0

𝑐 3 2
𝑥 + 𝑥2 | = 1
3 0
8c/3+4=1

8c/3=-3

C=-9/8
𝑥
b. 𝐹𝑋 (𝑥) = ∫−∞ 𝑓𝑋 (𝑢)𝑑𝑢

𝐹𝑋 (𝑥) = 0, 𝑥 < 0
𝑥 𝑐
𝐹𝑋 (𝑥) = ∫0 𝑐𝑢2 + 2𝑢 𝑑𝑢 = 𝑥 3 + 𝑥 2 , 0<x<2
3

𝐹𝑋 (𝑥) = 1, 𝑥 > 2

∞ 2 𝑐 2 2
c. 𝐸 [𝑋] = ∫−∞ 𝑥𝑓𝑋 (𝑥)𝑑𝑥 = ∫0 𝑐𝑥 3 + 2𝑥 2 𝑑𝑥 = 𝑥 4 + 𝑥 3 | = 4𝑐 + 16/3
4 3 0
∞ 2
𝑐 5 2 4 2
𝐸 [𝑋 2 ] = ∫ 𝑥 2 𝑓𝑋 (𝑥)𝑑𝑥 = ∫ 𝑐𝑥 4 + 2𝑥 3 𝑑𝑥 = 𝑥 + 𝑥 | = 32𝑐/5 + 8
−∞ 0 5 4 0

𝑉𝑎𝑟[𝑋] = 𝐸 [𝑋 2 ] − (𝐸[𝑋])2
∞ 1 2 𝑐 2
d. 𝐸 [𝑍] = ∫−∞ 𝑓𝑋 (𝑥)𝑑𝑥 = ∫0 𝑐𝑥 + 2 𝑑𝑥 = 𝑥 2 + 2𝑥 | = 2𝑐 + 4
𝑥 2 0
∞ 2
1 2
𝐸 [𝑍 2 ] = ∫ 𝑓
2 𝑋
(𝑥)𝑑𝑥 = ∫ 𝑐 + 2/𝑥 𝑑𝑥 = 𝑐𝑥 + 2𝑙𝑛𝑥 | = 2𝑐 + 2𝑙𝑛2
−∞ 𝑥 0 0

𝑉𝑎𝑟[𝑍] = 𝐸 [𝑍 2 ] − (𝐸[𝑍])2
1 1 𝑐
e. P[-1/2<X<1/2]=𝐹𝑋 ( ) − 𝐹𝑋 (− )= (1/2)3 + (1/2)2 − 0
2 2 3

f. Y=1000X

E[Y]=1000E[X]

VAR[Y]=1000000VAR[X]
(a) P[LH0]+P[BH0]=0.2

P[BH0]=0.1

P[LH0]+P[LH1]+P[LH2]=0.6

P[LH1]=0.4

P[BH0]+P[BH1]+P[BH2]=0.4

P[BH1]=0.1

(b) event E: a call with at least one handoffs

P[E|Brief call]=P[E ∩ Brief call]/P[Brief call]=0.3/0.4=3/4

{E ∩ Brief call}={BH1,BH2}, P[E ∩ Brief call]=P[BH1]+P[BH2]=0.3


c. A={BH0, BH1,BH2, LH1, LH2}

P[A]=0.9

d. B={LH0, LH1, LH2}

D={LH0, LH1, BH0, BH1}

B∩D is not empty, they are not mutually exclusive

B∪D is not the sample space, they are not collectively exhausive

P[B]=0.6

P[D]=0.7

P[B∩D]=P[LH0]+P[LH1]=0.5

P[B∩D]≠P[B]*P[D] they are not independent

You might also like