edited by
17,946 views
56 56 votes

Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true?

  1. There is a sample point at which $X$ has the value $5$.
  2. There is a sample point at which $X$ has value greater than $5$.
  3. There is a sample point at which $X$ has a value greater than equal to $5$.
  4. None of the above.

7 Answers

Best answer
50 50 votes

Answer is (C)

Expectation of discrete random variable (finite case)

$E(X) = x_1 p_1 + x_2p_2 + \dots  +x_np_n$

$E(X) = 5, 0 \leq pi \leq1$

$p_1 + p_2 + \dots + p_n = 1$

Therefore, $E(X) = 5$ is possible only if at-least one of the  $x_i \geq 5$

edited by
103 103 votes

Expectation is nothing but average value ...

A) Let the samples be 4,6 .. Average = (4+6) / 2 = 5 .. So average of 5 is possible even if no sample point has a value 5... So A) is eliminated.

B) Let samples be 5,5 .. Average = (5+5) / 2 = 5 .. So Average can be 5 even if no sample is greater than 5 .. So B) is eliminated ...

C) should be always TRUE .. If you dont have even 1 sample which is <= average_value x then average of x is not possible.. This is also applicable if you dont have even 1 sample point which is >= average_value

So Option C) is the answer ... 

edited by
4 4 votes
I think answer should be c) as I could not find any case in which mean is 5 and at all sample points X has value less than 5
0 0 votes
When the average is 5. Then there exists some sample points all around the value of 5 !

There should be some sample points <=5, some >=5, some < 5, some > 5.
There may or may not be any sample points = 5 as mean is a theoretical value.

 

I think the answer should be (D).

 

@Arjun, sir, people from the community, have I gone wrong somewhere ?
Answer:
Position:
Show:

Related questions

43 43 votes
6 answers 6 answers
16.7k
16.7k views
Kathleen asked Sep 23, 2014
16,668 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
41 41 votes
4 answers 4 answers
8.3k
8.3k views
Kathleen asked Sep 23, 2014
8,263 views
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
60 60 votes
5 answers 5 answers
26.3k
26.3k views
Kathleen asked Sep 23, 2014
26,349 views
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...
26 26 votes
6 answers 6 answers
28.1k
28.1k views
Kathleen asked Sep 23, 2014
28,123 views
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR