Sample Space and Tree Diagrams
Master listing all outcomes systematically — tree diagrams, grid method, and the multiplication principle that makes counting effortless.
Printable Worksheets
Print or save as PDF — or build a custom worksheet from any module's questions.
Before you read on — quickly: A restaurant offers 2 choices of main (chicken or fish) and 3 choices of side (chips, salad, or rice). How many different meal combinations are possible? Try to list them all.
A sample space is the complete list of ALL possible outcomes of an experiment. Tree diagrams organise multi-stage outcomes systematically by branching at each stage. The multiplication principle lets you count total outcomes without listing them all.
For a two-stage experiment, draw a branch for each possibility at Stage 1, then from each of those, draw branches for Stage 2. Count the paths from left to right. The total number of outcomes = options at stage 1 × options at stage 2. This is the multiplication principle.
Know
- A sample space lists ALL possible outcomes
- Tree diagrams have stages with branches
- Total outcomes = product of choices at each stage
Understand
- Why HT and TH are different outcomes
- Why the multiplication principle works
- When to use a tree diagram vs a grid table
Can Do
- Draw and label a complete tree diagram for a two-stage experiment
- List all outcomes from a tree diagram
- Apply the multiplication principle to count outcomes
Wrong: "Flipping two coins gives 3 outcomes: HH, TT, or one of each." This treats HT and TH as the same outcome.
Right: There are 4 equally likely outcomes: HH, HT, TH, TT. HT (heads first, then tails) is different from TH (tails first, then heads).
Wrong: Listing outcomes at intermediate branches instead of the final tips of the tree.
Right: Read the full path from start to end. Each complete path (left to right) is one outcome: e.g. H → T gives HT.
A systematic list ensures no outcome is missed. Fix the first stage and vary the second, then move to the next first-stage option. A grid/array is useful for two-stage experiments: rows = stage 1, columns = stage 2.
A spinner has outcomes {A, B} and a die has faces {1, 2, 3}. Grid method: fix A, pair with 1, 2, 3 giving A1, A2, A3. Then fix B, pair with 1, 2, 3 giving B1, B2, B3. Total: 6 outcomes. Verified by multiplication: 2 × 3 = 6.
A tree diagram starts at a point (root), then branches for each possible outcome at Stage 1, then branches again for Stage 2. Each complete path from root to tip is one outcome. Label every branch. List outcomes at the tips.
Flipping a coin then rolling a die (1–3): Stage 1 has 2 branches (H, T). From each, Stage 2 has 3 branches (1, 2, 3). Total leaves = 6 outcomes: {H1, H2, H3, T1, T2, T3}. Multiplication: 2 × 3 = 6. We can find P(H1) = 1/6.
When a multi-stage experiment has independent stages, the total number of outcomes = product of the options at each stage. This works for any number of stages and is much faster than drawing the full tree for large problems.
A restaurant has 3 starters, 4 mains, and 2 desserts. Total meals = 3 × 4 × 2 = 24 meals. Drawing the full tree would have 24 leaf nodes — multiplication is much faster. The key is that each stage is independent (your starter choice doesn't limit your main choice).
Watch Me Solve It · 3 examples
-
1Draw Stage 1 branchesFrom Start: H branch and T branchTwo outcomes at stage 1: heads or tails.
-
2Draw Stage 2 branches and list outcomesFrom H: HH, HT From T: TH, TT Total: 4 outcomes
-
3Find P(at least one tail)At least one tail: {HT, TH, TT} = 3 outcomes. P = 3/4Or use complement: P(no tails) = P(HH) = 1/4. So P(at least one tail) = 1 − 1/4 = 3/4.
-
1Identify options at each stageStage 1 (die): 6 options Stage 2 (coin): 2 optionsThese stages are independent — the die result doesn't affect the coin.
-
2Apply multiplication principleTotal = 6 × 2 = 12 outcomes
-
3Verify by listing a few{1H, 1T, 2H, 2T, 3H, 3T, 4H, 4T, 5H, 5T, 6H, 6T} = 12 outcomes ✓12 outcomes listed, matches the multiplication.
-
1Identify the two stagesStage 1: shirts = 3 options Stage 2: pants = 4 optionsChoosing a shirt does not limit which pants you can choose.
-
2Apply multiplication principleTotal = 3 × 4 = 12 outfits
-
3List some to verifyRed-black, Red-grey, Red-navy, Red-beige (4 outfits for red shirt alone), × 3 shirts = 12Each shirt pairs with 4 pants. 3 shirts × 4 = 12. Confirmed!
Sample Space
- All possible outcomes listed
- Must be complete and systematic
- Order matters in multi-stage
Tree Diagrams
- Branch for each option at each stage
- Outcomes listed at leaf tips
- Read complete paths left → right
Multiplication Principle
- Total = stage1 × stage2 × ...
- Stages must be independent
- Faster than listing for large problems
Grid Method
- Rows = stage 1 outcomes
- Columns = stage 2 outcomes
- Each cell = one combined outcome
How are you completing this lesson?
Brain Trainer · 4 problems
Four drill problems. Work each, then reveal the answer.
-
1 Three coins are flipped at once. How many outcomes are in the sample space?
2 × 2 × 2 = 8. Sample space: {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT}.8 outcomes -
2 Draw a tree diagram for choosing from {A, B} then {1, 2, 3}. List all 6 outcomes.
From A: A1, A2, A3. From B: B1, B2, B3. Total = 6 = 2 × 3.{A1, A2, A3, B1, B2, B3} -
3 What is P(getting A3) from the {A,B} × {1,2,3} experiment?
1 favourable outcome (A3) out of 6 total equally likely outcomes.P(A3) = 1/6 -
4 A school canteen has 3 choices of main and 2 choices of dessert. How many different lunch combinations are possible?
3 mains × 2 desserts = 6 combinations.3 × 2 = 6 lunch combinations
Quick Check · 5 questions
Show Your Working · 3 questions
Q6. A spinner with outcomes {Red, Blue, Green} is spun and a fair coin is tossed. (a) Draw a tree diagram. (b) List all outcomes. (c) Find P(Blue, Tails).
Q7. A PIN code uses 2 digits, each chosen from {1, 2, 3, 4, 5} and digits can repeat. How many PIN codes are possible? Show your reasoning.
Q8. A coin is flipped and a die (1–6) is rolled. (a) How many outcomes? (b) List all outcomes where the result is (heads, even number). (c) What is the probability of this event? (d) Why can't you simply add the number of coins and die faces?
Quick Check
1. B — 4 outcomes: HH, HT, TH, TT. HT ≠ TH.
2. C — 4 × 3 = 12 outfits.
3. D — At the tips of the final branches.
4. A — 3 × 2 × 4 = 24.
5. B — 2 × 2 × 2 = 8 outcomes.
Show Your Working Model Answers
Q6 (3 marks): (a) Tree: from Start, three branches R/B/G. From each, two branches H/T. (b) 6 outcomes: {RH, RT, BH, BT, GH, GT} [1]. Total = 3 × 2 = 6 [1]. (c) P(Blue, Tails) = P(BT) = 1/6 [1].
Q7 (2 marks): Stage 1: 5 options. Stage 2: 5 options (can repeat) [1]. Total = 5 × 5 = 25 PIN codes [1].
Q8 (4 marks): (a) 2 × 6 = 12 outcomes [1]. (b) {H2, H4, H6} — 3 outcomes [1]. (c) P = 3/12 = 1/4 [1]. (d) Adding gives 2+6=8 which is wrong. The multiplication principle applies because each coin outcome pairs with each die outcome independently. Adding only works if outcomes are mutually exclusive, which they're not here [1].
The Locker Code
A school locker has a 3-digit code where each digit is from 1–4. (a) How many codes are possible if digits can repeat? (b) How many if no digit can repeat? (c) What fraction of all codes contain at least one "4"? (d) A student guesses randomly — what is P(guessing correctly)?
Reveal solution
(a) 4 × 4 × 4 = 64 codes. (b) 4 × 3 × 2 = 24 codes (no repeats). (c) Codes with NO 4: 3 × 3 × 3 = 27. Codes with at least one 4 = 64 − 27 = 37. Fraction = 37/64. (d) P(correct guess) = 1/64 ≈ 0.016.
Sample space
ALL possible outcomes — must be complete
HT ≠ TH
Order matters — they're different outcomes
Tree diagram
Branch at each stage, outcomes at tips
Multiplication
Total = stage1 × stage2 × ...
Grid method
Rows × columns = all combinations
Verify
Count leaves = multiplication result
Interactive: Tree Diagram Builder
Build your own tree diagrams by selecting options at each stage. See how the sample space grows with each additional stage.
Your Badges
0 of 6Mark lesson as complete
Tick when you've finished Learn, Practice and the Stretch. Earns +85 XP and +25 coins.