High School — Ontario Grade 12

MDM4U Data Management Practice Exam — Free

Generate a realistic AI practice exam with worked solutions

Generate Your Free Practice Exam

MDM4U (Mathematics of Data Management) is Ontario's Grade 12 university-preparation course on counting, probability, probability distributions and statistics. Exams reward recognizing which counting method or distribution a question needs — permutations or combinations, binomial or hypergeometric — and then carrying the calculation through cleanly. The final evaluation counts for 30% of the course mark, and many schools pair the exam with a culminating data investigation.

Crameleon generates your practice exam from your own course materials — lecture notes, syllabi, past exams, or any combination. Upload what you have and get a fully formatted exam with the same structure as your professor's actual tests: multiple choice, short answer, and worked problems, all with step-by-step solutions (first 2 free; all with Premium).

Unlike generic question banks, every Crameleon exam reflects the specific framing, terminology, and difficulty level of your course. You'll practise answering questions that look and feel like the real thing — which is exactly what the research on retrieval practice says you should be doing. Students who test themselves with practice exams consistently outperform students who re-read notes, regardless of study time. The generation takes under 2 minutes and your first exam is completely free.

Topics typically tested

  • Permutations & combinations
  • Probability
  • Binomial & hypergeometric distributions
  • Normal distribution & z-scores
  • One-variable statistics
  • Correlation & linear regression

Sample MDM4U Data Management exam questions

Three original questions in the style of a real MDM4U Data Management exam, each with a worked solution. Your own practice exam can be built from your course's notes and syllabus.

Question 1Multiple choicePermutations & combinations

A student council subcommittee of 4 members is to be chosen from 7 Grade 12 students and 5 Grade 11 students. How many different subcommittees contain at least one Grade 11 student?

  1. A.

    495

  2. B.

    460

  3. C.

    825

  4. D.

    11 040

Worked solution
Answer:B

The phrase "at least one" is the signal to use the indirect method: count every possible subcommittee, then subtract the ones that break the condition. The only way to break "at least one Grade 11 student" is to have no Grade 11 students at all, so that is the single case to remove.

Order does not matter on a committee (the same four people form the same subcommittee however they are listed), so use combinations, not permutations. From all 12 students (7 from Grade 12 plus 5 from Grade 11),

C(12,4)=(124)=12!4! 8!=12⋅11⋅10⋅94⋅3⋅2⋅1=495.C(12, 4) = \binom{12}{4} = \frac{12!}{4!\,8!} = \frac{12 \cdot 11 \cdot 10 \cdot 9}{4 \cdot 3 \cdot 2 \cdot 1} = 495.

A subcommittee with no Grade 11 students is chosen entirely from the 7 Grade 12 students:

C(7,4)=(74)=35.C(7, 4) = \binom{7}{4} = 35.

Subtracting gives the number with at least one Grade 11 student:

495−35=460.495 - 35 = 460.

Check with the direct method, adding the cases of exactly 1, 2, 3 or 4 Grade 11 students (the rest of each subcommittee comes from Grade 12):

(51)(73)+(52)(72)+(53)(71)+(54)(70)=175+210+70+5=460.\binom{5}{1}\binom{7}{3} + \binom{5}{2}\binom{7}{2} + \binom{5}{3}\binom{7}{1} + \binom{5}{4}\binom{7}{0} = 175 + 210 + 70 + 5 = 460.

Both methods agree.

The classic trap is 825, which comes from "pick one Grade 11 student to guarantee the condition, then any 3 of the remaining 11": C(5,1)×C(11,3)=5×165=825C(5, 1) \times C(11, 3) = 5 \times 165 = 825. This double-counts. A subcommittee containing two Grade 11 students, Ava and Ben, is counted once with Ava as the "guaranteed" member and again with Ben, so every subcommittee with more than one Grade 11 student is counted more than once. The answer 495 is the total with the restriction ignored. The answer 11 040 is P(12,4)−P(7,4)=11 880−840P(12, 4) - P(7, 4) = 11\,880 - 840, which treats the subcommittee as an ordered arrangement; it counts every subcommittee 4!=244! = 24 times, and indeed 11 040÷24=46011\,040 \div 24 = 460.

460 subcommittees (option B).

Question 2Short answerBinomial & hypergeometric distributions

A basketball player makes 70% of her free throws. In one game she takes 6 free throws. Assume the shots are independent.

(a) Find the probability that she makes exactly 4 of the 6 free throws. Give the answer to 4 decimal places.

(b) Find the expected number of free throws she makes in the game.

Worked solution
Answer:

(a) P(X=4)≈0.3241P(X = 4) \approx 0.3241; (b) E(X)=4.2E(X) = 4.2 free throws

Let XX be the number of free throws she makes. Check the binomial conditions: there is a fixed number of trials (n=6n = 6), each shot has only two outcomes (make or miss), the probability of success is the same on every shot (p=0.7p = 0.7, so q=1−p=0.3q = 1 - p = 0.3), and the shots are independent. So XX is a binomial random variable with

P(X=x)=(nx)pxq n−x.P(X = x) = \binom{n}{x} p^{x} q^{\,n - x}.

(a) Substitute n=6n = 6 and x=4x = 4:

P(X=4)=(64)(0.7)4(0.3)2.P(X = 4) = \binom{6}{4}(0.7)^4(0.3)^2.

