• edited by
21,429 views
72 72 votes

Let $P(E)$ denote the probability of the event $E$. Given $P(A) = 1$, $P(B) =\dfrac{1}{2}$, the values of $P(A\mid B)$ and $P(B\mid A)$ respectively are

  1. $\left(\dfrac{1}{4}\right),\left(\dfrac{1}{2}\right)$
  2. $\left(\dfrac{1}{2}\right),\left(\dfrac{1}{4}\right)$
  3. $\left(\dfrac{1}{2}\right),{1}$
  4.   ${1},\left(\dfrac{1}{2}\right)$

12 Answers

Best answer
90 90 votes

It immediately follows from the monotonicity property that, 
$0\leq P(E)\leq 1,$

Probability of at least one means union of the probability of events, i.e.,
$P(A\cup B) = P(A) + P(B) - P(A\cap B)$ 
here, $P(A\cup B) = 1$ , because it can not be more than $1$ and if at least one of the event has probability $1$ (here , $P(A) = 1$), then union of both should be $1.$ 
So,
$P(A\cup B) = P(A) + P(B) - P(A\cap B)$

    $1 = 1 + \dfrac{1}{2} - P(A\cap B) ,$
    $P(A\cap B) =\dfrac{1}{2},$ 
Now,
$P(A\mid B) = \dfrac{P(A\cap B)}{P(B)} = \dfrac{\left(\dfrac{1}{2}\right)}{\left(\dfrac{1}{2}\right)} = 1 ,$
$P(B\mid A) = \dfrac{P(A\cap B)}{P(A)} =\dfrac{\left(\dfrac{1}{2}\right)} { 1} =\dfrac{1}{2} .$ 
Hence, option is $(D)$.

NOTE :- if at least one of the two events has probability 1, then both events should be independent but vise versa is not true. 

• edited by
48 48 votes
P(A) = 1.

So no matter what happens with B , A always happens.
If you check options there is no need to even think in this question.

Only Option D is correct. As happening or not happening of even B does not reduce probability of Even A from 1 to 1/2 or 1/4.
17 17 votes

An event is a subset of Universe of sample space (P(U) = 1).

Notice here, P(A) = 1, so you can thing of A as whole universe,

event B is a subset of event A.

$P(A \cap B) = P(B) = \frac{1}{2} $

$P(A/B) = \frac{P(A \cap B)}{P(B)} = \frac{\frac{1}{2}}{\frac{1}{2}} = 1$

$P(B/A) = \frac{P(A \cap B)}{P(A)} = \frac{\frac{1}{2}}{1} = \frac{1}{2}$

• edited by
6 6 votes

P(A/B) = 1. 

Reason : 

P(A) = 1 says that Event A will always happen irrespective of whether B happens or not.

So P(A/B) = P(A/B') = P(A) = 1.

P(B/A) = 1/2

Reason : 

      Statement - 1 : Probability of B given that A has happened = 1/2.

      Statement - 2 : A will always happen (i.e) P(A) = 1 .

      Since both Statement-1 and Statement-2 are given in question, we can always assume that both are TRUE.

If we assume both as TRUE, then conclusion we can draw is " Probability of B is always 1/2 as A will always happen".

So P(B) = P(B/A) = 1/2.

Option D) is the answer... 

3 3 votes

think like OSA:

Probability of A=1.

Probability of B=1/2


Probability of A given that B has happened, P(A|B)= 1
it has to be one. BECAUSE. Probability of A is 1
and It will still be 1 even if B has happened(unless B reduces it)
Since A and B(intersection) is non zero.

SO only option D is right!

3 3 votes
Here P(A) and P(B) are given :

So, P(A) = 1 and P(B) = ½

We have to find P(A|B) and P(B|A)

We know that P(A|B) = P(A∩B)/P(B) similarly P(B∩A)/P(A)

So we know that P(A∩B) = P(A) * P(B) = 1*½ = ½

So put this in the above formula:

P(A|B) = ½/½ = 1

P(B|A) = ½/1 = ½

So the final answer is 1 and (1/2) respectively.

Option – (D)
Answer:
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
14.7k
14.7k views
Kathleen asked Sep 17, 2014
14,725 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
65 65 votes
7 answers 7 answers
24.6k
24.6k views
Kathleen asked Sep 17, 2014
24,630 views
Consider the set of relations shown below and the SQL query that follows.Students: (Roll_number, Name, Date_of_birth)Courses: (Course_number, Course_name, Instructor)Grad...
58 58 votes
5 answers 5 answers
22.9k
22.9k views
Kathleen asked Sep 17, 2014
22,921 views
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries?Smaller sizes of executable fi...
94 94 votes
4 answers 4 answers
31.6k
31.6k views
Kathleen asked Sep 17, 2014
31,579 views
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...