Arrays and Two-Step Experiments with Tables and Tree Diagrams
A two-step experiment, such as rolling two dice or spinning a spinner and tossing a coin, has outcomes that can be listed in an array (a table) or a tree diagram. In NSW Year 10 Advanced maths these diagrams are used to find probabilities for multistage experiments, with and without replacement, and to predict how often an outcome is expected (NESA outcome MA5‑PRO‑C‑01).
You will use arrays for the sum, product, difference and larger number from two dice or spinners, and tree diagrams for draws from a bag with and without replacement. You will find expected counts, decide whether a dice game is fair, and solve problems about trains, a netball shooter, a raffle and missed flights. Harder questions find an unknown number of counters and analyse a game that keeps going until someone wins. It is part of Year 10 Advanced Probability.
Every question with a fully worked solution.
- Arrays and Two-Step Experiments with Tables and Tree Diagrams - Video - Two Step Experiments Watch
Theory
A two-step experiment, such as rolling two dice or drawing two counters, can be shown in an array (a grid of every outcome) or a tree diagram. This Year 10 Advanced maths page covers arrays of sums, products and differences, trees with and without replacement, "at least one", three-stage trees, expected numbers and fair games.
A multistage experiment is done in steps, such as rolling a die then spinning a spinner. If step one has \(m\) outcomes and step two has \(n\), there are \(m\times n\) outcomes altogether.
An array (or table of outcomes) shows the first step down the side and the second across the top. Each cell is one outcome, and the cells are equally likely when each step's outcomes are. The cells can hold pairs, sums, products, differences or the larger number.
A tree diagram shows each step as a set of branches labelled with probabilities. The branches from any point add to \(1\). Trees are best when the outcomes are not equally likely, or when there are three or more stages.
With replacement, the item is put back, so the second step has the same probabilities as the first. Without replacement, the item is kept out, so the second step has one fewer item and its probabilities change.
| Two dice: the sum | \(2\) | \(3\) | \(4\) | \(5\) | \(6\) | \(7\) | \(8\) | \(9\) | \(10\) | \(11\) | \(12\) |
|---|---|---|---|---|---|---|---|---|---|---|---|
| number of ways | \(1\) | \(2\) | \(3\) | \(4\) | \(5\) | \(6\) | \(5\) | \(4\) | \(3\) | \(2\) | \(1\) |
How to solve a two-step problem
- Decide: array or tree? With or without replacement?
- Draw it: fill the array, or label every branch. Check the branches at each point add to \(1\).
- Mark the outcomes or paths in the event. "One of each" usually means two paths, such as \(RW\) and \(WR\).
- Calculate: count cells over the total, or multiply along each path and add the paths.
- Use the complement for "at least one".
Other question types
- Different spinner sections: a spinner with a red half, a blue quarter and a green quarter has unequal branches \(\dfrac{1}{2}, \dfrac{1}{4}, \dfrac{1}{4}\). Use a tree, not a list of colours.
- Stop when successful: "succeeds on the third try" is fail, fail, succeed. "Needs a third try" is just fail, fail.
- Working backwards: with replacement, \(P(\text{both red})=p^2\), so \(p=\sqrt{P}\). Without replacement, write the path with a pronumeral and solve the equation, which may be quadratic.
- Raffles and prizes: drawing winning tickets is without replacement; the second draw has one fewer ticket.
- Repeated rounds: if a tie means the round is replayed, only the rounds with a winner matter, so compare the players' chances within a single round.
(i) \(P(\text{product is a multiple of } 4)\)
(ii) \(P(\text{product}\gt 12)\)
The array (Diagrams tab) has \(6\times 4=24\) equally likely cells.
(i) Multiples of \(4\): all \(6\) in the spinner-\(4\) column, \(2\times 2\), \(4\times 2\), \(6\times 2\) in the spinner-\(2\) column, and \(4\times 1\), \(4\times 3\). That is \(6+3+1+1=11\).
| \(P\) | \(=\) | \(\boldsymbol{\dfrac{11}{24}}\) |
(ii) Products over \(12\): \(15, 18\) (spinner \(3\)) and \(16, 20, 24\) (spinner \(4\)). \(12\) itself does not count.
| \(P\) | \(=\) | \(\boldsymbol{\dfrac{5}{24}}\) |
(i) \(P(\text{one of each colour})\)
(ii) \(P(\text{at least one white})\)
With replacement the bag is the same for both draws: \(P(R)=\dfrac{5}{8}\), \(P(W)=\dfrac{3}{8}\) each time.
(i) One of each is \(RW\) or \(WR\). Multiply along each path, then add.
| \(P\) | \(=\) | \(\dfrac{5}{8}\times\dfrac{3}{8}+\dfrac{3}{8}\times\dfrac{5}{8}\) |
| \(\) | \(=\) | \(\dfrac{30}{64}=\boldsymbol{\dfrac{15}{32}}\) |
(ii) "At least one white" is every path except \(RR\). Use the complement.
| \(P\) | \(=\) | \(1-\dfrac{5}{8}\times\dfrac{5}{8}=1-\dfrac{25}{64}=\boldsymbol{\dfrac{39}{64}}\) |
(i) \(P(\text{both the same colour})\)
(ii) \(P(\text{at least one white})\)
After the first draw, \(7\) counters are left and there is one fewer of the colour drawn.
| \(P(RR)\) | \(=\) | \(\dfrac{5}{8}\times\dfrac{4}{7}=\dfrac{20}{56}\) |
| \(P(WW)\) | \(=\) | \(\dfrac{3}{8}\times\dfrac{2}{7}=\dfrac{6}{56}\) |
(i) \(P(\text{same})=\dfrac{20}{56}+\dfrac{6}{56}=\dfrac{26}{56}=\boldsymbol{\dfrac{13}{28}}\).
(ii) \(P(\text{at least one white})=1-P(RR)=1-\dfrac{20}{56}=\boldsymbol{\dfrac{9}{14}}\).
(i) \(P(\text{late on exactly one day})\)
(ii) \(P(\text{late on at least one day})\)
Let \(L\) be late (\(0.2\)) and \(L'\) on time (\(0.8\)). A three-stage tree has \(2^3=8\) paths.
(i) Exactly one late: \(LL'L'\), \(L'LL'\) or \(L'L'L\). Each path is \(0.2\times 0.8\times 0.8=0.128\).
| \(P\) | \(=\) | \(3\times 0.128=\boldsymbol{0.384}\) |
(ii) The only path with no late days is \(L'L'L'\).
| \(P\) | \(=\) | \(1-0.8^3=1-0.512=\boldsymbol{0.488}\) |
Common pitfalls
Frequently asked questions
When should I use an array instead of a tree diagram?
Use an array when there are two steps with equally likely outcomes, such as two dice, especially if you combine the numbers by adding, multiplying or subtracting. Use a tree for unequal probabilities, without replacement, or three or more steps.
How do you calculate probabilities from a tree diagram?
Multiply the probabilities along each branch of a path to get the probability of that path. If the event includes several paths, add their probabilities.
What is the difference between with and without replacement?
With replacement the item goes back, so every draw has the same probabilities. Without replacement it stays out, so the next draw has one fewer item and the probabilities change.
How do you find the probability of at least one?
Find the probability of none, then subtract it from \(1\). For example, \(P(\text{at least one six in two rolls})=1-\dfrac{5}{6}\times\dfrac{5}{6}=\dfrac{11}{36}\).
How many outcomes are there when two dice are rolled?
There are \(6\times 6=36\) equally likely ordered outcomes. The most likely sum is \(7\), which happens in \(6\) of them.