Learn in your language
Skip to content
A Level · Cambridge (CIE) · 9709

Read and sketch displacement time graphs using their gradients

Connect position, instantaneous velocity, rest and reversal to the height and tangent gradient of a displacement–time graph.

Mechanics · Straight-line kinematics · 4.2
Exam scope and assessment notes

Mechanics (Paper 4, AS & A Level) · Mathematics 9709, 2026–2027, section 4.2. Motion is restricted to one dimension. Choose a positive direction; distance and speed are scalars, while displacement, velocity and acceleration carry a direction. Deceleration means decreasing speed, not necessarily negative acceleration. Calculus uses Paper 1 techniques only. Constant-acceleration formulae require constant acceleration on the stated interval; use a new interval and its initial velocity when conditions change. Where vertical motion occurs, use the supplied g = 10 m s⁻² and the stated no-air-resistance model. Written practice is self-checked; human subject-teacher review remains pending.

Before you begin

  • Calculate the gradient of a straight line.
  • Differentiate a quadratic using Paper 1 methods.

Work on paper. Try each question before revealing help, and explain why your method works.

Quick readiness check

What velocity does a straight displacement graph from (0 s, 2 m) to (3 s, 11 m) show?

What you will learn

  • Interpret a displacement–time graph’s gradients and horizontal sections.
  • Sketch a curve with correct endpoints, turning points and motion intervals.
For s = 12t − t² on 0 ≤ t ≤ 8 s, the displacement curve rises from (0, 0) to its maximum (6, 36), then falls to (8, 32). Its gradient is v = 12 − 2t, so the particle is momentarily at rest and reverses at 6 s. The final displacement stays positive even though the final velocity is −4 m s⁻¹. The vertical coordinate is displacement, and the horizontal coordinate is time; their units and scales differ.Height is displacementGradient is velocitys (m)t (s)02468Maximum (6, 36)v < 0v > 0One-dimensional motion · labelled units
For s = 12t − t² on 0 ≤ t ≤ 8 s, the displacement curve rises from (0, 0) to its maximum (6, 36), then falls to (8, 32). Its gradient is v = 12 − 2t, so the particle is momentarily at rest and reverses at 6 s. The final displacement stays positive even though the final velocity is −4 m s⁻¹. The vertical coordinate is displacement, and the horizontal coordinate is time; their units and scales differ.

The height gives position and the gradient gives velocity

On a displacement–time graph, the vertical coordinate is directed displacement from the chosen reference, not distance travelled. The tangent gradient at a time gives instantaneous velocity. An upward slope means positive velocity, a downward slope means negative velocity, and a horizontal section means rest throughout that interval. The height of the graph alone does not establish which way the particle is moving.

For s = 12t − t² on 0 ≤ t ≤ 8, the velocity is ds/dt = 12 − 2t. The curve starts at (0, 0), has a horizontal tangent at (6, 36) and ends at (8, 32). It rises before 6 s and falls after 6 s, even though s stays positive. The tangent’s slope becomes progressively smaller because acceleration is −2 m s⁻². Mark these features before joining the points with a smooth concave-down curve.

A chord describes an average, while a tangent describes an instant

Between two points, the chord gradient Δs/Δt is average velocity. For the example’s whole 8 s interval it is 32/8 = 4 m s⁻¹, whereas instantaneous velocity at 8 s is −4 m s⁻¹. A chord need not share the end tangent’s slope. At the maximum, v is momentarily zero, but a is non-zero, so the particle reverses rather than remaining at rest.

For a piecewise straight graph, calculate each segment’s slope separately. A horizontal segment has zero velocity despite a possibly non-zero position. Add absolute changes in s to calculate distance across a reversal; the final graph height gives only net displacement when the initial reference is zero. At a sharp corner the idealised graph does not give a single tangent velocity, so do not assign a unique instantaneous velocity there without a smoother model.

Pause and explain

For s = 12t − t², what happens at t = 6 s?

Put the idea to work

