📚 A-Level Edexcel Decision Mathematics 1: High-Scoring Techniques | Edexcel 进阶决策数学1 高分技巧
Decision Mathematics 1 (D1) is a unique module within the Edexcel A-Level Further Mathematics specification. It focuses on algorithms, graph theory, optimisation, and logical processes rather than continuous calculus or pure algebra. Many students underestimate the depth of D1, assuming it is simply ‘common sense’. In reality, achieving a top grade requires meticulous attention to detail, precise notation, and the ability to present solutions in a structured, exam-friendly manner. This guide will walk you through high-scoring techniques that examiners love, helping you maximise your marks on every question.
决策数学1（D1）是Edexcel A-Level进阶数学中一个独特的模块。它关注算法、图论、优化和逻辑步骤，而非连续的微积分或纯代数。许多学生低估了D1的深度，以为它只是“常识”。实际上，要拿到最高等级，你需要对细节一丝不苟、使用准确的符号，并能够以结构化、符合考试要求的方式呈现解答。本指南将带你了解阅卷老师青睐的高分技巧，帮助你在每道题上争取最高分。
1. Understanding the Exam Structure | 理解考试结构
The Edexcel D1 exam is a 1 hour 30 minute paper worth 75 marks, typically comprising 6 to 7 questions. All topics are compulsory, and the paper mixes short, algorithm-focused items with longer, multi-stage problems. Knowing the structure allows you to allocate time effectively: roughly 1.2 minutes per mark. Save the last 5–10 minutes for checking critical parts, such as the ordering of a bubble sort or the tracing of Dijkstra’s algorithm.
Edexcel D1 考试时长为1小时30分钟，满分75分，通常包含6到7道题。所有题目都是必答题，试卷混合了侧重算法的简短题目和较长的多阶段问题。了解结构有助于你有效分配时间：大约每分1.2分钟。留出最后5-10分钟检查关键部分，如冒泡排序的顺序或 Dijkstra 算法的追踪过程。
Examiners’ reports highlight that many candidates lose marks not through lack of knowledge, but through incomplete working or failure to follow the exact algorithm steps as defined in the specification. Always use the Edexcel-approved version of each algorithm. For example, when performing a binary search, the midpoint calculation must use (left+right)/2 and then round down; any deviation may be penalised.
阅卷报告强调，许多考生失分并非因为知识欠缺，而是因为解题步骤不完整或未能遵循考纲定义的精确算法步骤。务必使用 Edexcel 认可的算法版本。例如，进行二进制搜索时，中点计算必须使用 (left+right)/2 并向下取整；任何偏离都可能导致扣分。
2. Mastering Sorting Algorithms | 掌握排序算法
Bubble sort and quick sort are frequent topics. For bubble sort, always show each pass clearly, indicating comparisons and swaps. Write the list after each pass and state the number of passes and comparisons made. The exam often asks for the state of the list after a specified number of passes, so you must not perform a full sort unless instructed.
冒泡排序和快速排序是常考主题。对于冒泡排序，务必清晰地展示每一趟操作，标明比较和交换。写出每一趟后的列表，并说明完成的趟数和比较次数。考试常要求给出在指定趟数后的列表状态，因此除非题目要求，不要进行完整的排序。
Quick sort requires firm grasp of pivoting. Always underline the pivot, then create sublists of values smaller and larger than the pivot, keeping their original relative order. If the question asks for quick sort using the first item as pivot, stick to that consistently. Leaving behind the chosen pivot in its final position and then sorting sublists recursively gains method marks. Avoid the slip of placing items equal to the pivot incorrectly; if the specification says items smaller go left, items equal to pivot should go right (or left depending on variant), so check Edexcel’s precise rule: items equal to the pivot go into the right sublist in the standard version, but always confirm with the textbook.
快速排序要求牢牢掌握枢轴的使用。始终在枢轴下方划线，然后创建比枢轴小和大的子列表，保持原有的相对顺序。如果题目要求使用第一个元素作为枢轴，就始终如一地使用。将选定的枢轴留在其最终位置上，然后递归排序子列表，这样可以获得方法分。避免错误地放置与枢轴相等的元素；如果考纲规定较小的放左边，相等的应放右边（或左边，因版本而异），所以查阅 Edexcel 的确切规则：标准版本中，与枢轴相等的元素放入右侧子列表，但务必结合教材确认。
3. Binary Search and Order of Algorithms | 二进制搜索与算法阶
Binary search is assessed both as a practical algorithm and through efficiency analysis. When applying binary search, show the left and right pointers, the midpoint calculation, the comparison with the target, and how the interval halves. Always write the conclusion clearly: ‘Found at position … after … iterations’ or ‘Not found after … iterations’.
二进制搜索既作为实用算法考查，也通过效率分析考查。实施二进制搜索时，展示左右指针、中点计算、与目标的对比以及区间如何折半。务必清晰地写出结论：“在…次迭代后在位置…找到”或“在…次迭代后未找到”。
Understanding algorithm order in terms of O(n), O(n²), O(log n) is vital. For bubble sort, know that both the number of comparisons and swaps in the worst case are O(n²). For the sorting network or shell sort, you might need to recall specific complexities. These often appear as standalone marks in multiple-choice-style questions or as part of a longer algorithm tracing question. Do not rely on vague intuition; memorise the standard complexities from the textbook.
理解以 O(n)、O(n²)、O(log n) 表示算法阶至关重要。对于冒泡排序，要知道最坏情况下的比较次数和交换次数都是 O(n²)。对于排序网络或希尔排序，你可能需要记起特定的复杂度。这些常常作为选择题式的独立分数出现，或作为更长的算法追踪题的一部分。不要依赖模糊的直觉；要牢记教材中的标准复杂度。
4. Graph Algorithms: Kruskal and Prim | 图算法：Kruskal与Prim
Kruskal’s algorithm builds a minimum spanning tree by selecting edges in order of increasing weight, avoiding cycles. Always list the edges sorted by weight, then select one by one. Show each selection and state the total weight. If a selected edge forms a cycle, clearly explain why it is rejected. For Prim, whether you start with a given vertex or build the tree using a distance matrix, show the set of connected vertices growing and the corresponding chosen edges.
Kruskal 算法通过按权重递增顺序选择边来构建最小生成树，并避免环路。先把边按权重排序列表，然后逐一选择。展示每一步的选择，并写明总权重。如果某条边形成环，要清晰解释拒绝原因。对于 Prim 算法，无论是从给定顶点开始还是用距离矩阵构建，都要展示已连接顶点集的增长以及相应的被选边。
When applying Prim on a table, cross out columns and label selected vertices carefully. A common mistake is failing to update the temporary labels correctly when a new vertex is added; always scan the entire row of the newly added vertex to see if smaller weights can replace existing labels. Examiners award marks both for the correct final tree and for the systematic working.
在表格上应用 Prim 时，要小心地划掉列并标注已选顶点。一个常见错误是，当新顶点加入时未能正确地更新临时标签；每当加入新顶点，都要扫描该顶点的整行，看是否有更小的权重可替代现有标签。阅卷老师既给正确的最终树打分，也给系统性的解题步骤打分。
5. Dijkstra’s Algorithm for Shortest Path | Dijkstra最短路径算法
Dijkstra’s algorithm appears regularly and demands rigorous box notation. For each vertex, maintain the working values: order of labelling, final label, and the vertex from which it was labelled. Update using the smallest temporary label each time. Write the permanent label inside a box, and when writing the path at the end, trace back from the destination. Ensure you show the route and its length explicitly.
Dijkstra 算法经常出现，并要求严格的方框符号。对每个顶点，维护工作值：标注顺序、最终标签以及给该顶点标注的来源顶点。每次使用最小的临时标签更新。将永久标签写入方框内，最后写路径时，从终点回溯。确保明确展示路径及其长度。
If the question involves a real-world context, such as road distances, you must interpret the shortest path in terms of the original problem. For example, ‘The shortest route from A to G is A→C→E→G with a total distance of 12 units.’ Do not forget to answer any additional interpretative parts, like ‘State the quickest detour if a road is closed.’ These are easy marks if your working is clear.
如果题目涉及实际情景，如道路距离，你必须根据原始问题解释最短路径。例如，“从 A 到 G 的最短路线是 A→C→E→G，总距离为12个单位”。不要忘记回答任何额外的解释性问题，如“如果一条路封闭，请说明最快的绕行路线”。只要你的解题步骤清晰，这些分数很容易拿到。
6. Critical Path Analysis: Precedence and Float | 关键路径分析：先后关系与时差
Critical path analysis questions involve constructing a precedence table, drawing an activity-on-node network, and calculating earliest and latest event times. The exam expects neat, well-labelled diagrams with forward and backward passes clearly shown. Every event node must display the earliest start time and latest start time. The float of activities must be calculated: total float = latest start – earliest start – duration. Show the critical path with a bold or highlighted line.
关键路径分析题目涉及构建先后关系表、绘制节点表示活动的网络图、以及计算最早和最晚事件时间。考试要求整洁、标注清晰的图表，并清楚展示前向与后向推进过程。每个事件节点必须显示最早开始时间和最晚开始时间。活动的时差必须计算：总时差 = 最晚开始时间 – 最早开始时间 – 历时。用粗线或高亮线标出关键路径。
Dummy activities often cause confusion. Remember, a dummy has zero duration and is used purely to represent logical dependencies. When there are two activities sharing the same start and end events but with different dependencies, a dummy is essential. Also, when drawing the network, avoid unnecessary dummies – examiners penalise overly complex diagrams. Always translate the precedence table faithfully and check that every dependency is coded exactly once.
虚工序常常引起混淆。记住，虚工序历时为零，纯粹用于表示逻辑依赖关系。当有两条活动共享相同的开始和结束事件但具有不同依赖关系时，虚活动是必需的。此外，在绘制网络时，避免不必要的虚工序——过复杂图表会被扣分。始终忠实地翻译先后关系表，并检查每个依赖关系恰好都被编码一次。
7. Linear Programming: Graphing and Vertex Testing | 线性规划：图解法与顶点测试
Graphical linear programming in D1 requires careful inequality shading. Use the convention of shading out the unwanted region, or as specified by Edexcel (usually shading the feasible region). Check the guidance in the textbook: Edexcel normally shades the feasible region or sometimes uses the ‘shade out’ approach – stick to what is most recent and taught. Clearly label each constraint line with its equation, and mark the feasible region. The vertex method then tests the objective function at each corner point of the feasible region to find the maximum or minimum.
D1 中的图解线性规划要求仔细的不等式阴影处理。使用划出不可行区域的约定，或遵循 Edexcel 的规定（通常是给可行区域涂色）。查阅教材中的指导：Edexcel 通常为可行区域涂色，有时使用“划出不可行”方法——坚持最新、最被教授的方法。在每个约束线上清晰标出其方程，并标记可行区域。然后顶点法在可行区域的每个角点处测试目标函数，以找到最大值或最小值。
When an objective line is drawn, draw it accurately with a ruler and show its equation. Examiners expect you to find exact coordinates of intersection points by solving simultaneous equations. State your final answer in the context of the problem, with correct units. Be mindful of integer constraints: if only whole numbers are allowed, you must check integer points near the continuous optimum. This often earns method marks for verifying both nearest integer coordinates.
绘制目标函数线时，用直尺精确绘制并展示其方程。阅卷老师期望你通过解联立方程找到交点的精确坐标。在问题背景下给出最终答案，并附上正确单位。注意整数约束：如果只允许整数，你必须检查连续最优解附近的整数点。这常常会因验证了最近的两个整数坐标而获得方法分。
8. Allocation Problems: Hungarian Algorithm | 分配问题：匈牙利算法
The Hungarian algorithm finds a minimum cost allocation in an n×n cost matrix. First reduce rows, then columns, then create a covering of zeros using the minimum number of lines. If the number of lines equals n, an optimal matching exists; otherwise, augment by subtracting the smallest uncovered value and adding it to double-covered entries. Show each step clearly in separate matrices. Missing an augmentation step is a frequent error.
匈牙利算法在n×n成本矩阵中寻找最小成本分配。先做行规约，再列规约，然后用最少线数覆盖所有零。如果线数等于n，则存在最优匹配；否则，通过减去未覆盖的最小值并将其加到双重覆盖的条目上来增广。用单独矩阵清晰展示每一步。遗漏增广步骤是常见错误。
If the problem maximises profit, convert to a minimisation problem by subtracting all entries from a number equal to or larger than the largest entry. Also, if the matrix is unbalanced (more workers than jobs or vice versa), add dummy rows or columns with zero costs. Marking schemes often allocate marks for the correct initial transformation and for each reduction step. Always present the final matching and the total minimum cost or maximum profit.
如果问题是最大化利润，则通过用等于或大于最大条目的数字减去所有条目，将其转化为最小化问题。此外，若矩阵不平衡（工人多于工作或反之），添加成本为零的虚行或虚列。评分方案常在正确的初始变换和每个规约步骤上给分。始终给出最终的匹配组合以及总最小成本或最大利润。
9. Using the Textbook and Resources Efficiently | 高效使用教材与资源
The official Edexcel AS and A level Further Mathematics Decision Mathematics 1 Textbook is your essential tool. Work through every worked example, covering the solution, then attempt the exercises without looking. The e-book version is handy for searching keywords and practising on a tablet, but always replicate exact algorithm layouts on paper. Pay close attention to the ‘Key Points’ and ‘Exam Tips’ boxes scattered throughout the text.
官方 Edexcel AS and A level Further Mathematics Decision Mathematics 1 教材是你的必备工具。钻研每个例题，盖住解答，然后不看答案尝试练习。电子书版本便于搜索关键词和在平板上练习，但要始终在纸上复现精确的算法格式。密切关注教材各处散落的“要点”和“考试技巧”框。
Pair the textbook with past papers from the Edexcel website. D1 questions follow predictable patterns. After interpreting the mark scheme, note where marks were lost: often it is your layout, not your understanding. Create a checklist of presentation rules, such as ‘box the final label in Dijkstra’, ‘underline pivot in quick sort’, ‘state number of comparisons in bubble sort’. Drill these until they become automatic.
将教材与 Edexcel 官网的历年真题结合使用。D1 题目遵循可预测的模式。在解读评分方案后，注意失分之处：常常是表达格式而非理解出了问题。制作一份格式清单，例如“Dijkstra 中框出最终标签”、“快速排序中在枢轴下划线”、“冒泡排序中说明比较次数”。反复练习直到它们成为下意识动作。
10. Exam-Day Technique: Maximising Marks Under Pressure | 考场技巧：压力下争取最高分
Start with the question you find easiest, but leave space for the compulsory plotting or diagram questions, as they often require a clean layout. Read each question stem at least twice. Underline key instructions like ‘after the third pass’, ‘using the first item as pivot’, or ‘state the critical path’. Missing a small phrase can cost several marks.
先做你感觉最简单的题，但要为必考的绘图或图形题留出空间，因为它们往往需要整洁的布局。每题至少读两遍。在关键指令下划线，如“经过第三趟后”、“使用第一个元素作为枢轴”、“说明关键路径”。遗漏一个短语可能丢掉好几分。
When a question asks for the number of comparisons or swaps, explicitly write a short commentary. Do not just show the final list. For instance, in bubble sort: ‘Pass 1: 5 comparisons, 2 swaps; list after pass 1: …’. This systematically secures method marks. Also, practise using the correct vocabulary from the specification: ‘earliest start time’, ‘total float’, ‘minimum vertex cover’, etc. Examiners appreciate correct terminology and it contributes to clarity.
当题目要求写出比较次数或交换次数时，要明确进行简短注释。不要只展示最终列表。例如，冒泡排序：“第一趟：5次比较，2次交换；第一趟后列表：…”。这样系统地获得方法分。此外，练习使用考纲中的正确词汇：“最早开始时间”、“总时差”、“最小顶点覆盖”等。阅卷老师欣赏规范的术语，这有助于提高清晰度。
Finally, keep an eye on the clock. If you get stuck on a network diagram or linear programming plot, move on. Sometimes the later parts of a question can be tackled independently. By ensuring you have attempted every question, you maximise the chances of scoring marks from simple knowledge retrieval that may appear in unexpected places.
最后，留意时间。如果你在网络图或线性规划图形上卡住，就继续前进。有时候一道题的后半部分可以独立解答。确保你尝试了每一道题，就能最大程度地抓住那些可能出现在意想不到地方的简单知识检索分。
Published by TutorHao | Further Mathematics Decision 1 Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导