Probability Theory Questions for SSC CGL

Fundamental Concepts

Probability is the ratio of favorable outcomes to total possible outcomes, always between 0 and 1. Think of it as a fraction: how many ways can your desired event happen, divided by how many total ways can anything happen. Sample space is the set of all possible outcomes. An event is a subset of the sample space. In SSC CGL, you'll mostly work with discrete, finite sample spaces (dice, cards, coins, committees).

• Probability P(E) = Number of favorable outcomes / Total number of possible outcomes
• Sample space S = all possible outcomes; Event E is a subset of S
• Certain event has P = 1; Impossible event has P = 0
• Complementary event: P(E') = 1 - P(E), where E' is 'not E'
• Mutually exclusive events cannot happen together: P(A and B) = 0

Addition Rule (OR Events)

When you want the probability of event A OR event B happening, use the addition rule. The key is to avoid double-counting the overlap. If events are mutually exclusive (cannot both happen), the overlap is zero. If they can overlap, subtract the intersection to avoid counting it twice.

• For any two events: P(A or B) = P(A) + P(B) - P(A and B)
• For mutually exclusive events: P(A or B) = P(A) + P(B)
• Mutually exclusive means A and B cannot happen at the same time
• Common in SSC: drawing cards, selecting committee members with restrictions

Multiplication Rule (AND Events)

When you want the probability of event A AND event B both happening, use the multiplication rule. The critical distinction is between independent events (one doesn't affect the other) and dependent events (one's outcome changes the probability of the other). Most SSC questions involve either independent events or clearly stated conditional probabilities.

• For independent events: P(A and B) = P(A) × P(B)
• For dependent events: P(A and B) = P(A) × P(B|A), where P(B|A) is conditional probability
• Independent: coin flips, dice rolls with replacement, separate draws
• Dependent: drawing cards without replacement, selecting committee members sequentially

Conditional Probability

Conditional probability is the probability of an event given that another event has already occurred. Notation: P(B|A) means 'probability of B given A has happened.' The sample space shrinks to only outcomes where A is true. SSC CGL often tests this in word problems: 'given that a person is selected from a group with a condition, find probability of another property.'

• P(B|A) = P(A and B) / P(A), provided P(A) > 0
• Rearranged: P(A and B) = P(A) × P(B|A)
• Sample space reduces to only outcomes satisfying the given condition
• Common in SSC: committee selection, defective items, disease testing scenarios

Permutations and Combinations in Probability

Many SSC CGL probability questions require counting favorable and total outcomes using permutations (order matters) or combinations (order doesn't matter). A committee selection uses combinations; arranging people in a line uses permutations. Always identify whether order matters before choosing the counting method.

• Permutations nPr = n! / (n-r)! — use when order matters (arrangements, sequences)
• Combinations nCr = n! / (r!(n-r)!) — use when order doesn't matter (selections, committees)
• In probability: P(E) = (favorable outcomes counted via nCr or nPr) / (total outcomes counted same way)
• SSC trap: forgetting to use combinations for 'selecting' and permutations for 'arranging'

• Forgetting to subtract P(A and B) in addition rule — leads to double-counting overlaps. Always ask: 'Can both events happen together?'
• Confusing independent and dependent events — assuming without replacement is independent, or vice versa. Check the problem statement explicitly.
• Using permutations when combinations are needed (or vice versa) — 'selecting a committee' needs combinations; 'arranging in order' needs permutations.
• Misidentifying the sample space — especially in multi-step problems. Redefine sample space carefully after each condition.
• Calculating conditional probability backwards — P(A|B) is NOT the same as P(B|A). Always read 'given' carefully.
• Forgetting the complement rule when direct counting is hard — if P(E) is complex, try P(E') = 1 - P(not E) instead.

• OR = ADD (with subtraction for overlap). AND = MULTIPLY. Think: 'OR spreads, AND narrows.'
• DICE acronym for dependent events: Draw, Inspect, Check, Exclude — each step changes the pool.
• Combinations = Committee (order irrelevant). Permutations = Podium (order matters, 1st/2nd/3rd).
• Conditional P(B|A) = 'B given A' = shrink sample space to A, then find B within it.

• SSC CGL Tier 1 typically has 2-3 probability questions, mostly basic addition/multiplication rules or simple permutation-combination counting. Expect 1-2 minutes per question if you know the concept.
• Tier 2 has 4-5 questions with slightly higher complexity: multi-step conditional probability, committee selection with constraints, or card/dice problems with multiple conditions.
• Recent papers show a trend toward word-problem style questions rather than abstract notation. Read carefully and define events clearly before calculating.
• Complement rule is a time-saver in SSC — if a problem asks 'at least one,' use P(at least one) = 1 - P(none). This saves calculation.
• Always verify your answer is between 0 and 1. If you get a probability > 1 or < 0, you've made an error. Recheck your counting or formula application.