Worked example

Sketch s = 12t − t² m for 0 ≤ t ≤ 8 s and identify its reversal and final velocity.

Show the worked solution
  1. Differentiate to obtain v = 12 − 2t and solve v = 0, giving t = 6 s.
  2. Plot (0, 0), the maximum (6, 36), and endpoint (8, 32), joining with a concave-down curve.
  3. The slope changes from positive to negative at 6 s; final velocity is 12 − 16 = −4 m s⁻¹.

Answer Maximum s = 36 m at 6 s; reversal at 6 s; final velocity −4 m s⁻¹.

Try a topic test

Choose Easy, Normal or Difficult. Save your answers and open worked review after finishing.

Test this topic →

From guided practice to a new situation

Write your answer and reasoning first. Use a hint only if you are stuck. The model solution is for self-checking; your written work is not automatically marked.

1 · Guided

Sketch s = 5 + 3t m on 0 ≤ t ≤ 4 s, and find velocity, displacement and distance over that interval.

Give me a hint

Its initial height is 5 m and its gradient is constant.

Compare my reasoning
  1. Plot (0, 5) and (4, 17) and join with a straight rising line.
  2. Velocity is the gradient +3 m s⁻¹, with no reversal.
  3. Displacement is 17 − 5 = 12 m, and distance is also 12 m.

Straight line from (0, 5) to (4, 17); velocity +3 m s⁻¹; displacement and distance 12 m.

Look for these in your work

  • Retain the non-zero initial position in the sketch.
  • Use the constant gradient and distinguish position from journey length.
2 · Independent

For s = 2 + 8t − t² m on 0 ≤ t ≤ 6 s, locate the turning point and calculate net displacement and total distance.

Give me a hint

Solve ds/dt = 0 and split the journey at that time.

Compare my reasoning
  1. Velocity is 8 − 2t, so the turning time is 4 s and position there is 18 m.
  2. The initial position is 2 m and final position is 14 m, giving displacement +12 m.
  3. Distance is (18 − 2) + (18 − 14) = 20 m.

Maximum at (4 s, 18 m); displacement +12 m; distance 20 m.

Look for these in your work

  • Check the derivative changes sign at the turning time.
  • Add both path lengths rather than using the net graph-height change.
3 · Transfer

A displacement graph consists of straight segments through (0, 2), (3, 11), (5, 11) and (7, 3), with seconds and metres as axes. Give velocities on each open interval, whole-journey displacement, distance and average velocity.

Give me a hint

Read each segment’s slope, including the horizontal middle segment.

Compare my reasoning
  1. Slopes are +3 m s⁻¹ for 0 < t < 3, zero for 3 < t < 5, and −4 m s⁻¹ for 5 < t < 7.
  2. Displacement is 3 − 2 = +1 m and distance is 9 + 0 + 8 = 17 m.
  3. Average velocity is +1/7 m s⁻¹; corner instants do not have one defined tangent velocity in this idealised graph.

Segment velocities +3, 0 and −4 m s⁻¹; displacement +1 m; distance 17 m; average velocity +1/7 m s⁻¹.

Look for these in your work

  • Interpret the horizontal interval as rest at a non-zero position.
  • State intervals and avoid assigning one tangent at a sharp corner.

Common mistakes

  • A positive graph height does not imply positive velocity.
  • Use a tangent for instantaneous velocity and a chord for average velocity.
  • A momentary horizontal tangent is not an interval of rest.
Recall without your notes

What can you explain now?

Can a displacement–time graph be above the time axis while the particle moves in the negative direction?

Compare with the explanation

Yes, if its gradient is negative.

The height describes position, while motion direction is determined by the gradient.

After trying it yourself, choose your next review. This is your self-assessment.

Your review choice appears on Today. Sign in to sync it across devices.

Make it stick

Read displacement from height and velocity from gradient; locate rest and reversals before calculating total distance.

If you needed the solution, close it and solve the problem again from a blank page. A correct answer is stronger when you can explain the reason for each step.

