Solved Exercises on Sample Spaces and Tree Diagrams in Grade 8

Master sample spaces and tree diagrams: coin flips, dice rolls, spinner outcomes, and complex probability scenarios through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Coin Flip Sample Space
Exercise 1
A fair coin is flipped twice. List the sample space and draw a tree diagram to represent all possible outcomes.
Definition:

Sample space: The set of all possible outcomes of an experiment. For two coin flips: {HH, HT, TH, TT}

Tree diagram: A visual representation showing all possible outcomes of sequential events.

Method for creating tree diagrams:
  1. Start with initial node
  2. Draw branches for first event outcomes
  3. From each first-event outcome, draw branches for second event outcomes
  4. Continue for all stages
  5. List all final outcomes
First Flip
H, T
Second Flip
H, T
Sample Space
{HH, HT, TH, TT}
Step 1: Identify the events

First flip: Head (H) or Tail (T)

Second flip: Head (H) or Tail (T)

Step 2: Draw the tree diagram
Start
H
T
HH
HT
TH
TT
Step 3: List the sample space

All possible outcomes: {HH, HT, TH, TT}

Number of outcomes: 4

Step 4: Verify completeness

Each path from start to end represents one outcome

All outcomes are equally likely with probability 1/4

Sample Space: {HH, HT, TH, TT}
Final answer:

The sample space for flipping a coin twice is {HH, HT, TH, TT} with 4 equally likely outcomes.

Applied rules:

• Counting Principle: For independent events, multiply possibilities: 2 × 2 = 4 outcomes

• Tree Structure: Each level represents one stage of the experiment

• Complete Coverage: Every possible outcome is represented in the tree

2 Die Roll and Coin Flip
Exercise 2
A fair six-sided die is rolled and then a fair coin is flipped. List the sample space and draw a tree diagram representing all possible outcomes.
Definition:

Compound experiment: An experiment consisting of multiple stages. Sample space includes ordered pairs of outcomes from each stage.

Die Outcomes
1,2,3,4,5,6
Coin Outcomes
H, T
Total Outcomes
6 × 2 = 12
Step 1: Identify the events

First event: Roll a die (6 outcomes: 1, 2, 3, 4, 5, 6)

Second event: Flip a coin (2 outcomes: H, T)

Step 2: Apply the counting principle

Total outcomes = 6 × 2 = 12

Step 3: List the sample space

{(1,H), (1,T), (2,H), (2,T), (3,H), (3,T), (4,H), (4,T), (5,H), (5,T), (6,H), (6,T)}

Step 4: Draw the tree diagram
Start
1
2
3
4
5
6
1H
1T
2H
2T
3H
3T
4H
4T
5H
5T
6H
6T
Sample Space: {(1,H), (1,T), ..., (6,T)}
Final answer:

The sample space contains 12 outcomes: {(1,H), (1,T), (2,H), (2,T), (3,H), (3,T), (4,H), (4,T), (5,H), (5,T), (6,H), (6,T)}

Applied rules:

• Counting Principle: For independent events, total outcomes = m × n

• Ordered Pairs: Each outcome is represented as (die result, coin result)

• Systematic Listing: Organize outcomes in a logical order

3 Spinner Outcomes
Exercise 3
A spinner has 3 equal sections: red, blue, and green. The spinner is spun twice. List the sample space and draw a tree diagram representing all possible outcomes.
Definition:

Spinner experiment: Each spin is independent, and each color has equal probability of 1/3.

First Spin
R, B, G
Second Spin
R, B, G
Total Outcomes
3 × 3 = 9
Step 1: Identify the events

First spin: Red (R), Blue (B), or Green (G)

Second spin: Red (R), Blue (B), or Green (G)

Step 2: Calculate total outcomes

Using counting principle: 3 × 3 = 9 outcomes

Step 3: List the sample space

{(R,R), (R,B), (R,G), (B,R), (B,B), (B,G), (G,R), (G,B), (G,G)}

Step 4: Draw the tree diagram
Start
R
B
G
RR
RB
RG
BR
BB
BG
GR
GB
GG
Sample Space: {(R,R), (R,B), (R,G), (B,R), (B,B), (B,G), (G,R), (G,B), (G,G)}
Final answer:

