Combinatorial Probability and Independent Events Short Notes for GATE CS
Combinatorial Probability and Independent Events short notes for GATE CS: 3 study cards covering concepts, formulas, shortcuts and exam traps, plus solved pra
combinatorial probability and independent events short notes
Quick Revision: Binomial Models
Summary Checklist
Conditions: Independent trials, Binary outcomes, Constant p.
Formula:
P(X=k)=(kn)pk(1−p)n−k
Parameters:
n: Total trials
k: Desired successes
p: Probability of success
Common Pitfall: Do not use for "without replacement" cases.
Property:∑k=0nP(X=k)=1
Exam Tip:If p=0.5, the distribution is symmetric. (kn)(0.5)n.
Classical Counting Checklist
Summary Checklist
Equally Likely: Verify your sample space outcomes have equal probability.
Distinct Objects: Always treat multiple dice/coins as distinct (Sample space = 6n, not 21).
Complementary Counting: For "at least one/two", calculate 1−P(all distinct).
Replacement Check: With replacement →Nk. Without replacement →NPk.
Algebraic Sets: Solve the constraint equation first to define the exact elements of S.
Final Formula:P(A)=Total Equally Likely OutcomesFavorable Outcomes
Exam Day Checklist: Event Algebra
Exam Day Checklist: Event Algebra
Mutually Exclusive vs Independent: Mutually exclusive means P(A∩B)=0. Independent means P(A∩B)=P(A)P(B). They are mutually exclusive ONLY if they cannot be independent (assuming non-zero probabilities).
"At Least One" Problems: Always calculate 1−P(none). Do not sum the individual cases.
Given P(A),P(B),P(A∪B): Step 1: Find P(A∩B)=P(A)+P(B)−P(A∪B). Step 2: Use this to find any conditional probability or check independence.
Permutation Symmetry: If Event 1 depends on subset X and Event 2 depends on disjoint subset Y, they are independent. Multiply their individual probabilities.
Three Events Independence: Pairwise independence = Mutual independence. You must verify all 4 conditions (3 pairs + 1 triple intersection).
Try a question
Answer it here to see how it works. Nothing is recorded until you sign in.
Question 1
Level 1: Warm-up
A fair coin is tossed 4 times independently. What is the probability of obtaining exactly 2 heads?
Question 2
Level 1: Warm-up
Assertion (A): If P(A∩B)=P(A)×P(B), then events A and B are independent. Reason (R): Independent events cannot occur at the same time.
Question 3
Level 1: Warm-up
Assertion (A): If events A and B are independent, then P(A∣B)=P(A). Reason (R): For independent events, P(A∩B)=P(A)+P(B).
Question 4
Level 1: Warm-up
A test has 3 multiple-choice questions. Each question has 4 options, and a student guesses randomly on all questions. What is the probability of getting at least 2 correct?
Question 5
Level 1: Warm-up
A bag contains 3 red and 2 blue balls. Balls are drawn one by one without replacement. Let X be the number of red balls drawn in 3 draws. Which of the following statements about X is true?
Question 6
Level 1: Warm-up
For a binomial distribution with n=4 and p=0.5, rank the probabilities P(X=0), P(X=2), and P(X=4) in ascending order.
Question 7
Level 1: Warm-up
Assertion (A): The probability of getting a sum of 7 when two unbiased dice are rolled is 1/12.
Reason (R): There are 6 favorable outcomes for a sum of 7 out of 36 total outcomes.
Question 8
Level 1: Warm-up
When six unbiased dice are rolled simultaneously, how many favorable outcomes are there for the event that all six dice show distinct numbers?
Question 9
Level 1: Warm-up
Assertion (A): The probability of getting a sum of 6 when two unbiased dice are rolled is 5%.
Reason (R): There are 5 favorable outcomes out of 36 total outcomes.
Question 10
Level 1: Warm-up
When n unbiased dice are rolled simultaneously, the number of favorable outcomes for the event that all n dice show distinct numbers is exactly 720. What is the value of n?
Free preview ends here
Login to view the complete short notes
Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.
Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.
Built around you, not around a syllabus PDF
Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.
Revision that hits your weak spots
We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.
Questions calibrated to the real exam
Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.
Notes written for recall, not for volume
Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.
One place for everything
Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.
Honest progress
No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.
Unlock the whole course
Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.
Combinatorial Probability and Independent Events Short Notes for GATE CS
Combinatorial Probability and Independent Events short notes for GATE CS: 3 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.
Quick Revision: Binomial Models
Summary Checklist
Conditions: Independent trials, Binary outcomes, Constant p.
Formula:
P(X=k)=(kn)pk(1−p)n−k
Parameters:
n: Total trials
k: Desired successes
p: Probability of success
Common Pitfall: Do not use for "without replacement" cases.
Property:∑k=0nP(X=k)=1
Exam Tip:If p=0.5, the distribution is symmetric. (kn)(0.5)n.
Classical Counting Checklist
Summary Checklist
Equally Likely: Verify your sample space outcomes have equal probability.
Distinct Objects: Always treat multiple dice/coins as distinct (Sample space = 6n, not 21).
Complementary Counting: For "at least one/two", calculate 1−P(all distinct).
Replacement Check: With replacement →Nk. Without replacement →NPk.
Algebraic Sets: Solve the constraint equation first to define the exact elements of S.
Final Formula:P(A)=Total Equally Likely OutcomesFavorable Outcomes
Exam Day Checklist: Event Algebra
Exam Day Checklist: Event Algebra
Mutually Exclusive vs Independent: Mutually exclusive means P(A∩B)=0. Independent means P(A∩B)=P(A)P(B). They are mutually exclusive ONLY if they cannot be independent (assuming non-zero probabilities).
"At Least One" Problems: Always calculate 1−P(none). Do not sum the individual cases.
Given P(A),P(B),P(A∪B): Step 1: Find P(A∩B)=P(A)+P(B)−P(A∪B). Step 2: Use this to find any conditional probability or check independence.
Permutation Symmetry: If Event 1 depends on subset X and Event 2 depends on disjoint subset Y, they are independent. Multiply their individual probabilities.
Three Events Independence: Pairwise independence = Mutual independence. You must verify all 4 conditions (3 pairs + 1 triple intersection).
Combinatorial Probability and Independent Events: Solved Questions with Step-by-Step Explanations (10 Problems)
Question 1 · Engineering MathematicsMCQ
A fair coin is tossed 4 times independently. What is the probability of obtaining exactly 2 heads?
A.
161
B.
83
C.
41
D.
21
Correct Answer:
B
Step-by-Step Solution
Key idea: This is a direct binomial probability calculation with n=4, k=2, p=0.5.
Independent: P(A∩B)=P(A)P(B) (occurrence of one doesn't affect the other)
So R is FALSE.
Step 3: In fact, if A and B are independent with P(A)>0 and P(B)>0, then P(A∩B)=P(A)P(B)>0, meaning they CAN occur together.
Answer: A is true but R is false.
Common trap: Students confuse independence with mutual exclusivity, thinking independent events cannot happen together.
Question 3 · Engineering MathematicsMCQ
Assertion (A): If events A and B are independent, then P(A∣B)=P(A). Reason (R): For independent events, P(A∩B)=P(A)+P(B).
A.
Both A and R are true, and R is the correct explanation of A
B.
Both A and R are true, but R is NOT the correct explanation of A
C.
A is true but R is false
D.
A is false but R is true
Correct Answer:
C
Step-by-Step Solution
Key idea: This is an assertion-reason problem testing the correct formula for independent events.
Step 1: Evaluate Assertion (A): Independence means P(A∣B)=P(A) by definition. So A is TRUE.
Step 2: Evaluate Reason (R): For independent events, P(A∩B)=P(A)P(B), not P(A)+P(B). The formula P(A)+P(B) applies to mutually exclusive events' union, not independent events' intersection. So R is FALSE.
Step 3: Since A is true and R is false, the answer is "A is true but R is false."
Answer: A is true but R is false.
Common trap: Students confuse the independence formula P(A∩B)=P(A)P(B) with the mutually exclusive union formula P(A∪B)=P(A)+P(B).
Question 4 · Engineering MathematicsMCQ
A test has 3 multiple-choice questions. Each question has 4 options, and a student guesses randomly on all questions. What is the probability of getting at least 2 correct?
A.
325
B.
649
C.
641
D.
6427
Correct Answer:
A
Step-by-Step Solution
Key idea: "At least 2" means we need casework: P(X≥2)=P(X=2)+P(X=3).
A bag contains 3 red and 2 blue balls. Balls are drawn one by one without replacement. Let X be the number of red balls drawn in 3 draws. Which of the following statements about X is true?
A.
X follows a binomial distribution
B.
P(X=2)=(23)(53)2(52)
C.
X can take values 0, 1, 2, 3
D.
The draws are independent trials
Correct Answer:
C
Step-by-Step Solution
Key idea: Drawing without replacement violates the independence assumption required for binomial distribution.
Step 1: Analyze the setup: 3 red, 2 blue balls, drawing 3 without replacement.
Step 2: Check binomial conditions:
- Fixed number of trials: Yes, n=3 draws
- Binary outcome: Yes, red or blue
- Independence: No - drawing without replacement changes probabilities
- Constant p: No - probability of red changes after each draw
Step 3: Evaluate each option:
- Option A: False - not binomial because trials are not independent
- Option B: False - this formula assumes binomial with constant p=3/5, but p changes
- Option C: True - X can be 0, 1, 2, or 3 red balls (we draw 3 balls total)
- Option D: False - draws are dependent (without replacement)
Answer: X can take values 0, 1, 2, 3
Question 6 · Engineering MathematicsMCQ
For a binomial distribution with n=4 and p=0.5, rank the probabilities P(X=0), P(X=2), and P(X=4) in ascending order.
A.
P(X=0)<P(X=4)<P(X=2)
B.
P(X=0)=P(X=4)<P(X=2)
C.
P(X=2)<P(X=0)<P(X=4)
D.
P(X=4)<P(X=2)<P(X=0)
Correct Answer:
B
Step-by-Step Solution
Key idea: When p=0.5, the binomial distribution is symmetric about n/2.
Step 1: Calculate P(X=0)=(04)(0.5)0(0.5)4=1/16.
Step 2: Calculate P(X=4)=(44)(0.5)4(0.5)0=1/16.
Step 3: Calculate P(X=2)=(24)(0.5)2(0.5)2=6/16.
Step 4: Compare the values: 1/16=1/16<6/16.
Answer: P(X=0)=P(X=4)<P(X=2).
Question 7 · Engineering MathematicsMCQ
Assertion (A): The probability of getting a sum of 7 when two unbiased dice are rolled is 1/12.
Reason (R): There are 6 favorable outcomes for a sum of 7 out of 36 total outcomes.
A.
Both A and R are true and R is the correct explanation of A.
B.
Both A and R are true but R is not the correct explanation of A.
C.
A is true but R is false.
D.
A is false but R is true.
Correct Answer:
D
Step-by-Step Solution
Key idea: Verify the assertion by calculating the probability from the favorable and total outcomes given in the reason.
Step 1: Check Reason (R): For two dice, total outcomes = 36. Favorable for sum 7: (1,6), (2,5), (3,4), (4,3), (5,2), (6,1). There are 6 outcomes. R is true.
Step 2: Check Assertion (A): Probability = Favorable / Total = 6 / 36 = 1/6.
Step 3: Compare A with the calculated value: A claims 1/12, but the true value is 1/6. So A is false.
Answer: A is false but R is true.
Question 8 · Engineering MathematicsMCQ
When six unbiased dice are rolled simultaneously, how many favorable outcomes are there for the event that all six dice show distinct numbers?
A.
6
B.
36
C.
720
D.
46656
Correct Answer:
C
Step-by-Step Solution
Key idea: "All distinct" for 6 dice means we are arranging the 6 unique faces. This is a permutation of 6 items.
Step 1: Identify the condition: 6 dice, all showing different numbers (1, 2, 3, 4, 5, 6).
Step 2: Calculate favorable outcomes: This is the number of ways to arrange 6 distinct items, which is 6!.
Step 3: Compute 6!=6×5×4×3×2×1=720.
Answer: 720.
Question 9 · Engineering MathematicsMCQ
Assertion (A): The probability of getting a sum of 6 when two unbiased dice are rolled is 5%.
Reason (R): There are 5 favorable outcomes out of 36 total outcomes.
A.
Both A and R are true and R is the correct explanation of A.
B.
Both A and R are true but R is not the correct explanation of A.
C.
A is true but R is false.
D.
A is false but R is true.
Correct Answer:
D
Step-by-Step Solution
Key idea: Verify the assertion by calculating the probability from the favorable and total outcomes.
Step 1: Check Reason (R): For two dice, total outcomes = 36. Favorable for sum 6: (1,5), (2,4), (3,3), (4,2), (5,1). There are 5 outcomes. R is true.
Step 2: Check Assertion (A): Probability = Favorable / Total = 5 / 36.
Step 3: Convert 5/36 to a percentage: 5/36≈0.1388=13.88%.
Step 4: Compare A with the calculated value: A claims 5%, but the true value is 13.88%. So A is false.
Answer: A is false but R is true.
Question 10 · Engineering MathematicsMCQ
When n unbiased dice are rolled simultaneously, the number of favorable outcomes for the event that all n dice show distinct numbers is exactly 720. What is the value of n?
A.
4
B.
5
C.
6
D.
7
Correct Answer:
C
Step-by-Step Solution
Key idea: The number of favorable outcomes for all distinct is 6!/(6−n)!.
Step 1: We are given the favorable outcomes = 720.
Step 2: Recognize that 720=6!.
Step 3: This means we are using all 6 faces, so n=6.