These guides are designed to assist with planning your review or revision. They are concise, up-to-date, and strictly follow the revised syllabus. Developed through collaboration among many teachers, these resources aim to be practical teaching aids. If they prove useful in your instruction, kindly consider leaving a review. Your feedback is invaluable in improving our guide creation process. Additional guides can also be found in the store.
This comprehensive Pearson Edexcel IAL Decision Mathematics D1 (WDM11/01) Master Revision Guide provides complete specification coverage for this unique unit that rewards systematic algorithmic execution rather than algebraic manipulation. Aligned with the 2019–2025 exam series and based on examiner reports, this resource helps students master sorting algorithms, network optimisation, linear programming, and project scheduling.
What’s inside?
Topic frequency heatmap – Critical topics (★★★★★) appear in every sitting: bubble sort and quick sort, Kruskal’s and Prim’s MST algorithms, Dijkstra’s shortest path, Chinese Postman route inspection, maximum matching, linear programming (formulation, graphical solution, integer LP), and critical path analysis (forward/backward pass, critical path, float).
Top examiner-penalised errors
Algorithm reference audit – No formula booklet is provided in D1.
Full worked examples – Step-by-step solutions for bubble sort (all passes, final zero-swap pass), quick sort (sublists and pivots), Prim’s on a distance matrix, Dijkstra’s table with backtracking, Chinese Postman with all 3 pairings for 4 odd vertices, maximum matching via augmenting path, LP formulation and graphical solution, and CPA with float table.
Exam strategies – Show ALL working (M marks require intermediate steps), LP on graph paper (never freehand), CPA start node late time must = 0, Dijkstra’s table format first.
Predicted topics – High-confidence predictions
How I use this guide:
For students – D1 marks are earned by showing algorithm steps. Never write only the final answer. For Dijkstra’s, draw the table first. For Prim’s matrix, cross out columns as you go. For LP, always use graph paper. For CPA, forward pass = MAX, backward pass = MIN.
For teachers – Use weakness profiles to diagnose students (Step-Skipper, Kruskal/Prim Conflator). The algorithm reference audit (Section 15) provides a complete checklist for every examinable procedure.
Independently produced by Samata Reviews. Not affiliated with or endorsed by Pearson Education Limited or Edexcel.
#EdexcelIALDecisionMath #DecisionMathematicsD1 #WDM11 #IALDecisionMaths #ALevelDecisionMaths #Algorithms #GraphTheory #MinimumSpanningTree #KruskalsAlgorithm #PrimsAlgorithm #DijkstrasAlgorithm #ChinesePostman #RouteInspection #TravellingSalesman #LinearProgramming #CriticalPathAnalysis #CPM #Matchings #BipartiteGraphs #BubbleSort #QuickSort #BinPacking #TopicHeatmap #ExamPredictions #WorkedExamples #MathsTeacherResources
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£5.75