Print or save as PDF — or build a custom worksheet from any module's questions.
You flip a coin twice. Draw a branching diagram to show all possible outcomes. How many branches do you have in total at the end?
A branching diagram where each stage splits into outcomes. Write the probability on each branch, then multiply along branches to find compound probabilities.
Do not add probabilities along a branch — you multiply them. Adding is for combining separate paths to the same outcome (e.g., "at least one head" can happen via HT, TH, or HH — you multiply along each path, then add the path results together).
Each branch is labelled with its probability. To find the probability of a complete path (sequence of outcomes), multiply the probabilities of each branch along that path.
Two fair coin flips:
Verification: all endpoint probabilities must sum to 1: $\frac{1}{4} + \frac{1}{4} + \frac{1}{4} + \frac{1}{4} = 1$ ✓
$P(\text{at least one head}) = P(HH) + P(HT) + P(TH) = \frac{3}{4}$
A bag has 3 red (R) and 2 blue (B) marbles. Two marbles are drawn with replacement (marble is returned before the second draw).
Branch probabilities: $P(R) = \frac{3}{5}$, $P(B) = \frac{2}{5}$ at every stage.
Check: $\dfrac{9+6+6+4}{25} = \dfrac{25}{25} = 1$ ✓
$P(\text{one of each colour}) = P(RB) + P(BR) = \dfrac{6}{25} + \dfrac{6}{25} = \dfrac{12}{25}$
The same bag: 3 red, 2 blue. Two marbles drawn without replacement. After the first draw, there are only 4 marbles left.
From the first draw: $P(R_1) = \frac{3}{5}$, $P(B_1) = \frac{2}{5}$
Second draw branches — depend on first result:
Outcomes:
Check: $\dfrac{3+3+3+1}{10} = \dfrac{10}{10} = 1$ ✓
Tree diagram rules:
Without replacement: the denominator decreases by 1 after each draw, and the numerator changes based on what was drawn.
Two fair coins are flipped. Using a tree diagram, what is $P(HH)$?
What probability is written on each branch of a tree diagram?
Two fair coins are flipped. What is $P(\text{at least one head})$?
In a without-replacement experiment, how do the second-stage branch probabilities compare to the first?
The probabilities at all endpoints of a tree diagram must sum to:
Q6. A coin is flipped three times. Draw a tree diagram (describe or sketch it). Find $P(\text{exactly 2 heads})$.
Q7. A bag has 4 red and 1 blue marble. Two marbles are drawn with replacement. Draw a tree diagram and find: (a) $P(\text{both red})$, (b) $P(\text{one of each colour})$.
Q8. A bag has 3 yellow and 2 green marbles. Two marbles are drawn without replacement. Find: (a) $P(\text{both yellow})$, (b) $P(\text{at least one green})$.
8 endpoints: HHH, HHT, HTH, HTT, THH, THT, TTH, TTT each with probability $\frac{1}{8}$.
Exactly 2 heads: HHT, HTH, THH — 3 paths.
$P(\text{exactly 2 heads}) = 3 \times \frac{1}{8} = \dfrac{3}{8}$
Branch probabilities: $P(R) = \frac{4}{5}$, $P(B) = \frac{1}{5}$ at every stage (with replacement).
(a) $P(RR) = \dfrac{4}{5} \times \dfrac{4}{5} = \dfrac{16}{25}$
(b) $P(\text{one of each}) = P(RB) + P(BR) = \dfrac{4}{25} + \dfrac{4}{25} = \dfrac{8}{25}$
Without replacement: first draw from 5, second from 4.
(a) $P(YY) = \dfrac{3}{5} \times \dfrac{2}{4} = \dfrac{6}{20} = \dfrac{3}{10}$
(b) $P(\text{at least one green}) = 1 - P(YY) = 1 - \dfrac{3}{10} = \dfrac{7}{10}$
A biased coin has $P(H) = 0.6$ and $P(T) = 0.4$. The coin is flipped three times. (a) Draw the tree diagram showing all 8 endpoints and their probabilities. (b) Find $P(\text{exactly 2 heads})$. (c) Compare to a fair coin: which gives a higher $P(\text{exactly 2 heads})$? Show your calculation for both.