Skip to content
Oscar Song Tutoring
All revision checklists

Edexcel A-level Further Maths Decision Mathematics 1 — revision checklist

Edexcel · A-level 9FM0 3D
18 spec points
Your confidence · Self-report

The registered topic-content points, in order. Red, Amber and Green record how sure you feel about each point. They are confidence ratings, not results from answering questions. It saves on this device — come back and pick up where you left off. These are the same ratings as “Your confidence” on the revision notes pages: Red is Unseen, Amber is Shaky and Green is Secure.

Board and spec code confirmed against Edexcel 9FM0 · registry checked 2026-07-17How this checking works

Scope: Tracks the registered Decision Mathematics 1 (paper 3D) content only. Core Pure 1 and 2 and the other seven option papers are not in this list.

Your confidence · Self-report

0% green0/18 rated green

D1-1Algorithms and graph theory

0/4
  • The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-1.1NotesQuestions

  • Bin packing, bubble sort and quick sort.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-1.2NotesQuestions

  • Use of the order of the nodes to determine whether a graph is Eulerian, semi-Eulerian or neither.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-1.3NotesQuestions

  • The planarity algorithm for planar graphs.
    Year 2
    Year 2: this is content the exam board adds beyond the AS subject content, for the full A-level.

    D1-1.4NotesQuestions

D1-2Algorithms on graphs

0/2
  • The minimum spanning tree (minimum connector) problem. Prim's and Kruskal's algorithm.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-2.1NotesQuestions

  • Dijkstra's and Floyd's algorithm for finding the shortest path.
    Years 1 and 2
    Years 1 and 2: this holds AS subject content and content the exam board adds beyond it for the full A-level.

    D1-2.2NotesQuestions

D1-3Algorithms on graphs II

0/2
  • Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex (the Route Inspection Algorithm).
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-3.1NotesQuestions

  • The practical and classical Travelling Salesman problems. Determination of upper and lower bounds using minimum spanning tree methods. The nearest neighbour algorithm.
    Year 2
    Year 2: this is content the exam board adds beyond the AS subject content, for the full A-level.

    D1-3.2NotesQuestions

D1-4Critical path analysis

0/6
  • Modelling of a project by an activity network, from a precedence table.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-4.1NotesQuestions

  • Completion of the precedence table for a given activity network.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-4.2NotesQuestions

  • Algorithm for finding the critical path. Earliest and latest event times. Earliest and latest start and finish times for activities. Identification of critical activities and critical path(s).
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-4.3NotesQuestions

  • Calculation of the total float of an activity. Construction of Gantt (cascade) charts.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-4.4NotesQuestions

  • Construct resource histograms (including resource levelling) based on the number of workers required to complete each activity.
    Year 2
    Year 2: this is content the exam board adds beyond the AS subject content, for the full A-level.

    D1-4.5NotesQuestions

  • Scheduling the activities using the least number of workers required to complete the project.
    Year 2
    Year 2: this is content the exam board adds beyond the AS subject content, for the full A-level.

    D1-4.6NotesQuestions

D1-5Linear programming

0/4
  • Formulation of problems as linear programs including the meaning and use of slack, surplus and artificial variables.
    Years 1 and 2
    Years 1 and 2: this holds AS subject content and content the exam board adds beyond it for the full A-level.

    D1-5.1NotesQuestions

  • Graphical solution of two variable problems using objective line and vertex methods including cases where integer solutions are required.
    Year 1
    Year 1: this is the AS subject content the exam board publishes, which is what most schools teach in Year 12.

    D1-5.2NotesQuestions

  • The Simplex algorithm and tableau for maximising and minimising problems with ≤ constraints.
    Year 2
    Year 2: this is content the exam board adds beyond the AS subject content, for the full A-level.

    D1-5.3NotesQuestions

  • The two-stage Simplex and big-M methods for maximising and minimising problems which may include both ≤ and ≥ constraints.
    Year 2
    Year 2: this is content the exam board adds beyond the AS subject content, for the full A-level.

    D1-5.4NotesQuestions

Turn the reds green faster

Tell me which topics you rated red and we'll spend the lesson exactly there. Free intro call, then a free first lesson.

Book a free intro call

Want a hand with this?

Everything here stays free. If the marks keep going in the same place, I teach the topic behind it one to one from the mark schemes. Free intro call, then a free first lesson.

Book a free intro call