The sample space contains 9 outcomes: {(R,R), (R,B), (R,G), (B,R), (B,B), (B,G), (G,R), (G,B), (G,G)}

Applied rules:

• Equal Sections: Each color has equal probability of 1/3

• Independence: First spin doesn't affect second spin

• Counting Principle: Total outcomes = 3 × 3 = 9

Rules and methods, laws,...
Total Outcomes = n₁ × n₂ × ... × nₖ
Counting Principle
Sample Space
Set of all outcomes
All possible results
Tree Diagram
Visual representation
Branches show paths
Counting Rule
Multiplication
For independent events
Key definitions:

Sample space: The set of all possible outcomes of an experiment

Tree diagram: A branching diagram showing all possible outcomes of sequential events

Counting principle: For independent events, multiply the number of outcomes

Event: A specific outcome or set of outcomes

Outcome: A possible result of an experiment

Complete methodology:
  1. Identify the experiment: Determine what actions are being performed
  2. Count possible outcomes: For each stage of the experiment
  3. Apply counting principle: Multiply the number of outcomes
  4. Construct tree diagram: Show all possible paths
  5. List sample space: Write all possible outcomes
Tip 1: Tree diagrams help visualize complex multi-stage experiments.
Tip 2: Counting principle: Multiply possibilities at each stage.
Tip 3: Systematically list outcomes to avoid missing any.
Tip 4: Tree diagrams grow exponentially with each stage.
Common errors: Missing outcomes, double counting, misapplying counting principle.
Exam preparation: Practice with various experiments, master counting principle, draw clear diagrams.
Formulas to know by heart:

• Counting Principle: Total Outcomes = n₁ × n₂ × ... × nₖ

• Tree Diagram: Each path represents one outcome

• Sample Space: Contains all possible outcomes

• For n identical stages with k outcomes: kⁿ total outcomes

Solution: Exercises 4 to 5
4 Three-Stage Experiment
Exercise 4
A coin is flipped, then a die is rolled, then a coin is flipped again. Draw a tree diagram and list the sample space for this three-stage experiment.
Definition:

Multi-stage experiment: An experiment with more than two stages. Each stage contributes to the total number of outcomes.

Stage 1
2 outcomes
Stage 2
6 outcomes
Stage 3
2 outcomes
Total
2×6×2 = 24
Step 1: Identify the stages

Stage 1: Flip coin (H or T) = 2 outcomes

Stage 2: Roll die (1, 2, 3, 4, 5, 6) = 6 outcomes

Stage 3: Flip coin (H or T) = 2 outcomes

Step 2: Apply counting principle

Total outcomes = 2 × 6 × 2 = 24 outcomes

Step 3: Draw partial tree diagram
Start
H
T
H1
H2
H3
H4
H5
H6
T1
T2
T3
T4
T5
T6
H1H
H1T
H2H
H2T
H3H
H3T
H4H
H4T
H5H
H5T
H6H
H6T
T1H
T1T
T2H
T2T
T3H
T3T
T4H
T4T
T5H
T5T
T6H
T6T
Step 4: List the sample space

{(H,1,H), (H,1,T), (H,2,H), (H,2,T), ..., (T,6,H), (T,6,T)}

Complete set: 24 ordered triples

Sample Space: {(H,1,H), (H,1,T), ..., (T,6,T)} - 24 outcomes
Final answer:

The sample space contains 24 outcomes: {(H,1,H), (H,1,T), (H,2,H), (H,2,T), (H,3,H), (H,3,T), (H,4,H), (H,4,T), (H,5,H), (H,5,T), (H,6,H), (H,6,T), (T,1,H), (T,1,T), (T,2,H), (T,2,T), (T,3,H), (T,3,T), (T,4,H), (T,4,T), (T,5,H), (T,5,T), (T,6,H), (T,6,T)}

Applied rules:

• Multi-stage Counting: For independent stages, multiply outcomes: 2 × 6 × 2 = 24

• Ordered Triples: Each outcome is represented as (coin1, die, coin2)

• Systematic Approach: Work through each stage methodically

5 Complex Probability Calculation
Exercise 5
A bag contains 2 red marbles and 1 blue marble. Two marbles are drawn WITH replacement. Use a tree diagram to find the probability of drawing exactly one red marble.
Definition:

With replacement: After drawing a marble, it's put back, so probabilities remain constant for each draw.

