Tree Diagram: A visual representation of all possible outcomes of a multi-stage experiment, showing each branch as a possible outcome at each stage.
- Stage 1: Draw branches for first flip (H, T)
- Stage 2: From each Stage 1 outcome, draw branches for second flip (H, T)
- Final Outcomes: Read paths from root to leaves
- Count: Identify favorable outcomes
Start → H → H (HH), Start → H → T (HT), Start → T → H (TH), Start → T → T (TT)
S = {HH, HT, TH, TT}
Total outcomes = 4
Exactly one head: {HT, TH} → 2 favorable outcomes
Sample space: {HH, HT, TH, TT}. P(exactly one head) = 2/4 = 1/2 = 0.5.
• Systematic Listing: Tree diagrams ensure all outcomes are counted
• Multiplication Rule: Number of outcomes = Product of choices at each stage
• Path Counting: Each path from root to leaf represents one outcome
Sample Space: The set of all possible outcomes of an experiment.
Die 1: {1, 2, 3, 4, 5, 6}, Die 2: {1, 2, 3, 4, 5, 6}
S = {(1,1), (1,2), ..., (1,6), (2,1), ..., (6,6)}
Total outcomes = 6 × 6 = 36
{(1,6), (2,5), (3,4), (4,3), (5,2), (6,1)} → 6 favorable outcomes
Sample space has 36 outcomes. P(sum of 7) = 6/36 = 1/6 ≈ 0.167.
• Counting Principle: Total outcomes = n₁ × n₂ × ... × nₖ
• Ordered Pairs: (die1, die2) distinguishes between outcomes
• Systematic Counting: Organize outcomes in systematic manner
Venn Diagram: A visual representation showing relationships between sets using overlapping circles.
Total = 100, Soccer = 60, Basketball = 45, Both = 20
Only soccer = 60 - 20 = 40, Only basketball = 45 - 20 = 25, Both = 20
At least one = 40 + 25 + 20 = 85
Neither = 100 - 85 = 15
15 students play neither sport. P(neither) = 15/100 = 0.15.
• Inclusion-Exclusion: |A ∪ B| = |A| + |B| - |A ∩ B|
• Set Relationships: Venn diagrams clarify overlapping sets
• Complement Rule: P(neither) = 1 - P(at least one)