Evaluate each factor: (64)=15\binom{6}{4} = 15, (0.7)4=0.2401(0.7)^4 = 0.2401 and (0.3)2=0.09(0.3)^2 = 0.09. Then

P(X=4)=15(0.2401)(0.09)=0.324135≈0.3241.P(X = 4) = 15(0.2401)(0.09) = 0.324135 \approx 0.3241.

The factor of 15 is there because "exactly 4 makes" can happen in 15 different orders (MMMMXX, MMMXMX, and so on), and each of those sequences has the same probability (0.7)4(0.3)2≈0.0216(0.7)^4(0.3)^2 \approx 0.0216.

(b) For a binomial distribution the expected value is

E(X)=np=6(0.7)=4.2.E(X) = np = 6(0.7) = 4.2.

On average she makes 4.2 of her 6 free throws, which is why exactly 4 is the single most likely outcome: its probability, 0.3241, is the largest in the distribution, with exactly 5 close behind at 0.3025.

Two common slips: leaving out the (64)\binom{6}{4} gives 0.0216, the probability of one particular sequence rather than of any sequence with 4 makes; and swapping the exponents, 15(0.7)2(0.3)4=0.059515(0.7)^2(0.3)^4 = 0.0595, gives the probability of exactly 2 makes instead of 4. Also read the wording carefully: "exactly 4" is a single term of the distribution, whereas "at least 4" would require adding the probabilities for 4, 5 and 6 makes.

(a) P(X=4)≈0.3241P(X = 4) \approx 0.3241; (b) E(X)=4.2E(X) = 4.2 free throws.

Question 3Worked problemNormal distribution & z-scores

The finishing times of runners in a 10 km charity run are approximately normally distributed with a mean of 52 minutes and a standard deviation of 10 minutes.

(a) What is the probability that a randomly selected runner finished in under 40 minutes? If 1200 runners took part, about how many of them finished in under 40 minutes?

(b) What is the probability that a randomly selected runner finished between 45 minutes and 65 minutes?

(c) The organizers award a medal to the fastest 10% of runners. What is the slowest finishing time that still earns a medal?

Round z-scores to 2 decimal places and give probabilities to 4 decimal places.

Worked solution
Answer:

(a) 0.11510.1151, about 138 runners; (b) 0.66120.6612; (c) about 39.2 minutes

Let XX be a runner's finishing time in minutes, so XX is normal with μ=52\mu = 52 and σ=10\sigma = 10. Every part uses the same two moves: convert a time to a z-score with z=x−μσz = \dfrac{x - \mu}{\sigma}, then read the area to the left of that z-score from the standard normal table. The z-scores below are rounded to 2 decimal places, and the areas are the 4-decimal table values.

(a) For 40 minutes,

z=40−5210=−1.20,P(X<40)=P(Z<−1.20)=0.1151.z = \frac{40 - 52}{10} = -1.20, \qquad P(X < 40) = P(Z < -1.20) = 0.1151.

About 11.5% of runners finished in under 40 minutes. For 1200 runners the expected count is (0.1151)(1200)=138.1(0.1151)(1200) = 138.1, so about 138 runners.

(b) Both endpoints must be converted:

z1=45−5210=−0.70,z2=65−5210=1.30.z_1 = \frac{45 - 52}{10} = -0.70, \qquad z_2 = \frac{65 - 52}{10} = 1.30.

The table gives areas to the left of a z-score, so subtract the smaller area from the larger one:

P(45<X<65)=P(Z<1.30)−P(Z<−0.70)=0.9032−0.2420=0.6612.P(45 < X < 65) = P(Z < 1.30) - P(Z < -0.70) = 0.9032 - 0.2420 = 0.6612.

The trap here is to subtract the z-scores first, getting z=2.00z = 2.00, and look up P(Z<2.00)=0.9772P(Z < 2.00) = 0.9772. Areas can be subtracted; z-scores cannot.

(c) This part works backwards, from an area to a time. The fastest 10% are the runners with the lowest times, so we need the z-score with an area of 0.1000 to its left. Searching the body of the table, the closest entry is 0.1003 at z=−1.28z = -1.28 (the next entry, 0.0985, belongs to z=−1.29z = -1.29), so take z=−1.28z = -1.28. Now solve for xx:

−1.28=x−5210⇒x=52+(−1.28)(10)=52−12.8=39.2.-1.28 = \frac{x - 52}{10} \quad\Rightarrow\quad x = 52 + (-1.28)(10) = 52 - 12.8 = 39.2.

A runner must finish in about 39.2 minutes or less to earn a medal. (Using the more precise z=−1.2816z = -1.2816 gives 39.18 minutes, the same to one decimal place.) The sign is the thing to watch: using z=+1.28z = +1.28 gives 64.8 minutes, which is the cutoff for the slowest 10%, not the fastest. A quick sanity check confirms the answer: part (a) showed that 11.5% of runners finish in under 40 minutes, so the cutoff for the fastest 10% should be slightly below 40 minutes, which it is.

(a) P(X<40)=0.1151P(X < 40) = 0.1151, about 138 runners; (b) P(45<X<65)=0.6612P(45 < X < 65) = 0.6612; (c) about 39.2 minutes.

Used by 3,000+ students across Canadian universities·Step-by-step solutions (first 2 free)·Works for any course

Ready to practice?

Generate Your Free MDM4U Data Management Practice Exam

Your first exam is free — just sign in, no credit card.