Q.Assume that in a family, each child is equally likely to be a boy or a girl. A family with three children is chosen at random. The probability that the eldest child is a girl given that the family has at least one girl is
(A) 21
(B) 31
(C) 32
(D) 74
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Conditional Probability
Conditional Probability
Roll a die and ask "what is the chance of an even number?" — that is 3/6. But suppose someone tells you the result is greater than 3. Now you are no longer looking at all six faces, only at {4,5,6}, and two of those (4 and 6) are even, so the probability becomes 2/3. That change — from the probability of A to the probability of A given that B has already occurred — is conditional probability.
The Idea: Shrink the Sample Space
Conditioning on B throws away every outcome where B is false and treats B as the new "whole world." You measure A only against what is still possible.
Think of filtering a table of data: unconditional probability uses every row; conditional probability keeps only the rows where the condition is true.
The Definition
For events A and B with P(B)>0,
P(A∣B)=P(B)P(A∩B).
We divide by P(B) to rescale so that B itself has probability 1; the surviving part of A is the overlap A∩B. Checking the die: P(A∩B)=P({4,6})=62 and P(B)=63, so P(A∣B)=3/62/6=32, matching the intuition.
Rearranging gives the multiplication rule P(A∩B)=P(A∣B)P(B), which is usually the easier way to compute a joint probability when a problem says "given that."
Two Cautions
- P(A∣B) and P(B∣A) are generally not equal; swapping them is the classic mistake. They are linked by Bayes' theorem, P(A∣B)=P(B)P(B∣A)P(A). …
Concept: Conditional Probability — we restrict the sample space to families with at least one girl.
Step 1 – Sample space for three children
Each child is B or G with equal chance. Total outcomes: 23=8 equally likely triplets (ordered by age).
Step 2 – Restrict to “at least one girl”
Only the outcome BBB is excluded. So the reduced sample space has 8−1=7 outcomes.
Step 3 – Count favourable cases …
We use conditional probability: reduce the sample space to families with at least one girl, then count how many of those have the eldest child a girl. The answer is 74, option (D).
Why conditional probability?
The question asks: Given that the family has at least one girl, what is the probability the eldest is a girl? This is a classic "restricted sample space" problem. Instead of all 8 equally likely outcomes for three children, we only consider those outcomes that satisfy the condition (at least one girl). Within that smaller set, we count how many also have the eldest child a girl.
The formula is:
P(eldest is girl∣at least one girl)=P(at least one girl)P(eldest is girl AND at least one girl)
But since "eldest is girl" already implies at least one girl, the numerator is just P(eldest is girl).
Step-by-step
1. List all possible outcomes for three children (B = boy, G = girl).
Each child is independent with probability 21 for each gender. The 8 equally likely outcomes are:
| # | Outcome |
|---|---|
| 1 | BBB |
| 2 | BBG |
| 3 | BGB |
| 4 | BGG |
| 5 | GBB |
| 6 | GBG |
| 7 | GGB |
| 8 | GGG |
2. Identify the condition: at least one girl.
Outcomes with no girls: only BBB. So the condition "at least one girl" includes outcomes 2 through 8 — that's 7 outcomes.
3. Identify the event: eldest child is a girl.
The eldest is the first child listed. Outcomes where the first child is G: GBB, GBG, GGB, GGG — that's 4 outcomes.
4. Apply conditional probability.
Since all outcomes are equally likely:
P(eldest is girl∣at least one girl)=Number of outcomes with at least one girlNumber of outcomes with eldest girl AND at least one girl …
Method: Conditional probability on a finite equally-likely sample space
Use this when outcomes are equally likely and you are asked for P(A∣B) — "the probability of A given that B has happened."
Steps
Step 1: List the full sample space of equally likely outcomes.
Enumerate every outcome systematically (all ordered gender sequences, all dice pairs, and so on). Equal likelihood is what lets probability reduce to simple counting.
Step 2: Keep only the outcomes where the condition B is true.
Discard every outcome in which B fails. The survivors form the new "whole world"; let their count be n(B).
Step 3: Among the survivors, count those where A also holds. …
Common Mistakes
Mistake 1: Using the full sample space of 8 as the denominator.
Why it's wrong: the condition "at least one girl" removes BBB, so only 7 outcomes remain possible. Correct approach: the denominator is n(at least one girl)=7, giving 74.
Mistake 2: Ignoring the condition and answering 21. …
Showing the 12 most recent of 45 on this concept.
- COMEDK 2024Set 2024-E1 markMCQQ.A coin is tossed until a head appears or until the coin has been tossed three times. Given that 'head' does not appear on the first toss, what is the probability that the coin is tossed thrice? (A) 21 (B) 83 (C) 81 (D) 41
›Reveal solutionSolution
Given the first toss is a tail, the coin is tossed a third time only if the second toss is also a tail — probability 21.
The coin stops the moment a head appears, or after three tosses. We are told the first toss is a tail (no head on toss 1).
Now the second toss decides:
- Head on toss 2 ⇒ stop after 2 tosses.
- Tail on toss 2 ⇒ a third toss is made. …
- COMEDK 2026Set 2026-M1 markMCQQ.Samhita faces a three-headed dragon. She wins a "Tactical medal" if she manages to defeat exactly one of the three heads. The battle proceeds head-by-head under the following conditions: The probability of defeating the first head is 31. After a win: if she defeats a head, the probability of defeating the next head is 32. After a loss: if she fails to defeat a head, the probability of defeating the next head is 41. What is the probability that Samhita earns the "Tactical medal"? (A) 7223 (B) 365 (C) 7217 (D) 7219
›Reveal solutionSolution
Summing the three disjoint "exactly one win" paths gives 121+181+81=7219 — option (D).
Set up the conditional probabilities. Let Wi mean "defeats head i" and Li mean "fails":
- P(W1)=31, so P(L1)=32.
- After a win: next-head win probability =32, so next-head loss probability =31.
- After a loss: next-head win probability =41, so next-head loss probability =43.
Earning the medal means exactly one of the three heads is defeated. The three disjoint sequences are W1L2L3, L1W2L3, and L1L2W3.
Path 1 — W1L2L3 (win, then loss after a win, then loss after a loss):
P=31⋅31⋅43=363=121
Path 2 — L1W2L3 (loss, then win after a loss, then loss after a win): …
- COMEDK 2024Set 2024-E1 markMCQQ.Suppose we have three cards identical in form except that both sides of the first card are coloured red, both sides of the second are coloured black, and one side of the third card is coloured red and the other side is coloured black. The three cards are mixed and a card is picked randomly. If the upper side of the chosen card is coloured red, what is the probability that the other side is coloured black. (A) 61 (B) 21 (C) 0 (D) 31
›Reveal solutionSolution
This is a classic conditional probability problem (often called the "three cards" or "Bertrand's box" variant). The key is that seeing a red side updates the probability space to only the red sides, and among those, only one belongs to the mixed card. The answer is 1/3.
We are asked: given that the visible side is red, what is the probability that the other side is black? This is not simply "one of the two remaining cards has a black other side" because the cards are not equally likely once we condition on the observation.
Concept and Intuition
The pitfall is to think: "We see red, so the card is either the all-red or the mixed card. That's two possibilities, so the chance is 1/2." But this ignores that the all-red card has two red sides, while the mixed card has only one red side. When we pick a card at random and then look at a random side, each of the six sides is equally likely to be the one we see. Seeing red eliminates the three black sides, leaving only the three red sides. Among those three red sides, two belong to the all-red card and only one belongs to the mixed card. So the probability that the other side is black is 1/3.
Step-by-step reasoning
-
Label the sides.
Let the cards be:
- Card A: both sides red (sides R1,R2)
- Card B: both sides black (sides B1,B2)
- Card C: one red, one black (sides R3,B3)
-
Count equally likely outcomes.
When we pick a card uniformly at random and then look at a random side, there are 3×2=6 equally likely side-views. Each of the six sides has probability 1/6 of being the one we see.
-
Condition on seeing a red side.
The red sides are: R1,R2 (from card A) and R3 (from card C). That's 3 red sides. So the conditional space has 3 equally likely possibilities. …
-
- KCET 2025Set A-11 markMCQQ.Meera visits only one of the two temples A and B in her locality. Probability that she visits temple A is 52. If she visits temple A, 31 is the probability that she meets her friend, whereas it is 72 if she visits temple B. Meera met her friend at one of the two temples. The probability that she met her at temple B is (A) 167 (B) 165 (C) 163 (D) 169
›Reveal solutionSolution
The friend has already been met (the effect); we want the probability of the cause (temple B) — that reversal of conditioning is exactly Bayes' theorem.
Step 1 — Name the events.
Let A = "Meera visits temple A", B = "Meera visits temple B", F = "she meets her friend".
She visits only one of the two temples, so A and B are mutually exclusive and exhaustive:
P(A)=52⟹P(B)=1−52=53.
Given: P(F∣A)=31, P(F∣B)=72.
Step 2 — Why Bayes.
We are told the outcome (F happened) and asked for the probability of a cause (B). Bayes' theorem inverts the conditioning:
P(B∣F)=P(A)P(F∣A)+P(B)P(F∣B)P(B)P(F∣B).
The denominator is P(F) by the law of total probability — the friend can be met on either branch.
Step 3 — Compute the two branch probabilities.
P(A∩F)=52×31=152,P(B∩F)=53×72=356.
Step 4 — Total probability of meeting the friend. …
- COMEDK 2024Set 2024-A1 markMCQQ.P and Q are considering to apply for a job. The probability that P applies for the job is 41. The probability that P applies for the job given that Q applies for the job is 21, and the probability that Q applies for the job given that P applies for the job is 31. Then the probability that P does not apply for the job given that Q does not apply for the job is (A) 54 (B) 87 (C) 65 (D) 1211
›Reveal solutionSolution
We are given conditional probabilities and need to find P(P∣Q). Using the definitions of conditional probability and the law of total probability, we compute P(Q) and P(Q), then apply Bayes' theorem to get 54, which corresponds to option (A).
Concept and intuition:
This is a classic problem of working backwards from conditional probabilities to find a joint probability table. We know P(P), P(P∣Q), and P(Q∣P). From these, we can find P(P∩Q) in two ways, which lets us solve for P(Q). Then we can compute the desired conditional probability P(P∣Q) using the complement rule and the definition of conditional probability.
Step-by-step solution:
- Write down what is given. Let P = event that P applies, Q = event that Q applies. We have:
P(P)=41,P(P∣Q)=21,P(Q∣P)=31.
- Use the definition of conditional probability to express P(P∩Q) in two ways. From P(P∣Q)=P(Q)P(P∩Q), we get
P(P∩Q)=P(P∣Q)⋅P(Q)=21P(Q).
From P(Q∣P)=P(P)P(P∩Q), we get
P(P∩Q)=P(Q∣P)⋅P(P)=31⋅41=121.
- Equate the two expressions for P(P∩Q) to find P(Q).
21P(Q)=121⇒P(Q)=61.
- Find P(Q) and P(P∩Q).
P(Q)=1−P(Q)=1−61=65.
Also, P(P∩Q)=P(P)−P(P∩Q)=41−121=123−121=122=61.
- Find P(P∩Q). Since P∩Q is the complement of P∪Q, we can use:
P(P∩Q)=1−P(P∪Q).
First, P(P∪Q)=P(P)+P(Q)−P(P∩Q)=41+61−121. …
- KCET 2019Set A-11 markMCQQ.A man speaks truth 2 out of 3 times. He picks one of the natural numbers in the set S={1,2,3,4,5,6,7} and reports that it is even. The probability that it is actually even is (A) 52 (B) 51 (C) 101 (D) 53
›Reveal solutionSolution
By Bayes' theorem the probability is 53 — option (D).
The set S={1,2,3,4,5,6,7} has 3 even numbers (2,4,6) and 4 odd numbers, and one number is picked at random.
Let E = "the number is even" and R = "the man reports it as even."
Priors.
P(E)=73,P(Ec)=74.
Likelihoods. He tells the truth with probability 32 and lies with probability 31.
- If the number really is even, a truthful report says "even": P(R∣E)=32.
- If the number is odd, only a lie reports "even": P(R∣Ec)=31.
Bayes' theorem. …
- COMEDK 2023Set 2023-E1 markMCQQ.A die is thrown twice and the sum of numbers appearing is observed to be 8 . What is the conditional probability that the number 5 has appeared atleast once? (A) 365 (B) 52 (C) 181 (D) 31
›Reveal solutionSolution
Given the sum is 8, the sample space is the 5 ordered pairs summing to 8; two of them include a 5, giving probability 52.
The ordered outcomes with sum 8 are
(2,6),(3,5),(4,4),(5,3),(6,2)(5 outcomes). …
- KCET 2020Set A-11 markMCQQ.If A and B are two events such that P(A)=31, P(B)=21 and P(A∩B)=61, then P(A′/B) is (A) 32 (B) 31 (C) 21 (D) 121
›Reveal solutionSolution
Use P(A′∣B)=1−P(A∣B) (equivalently P(B)P(B)−P(A∩B)), which gives 32.
Step 1 — The definition of conditional probability.
For P(B)>0,
P(A′∣B)=P(B)P(A′∩B)
Conditioning on B means we restrict the sample space to B and ask what fraction of B lies outside A.
Step 2 — Split B into the part inside A and the part outside A.
The events A∩B and A′∩B are disjoint and their union is exactly B:
P(B)=P(A∩B)+P(A′∩B)
⇒P(A′∩B)=P(B)−P(A∩B)=21−61=63−1=62=31
Step 3 — Divide by P(B).
P(A′∣B)=P(B)P(A′∩B)=2131=31×12=32
Step 4 — Cross-check with the complement rule. …
- KCET 2020Set A-11 markMCQQ.The probability of solving a problem by three persons A, B and C independently is 21, 41 and 31 respectively. Then the probability of the problem is solved by any two of them is (A) 121 (B) 41 (C) 241 (D) 81
›Reveal solutionSolution
The problem asks for the probability that exactly two of the three persons solve it. We compute the sum of probabilities for each pair solving while the third fails, giving 81.
The key idea: "solved by any two of them" means exactly two solve it, not at least two. The third person must fail. Since A, B, and C work independently, we multiply their individual probabilities for each specific outcome and then add the three possible cases.
A common mistake is to include the case where all three solve it. That would be "at least two", not "any two". The phrase "any two" in probability problems almost always means exactly two.
Let’s denote:
- P(A)=21, so P(A fails)=1−21=21
- P(B)=41, so P(B fails)=1−41=43
- P(C)=31, so P(C fails)=1−31=32
We want exactly two successes. There are three mutually exclusive ways this happens:
-
A and B solve, C fails
Probability = P(A)×P(B)×P(C fails)
=21×41×32=242=121
-
A and C solve, B fails
Probability = P(A)×P(C)×P(B fails)
=21×31×43=243=81
-
B and C solve, A fails
Probability = P(B)×P(C)×P(A fails) …
- COMEDK 2021Set 2021-B1 markMCQQ.At a certain university 4% of male students are over 6 feet tall and 1% of female students are over 6 feet tall. The total student population is divided in the ratio 3 : 2, in favor of female students. If a student is selected at random from amongst all those over 6 feet tall, what is the probability that the student is a female? (A) 1/3 (B) 2/5 (C) 3/11 (D) 3/5
›Reveal solutionSolution
Bayes' theorem gives P(female∣>6ft)=0.0220.006=113.
Population split 3:2 in favour of females ⇒ P(F)=53=0.6, P(M)=52=0.4.
Tall fractions: P(T∣F)=0.01, P(T∣M)=0.04.
By Bayes' theorem: …
- KCET 2021Set A-11 markMCQQ.Two dice are thrown. If it is known that the sum of numbers on the dice was less than 6 the probability of getting a sum as 3 is (A) 181 (B) 185 (C) 51 (D) 52
›Reveal solutionSolution
We use conditional probability: reduce the sample space to only those outcomes where the sum is less than 6, then find the fraction of those that give a sum of exactly 3. The answer is 51.
The key idea here is conditional probability — the probability of one event given that another event has already occurred. When we say "if it is known that the sum was less than 6", we are no longer considering all 36 possible outcomes of throwing two dice. Instead, we restrict ourselves to only those outcomes that satisfy the condition, and then ask: within this smaller set, what fraction gives a sum of 3?
Let’s work it out step by step.
-
List all possible outcomes when two dice are thrown.
Each die shows a number from 1 to 6. The total number of ordered pairs (a,b) is 6×6=36.
-
Identify the condition: sum less than 6.
The possible sums are 2, 3, 4, and 5 (since sum = 1 is impossible with two dice). Let’s list all ordered pairs that give each sum:
- Sum = 2: (1,1) → 1 outcome
- Sum = 3: (1,2),(2,1) → 2 outcomes
- Sum = 4: (1,3),(2,2),(3,1) → 3 outcomes
- Sum = 5: (1,4),(2,3),(3,2),(4,1) → 4 outcomes
Total outcomes with sum < 6: 1+2+3+4=10.
Watch outA common mistake is to forget that (1,2) and (2,1) are different outcomes. Dice are distinct, so order matters. Always count ordered pairs unless the problem explicitly says "identical dice" (which is rare in such problems).
-
Identify the event of interest: sum = 3. …
-
- KCET 2020Set A-11 markMCQQ.Events E1 and E2 form a partition of the sample space S. A is any event such that P(E1)=P(E2)=21, P(E2/A)=21 and P(A/E2)=32, then P(E1/A) is (A) 21 (B) 32 (C) 1 (D) 41
›Reveal solutionSolution
A partition's posterior probabilities must add to 1, so P(E1∣A)=1−P(E2∣A)=1−21=21.
Step 1 — What "partition of the sample space" means.
E1 and E2 form a partition of S if they are mutually exclusive (E1∩E2=∅) and exhaustive (E1∪E2=S), with non-zero probabilities. So exactly one of them must occur.
Step 2 — Conditioning preserves the partition.
Conditioning on an event A (with P(A)>0) just renormalises probabilities inside A; it does not destroy the partition. Formally,
A=(A∩E1)∪(A∩E2),(A∩E1)∩(A∩E2)=∅
Dividing by P(A):
P(A)P(A∩E1)+P(A)P(A∩E2)=P(A)P(A)=1
which is precisely
P(E1∣A)+P(E2∣A)=1
The posterior probabilities of a partition must still sum to 1 — a fact worth remembering, since it turns many Bayes questions into a one-line subtraction.
Step 3 — Substitute the given value.
P(E1∣A)=1−P(E2∣A)=1−21=21 …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.