P(Red)
2/3
P(Blue)
1/3
P(One Red)
4/9
Step 1: Identify the probabilities

Bag: 2 red, 1 blue (total 3)

P(red) = 2/3, P(blue) = 1/3

With replacement: probabilities stay the same

Step 2: Draw the tree diagram
Start
R (2/3)
B (1/3)
RR (2/3×2/3)
RB (2/3×1/3)
BR (1/3×2/3)
BB (1/3×1/3)
Step 3: Identify favorable outcomes

Exactly one red means: RB or BR

P(RB) = 2/3 × 1/3 = 2/9

P(BR) = 1/3 × 2/3 = 2/9

Step 4: Calculate final probability

P(exactly one red) = P(RB) + P(BR) = 2/9 + 2/9 = 4/9

P(exactly one red) = 4/9
Final answer:

The probability of drawing exactly one red marble is 4/9.

Applied rules:

• With Replacement: Probabilities remain constant

• Multiplication Rule: For paths, multiply probabilities along the path

• Addition Rule: For multiple favorable outcomes, add their probabilities

Key Concepts: Definitions, Formulas, Methods, Tips
Total Outcomes = n₁ × n₂ × ... × nₖ
Counting Principle
Key definitions:

Sample space: The set of all possible outcomes of an experiment

Tree diagram: A visual tool that shows all possible outcomes of sequential events

Counting principle: For independent events, the total number of outcomes is the product of outcomes at each stage

Event: A specific outcome or collection of outcomes

Outcome: A possible result of an experiment

Complete methodology:
  1. Identify the experiment: Determine what actions are being performed
  2. Count outcomes per stage: For each stage of the experiment
  3. Apply counting principle: Multiply the number of outcomes at each stage
  4. Construct tree diagram: Start from root and branch out systematically
  5. List sample space: Write all possible outcomes as ordered sets
Tip 1: Tree diagrams become unwieldy quickly; use counting principle for large numbers.
Tip 2: For probability calculations, multiply along paths and add across outcomes.
Tip 3: Label tree branches with probabilities to solve probability problems.
Tip 4: Verify your sample space by ensuring all outcomes are equally likely and complete.
Common errors: Missing outcomes in sample space, miscounting, incorrect tree construction.
Exam preparation: Practice with various multi-stage experiments, master systematic listing.
Formulas to know by heart:

• Counting Principle: Total Outcomes = n₁ × n₂ × ... × nₖ

• Tree Diagram: Each path from root to leaf represents one outcome

• Probability Along Path: Multiply probabilities at each branch

• Probability of Multiple Paths: Add probabilities of favorable paths

• For n identical stages with k outcomes: kⁿ total outcomes

Detailed Summary: Sample Spaces and Tree Diagrams
Core Definitions

Sample Space: The set of all possible outcomes of an experiment. It's usually denoted by S or Ω. For example, flipping a coin once: S = {H, T}. For flipping a coin twice: S = {HH, HT, TH, TT}.

Tree Diagram: A visual representation that shows all possible outcomes of sequential events. Each branch represents a possible outcome, and each path from root to leaf represents a complete sequence of outcomes.

Experiment: Any process that produces an observable outcome. It can be single-stage (one action) or multi-stage (multiple actions).

Outcome: A specific result of an experiment. For example, getting "Heads" when flipping a coin is an outcome.

Event: A subset of the sample space. For example, getting at least one head when flipping two coins is an event containing {HH, HT, TH}.

Core Rules and Laws

Counting Principle: If one event can occur in m ways and a second event can occur independently in n ways, then the two events can occur in m × n ways. For k stages: n₁ × n₂ × ... × nₖ ways.

Tree Construction Rule: Each level of the tree corresponds to one stage of the experiment. Each branch from a node represents a possible outcome at that stage.

Path-to-Outcome Rule: Each complete path from the starting point to an endpoint represents one specific outcome in the sample space.

Probability Along Paths: To find the probability of a specific sequence, multiply the probabilities along the path.

Probability of Events: To find the probability of an event, add the probabilities of all outcomes that make up the event.

Step-by-Step Methods

Creating a Sample Space:

  1. Identify all stages of the experiment
  2. List all possible outcomes for each stage
  3. Apply the counting principle to determine total number of outcomes
  4. Systematically list all possible combinations
  5. Verify completeness and correctness