Keep learning Mathematics

Course scope and assessment

312 sequenced lessons provide 936 guided, independent and application problems covering the 160 objectives in sections 1.1–1.8, 2.1–2.6, 3.1–3.9, 4.1–4.5, 5.1–5.5 and 6.1–6.5. The map lists all 38 sections across six alternative components; all eight Pure Mathematics 1 sections and all six Pure Mathematics 2 sections, from Paper 2 Algebra through Numerical solution of equations, currently have full teaching sequences. Paper 3 Algebra, section 3.1, links the six shared foundation lessons plus six lessons on partial fractions and rational binomial expansions; Paper 3 logarithms, trigonometry and numerical equations use the shared lessons, with the Paper 1 graph foundation linked into trigonometry. Paper 3 differentiation combines the shared methods with its inverse-tangent derivative lesson. Paper 3 Integration links four shared standard and identity lessons plus seven advanced lessons, covering all six section 3.5 requirements. Eight Vectors lessons cover all six section 3.7 requirements, with 2D and 3D line and solid applications. Nine Differential equations lessons cover all four section 3.8 requirements, including Paper 3 integration techniques, initial conditions, equilibrium solutions and conditional model interpretations. Eleven Complex numbers lessons cover all eight section 3.9 requirements, with seven Argand diagrams and explicit argument and boundary checks. All nine Pure Mathematics 3 sections now have teaching linked to every mapped requirement. Nine Forces and equilibrium lessons cover all seven section 4.1 requirements, with six force diagrams, signed incline-friction intervals, reaction-dependent pull and push limits and separate-body third-law checks. Nine Kinematics lessons cover the four official section 4.2 requirements, with the graph requirement mapped to three relationships. Six motion diagrams support directed quantities, graph slopes and signed areas, Paper 1 time-calculus methods, reversal distances, constant-acceleration stages and shared-clock particle meetings. Six Momentum lessons cover both section 4.3 requirements, including signed system totals, conservation assumptions, outgoing velocities, coalescence, unknown masses and successive impacts. Four diagrams show system momentum through the stipulated events, and supplied kinetic-energy checks distinguish conservation of momentum from changes in kinetic energy. Twelve Newton’s laws lessons cover all four section 4.4 requirements, with vertical support and release stages, rough horizontal and incline motion, inferred parameters, hanging and surface pulley systems, rigid tow-bar thrust and slack-string transitions. Seven force diagrams support the separate-particle balances. Nine Energy, work and power lessons cover all five section 4.5 requirements, with angle-dependent work, kinetic and reference potential energy, signed net-work balances, smooth curved slides, rough and driven slopes, ideal connected-system energy and instantaneous power on hills. Five diagrams distinguish the energy inputs, losses and valid positive-speed force model. All five Mechanics sections now have teaching and staged practice linked to their mapped requirements. Thirteen Representation of data lessons cover all five section 5.1 requirements, including choice and limitations of displays, ordered and back-to-back stems, raw summaries and box plots, unequal-width density histograms, cumulative-frequency interpolation, descriptive moment calculations, grouped estimates, coding, combining two datasets and correcting totals. Six accessible diagrams retain repeated observations and distinguish numerical spread, frequency area and estimated readings. Ten Permutations and combinations lessons cover both official section 5.2 requirements, with selection and ordered roles, repeated objects, adjacency blocks, non-adjacency gaps, leading-zero cases, labelled multi-row seating and mixed restrictions. Six accessible diagrams show outcome trees, ordered versus unordered choices, repeated copies, blocks, gaps and distinct row seats. Eleven Probability lessons cover all four section 5.3 requirements, with equiprobable elementary outcomes, selection-based probabilities, complements and disjoint regions, independence tests, restricted sample spaces, two-way tables, replacement and removal trees, reversed conditions and unknown parameters. Seven accessible diagrams show dice outcomes, random subsets, event regions, a conditioned grid, a count table and two probability trees. Twelve Discrete random variables lessons cover all three official section 5.4 requirements, with complete probability tables, moment and parameter checks, binomial assumptions, exact probabilities and moments, geometric first-success probabilities, tails, expectation and integer reliability thresholds. Six accessible diagrams distinguish outcome grouping, weighted moments, fixed trials, discrete probability bars, waiting conventions and integer tail deadlines. Twelve Normal distribution lessons cover all three official section 5.5 requirements, with continuous-area interpretation, MF19 cumulative tables, full standardisation, tail and interval regions, conditional probabilities, percentiles, one- and two-parameter inference, binomial suitability, continuity corrections and approximate integer thresholds. Seven accessible diagrams show model areas, table reading, aligned scales, intervals, quantiles, matched binomial and normal shapes and whole integer cells. All five Statistics 1 sections now have teaching and staged practice linked to their mapped requirements. Fourteen Poisson distribution lessons cover all five official section 6.1 requirements, with homogeneous event-count assumptions, exposure scaling, exact masses and tails, conditional count events, moments, parameter inference, probability duration targets, disjoint and overlapping windows, rare-count binomial approximations, matched normal approximations and continuity corrections. Nine accessible diagrams show event exposures, unit conversions, discrete bars, complete tail complements, population moments, shared windows, approximate count models and integer cells. Exact checks distinguish approximate and exact close-target decisions. Fourteen Linear combinations lessons cover the six listed results in official section 6.2, with affine moments, signed scales and constant cases, expectation without independence, independent squared variance contributions, fixed and random fees, independent copies versus reused values, affine normal events, independent normal sums and differences, weighted and conditional areas, coefficient inference, exact independent Poisson sums and overlapping exposure limits. Nine accessible diagrams distinguish scale changes, variance contributions, component costs, copy mechanisms, aligned normal scales, summed areas, Poisson count pairs and unsupported distribution claims. Fourteen Continuous random variables lessons cover both official section 6.3 requirements, with density validity and units, support-aware intervals, complements and conditional regions, first and second moments, percentiles by direct density areas, symmetry checks, parameter inference, infinite-support power and exponential integrals, divergent-moment limits and combined applications. Nine accessible diagrams distinguish density height from probability, normalisation, negative-density failures, central and conditional areas, mean versus median, percentile locations and partial infinite tails. Explicit cumulative distribution function knowledge is not required. Eighteen Sampling and estimation lessons cover all eight official section 6.4 requirements, with population and frame definitions, random-number selection, sampling-quality limits, independent sample-mean moments, normal means, CLT conditions, SE scaling, raw, summarised and coded unbiased estimates, known-variance and large-sample mean intervals, repeated-sampling interpretation, precision planning, proportion intervals, sparse-outcome limits and contextual applications. Ten accessible diagrams distinguish selection frames, number rejection, repeated sample means, population versus mean density, CLT models, variance divisors, interval targets, illustrative coverage, integer size checks and proportion margins. Eighteen Hypothesis tests lessons cover all five official section 6.5 requirements, with pre-specified alternatives, inclusive count tails, explicit equal-tail conventions, integer critical regions and actual significance, exposure-aware Poisson tests, continuity-corrected count approximations, normal and large-sample mean tests, confidence-interval connections, error classifications, fixed-region binomial, Poisson and normal error probabilities and sample-size power comparisons. Nine accessible diagrams show the testing procedure, exact count regions, unequal Poisson tails, discrete significance jumps, corrected count boundaries, matching mean intervals and alternative error distributions. All shared lessons are counted once in the course total. All 38 sections now link teaching and practice. Eight earlier overview lessons remain available, but do not count as full section coverage. This is a content-availability measure, not full programme completion or exam readiness. Written practice is self-checked, not officially marked. Check the 2028–2030 syllabus separately if sitting an examination from 2028; this teaching map uses 2026–2027 requirements.

StudyForA · Learn with understanding

Original teaching content and links to official sources. Check your exam year and qualification before using a resource.