Constructing a Tree Diagram:

  1. Start with a root node representing the beginning
  2. Draw branches for the first stage outcomes
  3. From each first-stage outcome, draw branches for second stage outcomes
  4. Continue for all stages
  5. Label endpoints with complete outcomes
Examples and Applications

Simple Example (Single Stage): Rolling a die once

Sample space: S = {1, 2, 3, 4, 5, 6}, Total outcomes: 6

Intermediate Example (Two Stages): Flipping a coin, then rolling a die

Sample space: S = {(H,1), (H,2), ..., (H,6), (T,1), ..., (T,6)}, Total outcomes: 2 × 6 = 12

Advanced Example (Three Stages): Flipping a coin, rolling a die, flipping another coin

Sample space: S = {(H,1,H), (H,1,T), ..., (T,6,T)}, Total outcomes: 2 × 6 × 2 = 24

Tips and Common Pitfalls

Tips:

  • Use tree diagrams for experiments with 2-3 stages to visualize all outcomes
  • For more complex experiments, rely on the counting principle
  • Always label tree branches with outcomes and probabilities when solving probability problems
  • Systematically list outcomes to avoid missing any
  • Verify that the number of outcomes matches the counting principle calculation

Common Mistakes:

  • Missing outcomes in the sample space
  • Double-counting outcomes
  • Incorrectly applying the counting principle to dependent events
  • Confusing sample space with events
  • Forgetting to account for order in ordered pairs
Key Notes for Memorization

SAMPLE SPACE = ALL POSSIBLE OUTCOMES

TREE DIAGRAM = VISIBLE PATH OF EVENTS

COUNTING PRINCIPLE = MULTIPLY AT EACH STAGE

PROBABILITY = MULTIPLY ALONG PATHS, ADD ACROSS OUTCOMES

WITH REPLACEMENT = PROBABILITIES STAY CONSTANT

WITHOUT REPLACEMENT = PROBABILITIES CHANGE

Questions & Answers

Question: When should I use a tree diagram versus just listing the sample space? They seem to give the same information.

Answer: Great question! Here's when to use each:

  • Tree Diagram: Best for experiments with 2-3 stages, especially when you need to visualize the process or calculate probabilities along the way
  • Listing Sample Space: Best for simple experiments or when you just need the final set of outcomes

Use tree diagrams when:

  • You're calculating probabilities for specific sequences
  • The experiment has a clear sequential structure
  • You want to visualize the process step-by-step

Use direct listing when:

  • The sample space is small and simple
  • You only need to know the possible outcomes
  • The experiment is symmetric or follows a clear pattern

Question: How do I apply the counting principle when events aren't independent? For example, drawing marbles without replacement.

Answer: The counting principle works differently for dependent events:

  • Independent Events: Same number of choices at each stage (e.g., with replacement)
  • Dependent Events: Number of choices changes at each stage (e.g., without replacement)

Example - Independent (with replacement):

Bag: 3 red, 2 blue marbles. Draw 2 marbles with replacement.

Stage 1: 5 choices, Stage 2: 5 choices (still 5 because we replaced)

Total outcomes: 5 × 5 = 25

Example - Dependent (without replacement):

Same bag, draw 2 marbles without replacement.

Stage 1: 5 choices, Stage 2: 4 choices (only 4 left after first draw)

Total outcomes: 5 × 4 = 20

For dependent events, the counting principle still applies, but you adjust the number of choices at each stage based on previous outcomes.

Question: How do I use tree diagrams to calculate probabilities, not just list outcomes?

Answer: Tree diagrams are excellent for probability calculations! Here's how:

  • Label each branch: Write the probability of each outcome on its branch
  • Multiply along paths: To find probability of a specific sequence, multiply probabilities along that path
  • Add across outcomes: To find probability of an event, add probabilities of all paths that satisfy the event

Example: Flip a coin (P(H)=1/2, P(T)=1/2), then roll a die (P(each number)=1/6).

Probability of getting (H, 3): P(H) × P(3) = 1/2 × 1/6 = 1/12

Probability of getting a head followed by an even number: P(H,2) + P(H,4) + P(H,6) = 1/12 + 1/12 + 1/12 = 3/12 = 1/4

Tree diagrams make it visual to see which paths contribute to your desired event and how to calculate their probabilities.