📚 Mastering the Further Maths Decision Maths 1 Exam: Top Scoring Techniques | 进阶数学决策数学1试卷高分技巧全解析
Decision Maths 1 (D1) often surprises A-level Further Maths students — it tests algorithmic thinking rather than pure calculus, yet it can be a huge marks booster if approached with a clear strategy. This guide breaks down the most common question types, exam pitfalls, and systematic revision methods to help you secure top marks on the D1 question paper.
决策数学1常常让A-level进阶数学的学生感到意外——它考察的是算法思维而非纯微积分，但如果你采用清晰的策略，它完全可以成为大幅提分的利器。本指南将分解最常见的题型、考试陷阱和系统的复习方法，帮助你在D1试卷上稳获高分。
1. Understanding the D1 Exam Structure | 了解决策数学1试卷结构
Before diving into revision, you must know exactly what the exam board expects. Most D1 papers are 1 hour 30 minutes long, carrying 75 marks, with a mix of short algorithmic questions and longer unstructured problems. The paper typically covers algorithms (sorting, bin packing, Dijkstra), graph theory, critical path analysis, linear programming, and network flows. Every mark is accounted for by method steps, so never skip the working.
在开始复习之前，你必须准确了解考试局的要求。大多数D1试卷时长为1小时30分钟，满分75分，包含简短的算法题和较长的非结构化问题。试卷通常涵盖算法（排序、装箱、Dijkstra）、图论、关键路径分析、线性规划和网络流。每一分都对应着方法步骤，因此绝对不要省略计算过程。
- Command words: 'Find', 'State', 'Explain', 'Determine' have different requirements — 'Explain' often asks for a justification, not just a numerical answer.
- 指令词：'Find'、'State'、'Explain'、'Determine' 有不同的要求——'Explain' 通常要求给出理由，而不仅仅是数值答案。
- Marks are awarded for correct tables, diagrams, and clearly shown pivot choices in Quick Sort.
- 在快速排序中，正确的表格、图示和清晰的枢轴选择会得到分数。
- Always check if the question expects a specific format, such as listing sorted items in a certain order or drawing a Gantt chart with a labelled time axis.
- 务必要检查题目是否要求特定格式，例如按某种顺序列出已排序的项目，或者绘制带有标记时间轴的甘特图。
2. Mastering Algorithms: The Backbone of D1 | 掌握算法：决策数学1的核心
Algorithms are the heart of Decision Maths. You must be able to trace them, apply them to unseen data, and sometimes compare their efficiency. The key algorithms include Bubble Sort, Quick Sort, the three Bin Packing algorithms (First-fit, First-fit decreasing, Full-bin), and Dijkstra's algorithm. Do not just memorise the steps; understand why a pivot is chosen or why the First-fit decreasing algorithm usually gives a better solution.
算法是决策数学的核心。你必须能够追踪算法、将其应用于未见数据，有时还需比较它们的效率。关键算法包括冒泡排序、快速排序、三种装箱算法（首次适应、降序首次适应、满箱）和Dijkstra算法。不要死记硬背步骤；要理解为什么选择某个枢轴，或者为什么降序首次适应算法通常能得到更好的解决方案。
For Quick Sort, always show your working by listing the sublists after each pass. Clearly box the pivot you have chosen and note which items remain to be sorted. Marks are heavily dependent on clear communication of the pivot selection and the intermediate list states.
对于快速排序，一定要通过列出每趟之后的子列表来展示计算过程。清晰框出你选择的枢轴，并注明哪些项目仍有待排序。分数的获取很大程度上取决于对枢轴选择和中间列表状态的清晰表述。
- Bubble Sort: Practice counting comparisons and swaps exactly; trace tables earn easy marks when neat.
- 冒泡排序：练习精确计数比较和交换次数；整洁的跟踪表能轻松拿分。
- Bin Packing: Always state the algorithm used. For Full-bin, show the combinations you used; for First-fit decreasing, sort items correctly before placing.
- 装箱算法：总是说明所用的算法。对于满箱算法，展示你使用的组合；对于降序首次适应，先正确排序物品再放置。
- Dijkstra: Use boxes or a table to update working values. Give the final route and its length.
- Dijkstra：用方框或表格更新临时标号。给出最终路径及其长度。
3. Graph Theory: Drawing and Interpreting Correctly | 图论：正确绘制与解读
Graph theory questions often involve drawing a graph from an adjacency matrix, identifying whether a graph is Eulerian, semi-Eulerian, or neither, and applying algorithms like Kruskal's or Prim's. A common mark-costly mistake is forgetting to label edges with weights or misreading a directed graph. For matrix representation, be fluent with both adjacency and distance matrices.
图论问题通常包括根据邻接矩阵画图、判断图是欧拉图、半欧拉图还是两者皆非，以及应用克鲁斯卡尔或普里姆算法。一个常见的丢分错误是忘记用权重标记边，或者误读有向图。对于矩阵表示，要熟练掌握邻接矩阵和距离矩阵。
When finding a minimum spanning tree, you must list the edges in the order they were selected, and if a choice occurs, state that you chose arbitrarily. For Kruskal's, managing the list of sorted edges carefully prevents errors. For Prim's on a matrix, clearly indicate the row-column elimination steps.
当寻找最小生成树时，你必须按选择顺序列出边，如果出现多种选择，要说明你是任意选择的。对于克鲁斯卡尔算法，仔细管理排序边的列表可以避免错误。对于基于矩阵的普里姆算法，清晰表明行列删除步骤。
- Eulerian trail conditions: a connected graph has an Eulerian trail iff it has exactly two odd vertices.
- 欧拉轨迹条件：一个连通图具有欧拉轨迹当且仅当它恰好有两个奇度顶点。
- Use trace tables for Route Inspection (Chinese Postman) problem: pair odd vertices systematically, compute shortest distances, and add the minimal extra weight.
- 对于路线检查（中国邮递员）问题使用跟踪表：系统地给奇度顶点配对，计算最短距离，然后加上最小的额外权重。
4. Critical Path Analysis: Timing is Everything | 关键路径分析：时间决定一切
Critical Path Analysis (CPA) appears in almost every D1 paper. You will be asked to construct an activity network from a precedence table, perform forward and backward passes to find earliest and latest event times, identify the critical path(s), and draw a Gantt (cascade) chart. The forward pass calculates earliest start times (EST) by taking the maximum; the backward pass calculates latest finish times (LFT) by taking the minimum.
关键路径分析（CPA）几乎出现在每份D1试卷中。你会被要求根据前趋表构建活动网络，进行顺推和逆推以求出最早和最晚事件时间，识别关键路径，并绘制甘特（阶梯）图。顺推时取最大值计算最早开始时间（EST）；逆推时取最小值计算最晚完成时间（LFT）。
Always scan the precedence table carefully: activities with no preceding activities start at source node 0. Use dummies correctly to represent dependent relationships without consuming time. A common error is missing a dummy that prevents two activities from sharing the same start and end nodes.
始终仔细审视前趋表：没有前趋活动的活动从源节点0开始。正确使用虚拟活动来表达依赖关系而不消耗时间。一个常见错误是漏掉一条虚拟活动，导致两个活动共享相同的起始和结束节点。
For the Gantt chart, use a horizontal time axis, label each activity, show float as a dashed line, and mark only the necessary workers. Compare your chart against the question's requirement—some papers ask for a resource histogram as well.
对于甘特图，使用水平时间轴，标记每项活动，用虚线显示浮动时间，并仅标注必要的工人数量。将你的图表与题目要求进行对比——有些试卷还会要求绘制资源直方图。
5. Linear Programming: Formulating and Solving Efficiently | 线性规划：高效建模与求解
nd then graph the feasible region. Accurate plotting is essential. Use a ruler, label axes clearly (e.g., x = number of type A, y = number of type B), and shade out the unwanted regions according to the convention used by your exam board—usually shading the area that does not satisfy each inequality.
线性规划（LP）问题通常给出一个情境，你必须将其转化为不等式，明确定义决策变量，然后画出可行域。精确作图至关重要。使用直尺，清晰标注坐标轴（例如 x = A类数量，y = B类数量），并按照考试局的习惯给不满足区域打阴影——通常是给不满足每个不等式的区域涂色。
To find the optimal integer solution, if the objective function line method is required, draw the objective line and slide it parallel. If you need to test vertices, list the coordinates of vertices of the feasible region and evaluate the objective function. For integer restrictions always check neighbouring integer points; the vertex may not be the integer optimal.
若需要利用目标函数直线法寻找最优整数解，画出目标函数直线并平行移动。如果需要测试顶点，列出可行域顶点的坐标并计算目标函数值。对于整数限制，始终检查附近的整数点；顶点可能不是整数最优解。
- Define variables precisely: 'Let x be the number of ...' and state non-negativity constraints x ≥ 0, y ≥ 0.
- 精确定义变量：'设 x 为...的数量'并声明非负约束 x ≥ 0, y ≥ 0。
- Use simultaneous equations to find intersection points exactly; approximate readings from graphs will lose accuracy marks.
- 使用联立方程精确求出交点；从图上近似读数会丢失精度分。
6. Matchings and Allocation Problems | 匹配与分配问题
Matchings appear in bipartite graphs, often using the Hungarian algorithm or visual inspection for maximal matchings. You may need to find an initial matching, then apply an alternating path algorithm to improve it to a complete matching. Be systematic: label alternating paths from unmatched vertices on one side and flip the matching edges.
匹配问题出现在二分图中，通常使用匈牙利算法或通过观察寻找最大匹配。你可能需要找到一个初始匹配，然后利用交替路径算法将其改进为完全匹配。要系统化：从一边的未匹配顶点开始标记交替路径，然后翻转匹配边。
In allocation (assignment) problems, the Hungarian algorithm reduces rows and columns to create an optimal assignment that minimises cost or maximises profit. Make sure you carry out the reduction steps in the correct order, and if a tie-choice happens, state how you chose. The final assignment must be listed clearly.
在分配（指派）问题中，匈牙利算法通过行归约和列归约创建最小成本或最大利润的最优分配。确保按正确顺序进行归约步骤，如果出现平局选择，说明你是如何选择的。最终分配必须清晰列出。
- Always double-check the cost matrix when converting a profit matrix: subtract each element from the maximum element, or use an alternative transformation correctly.
- 将利润矩阵转换为成本矩阵时务必仔细核对：用最大值减去每个元素，或正确使用替代变换。
- For updating the matrix with a minimum uncovered element, subtract it from uncovered rows and add to covered columns precisely.
- 对于用最小未被覆盖元素更新矩阵，精确地从未被覆盖行减去该元素，并将其加到被覆盖列。
7. Sorting and Searching Algorithms | 排序与搜索算法
Sorting algorithms are examined through tracing, efficiency comparisons, and sometimes by asking you to write out intermediate steps. Binary search requires an ordered list and works by repeatedly splitting the search interval. State clearly low, high, and mid indexes, and show how the pointers move until the target is found or deemed absent.
排序算法通过追踪、效率比较，有时让你写出中间步骤来考察。二分搜索需要一个有序列表，通过反复划分搜索区间来工作。清楚标明下限、上限和中间索引，并展示指针如何移动直到找到目标或判定目标不存在。
In Quick Sort, efficiency can be discussed in terms of pivot selection; the worst case occurs if the pivot is always the smallest or largest element. In Decision Maths, you are not asked to analyse complexity formally, but you should understand that Quick Sort is generally faster than Bubble Sort for large lists.
在快速排序中，可以根据枢轴选择来讨论效率；最坏情况发生在枢轴总是最小或最大元素时。在决策数学中，不会要求你正式分析复杂度，但你应该理解对于大型列表，快速排序通常比冒泡排序快。
- Bubble Sort: A single pass may confirm the list is sorted if no swaps occur. Use this property for efficiency questions.
- 冒泡排序：如果一趟中没有发生交换，可以确认列表已排序。利用这一性质回答效率问题。
- Always count the right number of comparisons and swaps as required; some questions ask for the exact number after the k-th pass.
- 总是按要求计算比较和交换的正确次数；有些问题会要求给出第k趟之后的确切次数。
8. Network Flows: Maximising Throughput | 网络流：最大流问题
Network flow problems ask you to find the maximum flow through a directed network with upper capacities. You will label paths from source to sink with possible flow, update residual capacities, and continue until no augmenting path exists. The notation is crucial: arc labels should show flow/capacity, e.g., 8/12.
网络流问题要求你求出有向网络中的最大流，每条弧都有容量上限。你需要从源到汇标注可行流路径，更新剩余容量，并持续进行直到不再存在增广路径。标记方式至关重要：弧旁标记应显示流量/容量，例如 8/12。
To prove the flow is maximal, identify a cut that separates the source and the sink, and show that the cut capacity equals the flow value. That is the Max-Flow Min-Cut theorem. Clearly list the arcs crossing the cut and sum their capacities.
要证明流是最大的，找出一个将源与汇分开的割集，并证明割容量等于流量值。这就是最大流最小割定理。清晰列出穿过割集的弧并对其容量求和。
- Always start with a feasible flow, perhaps by inspection or using the upper capacities of a simple path. Keep working neat—redraw the network if necessary.
- 始终从一个可行流开始，可以通过观察或使用简单路径的上限容量。保持卷面整洁——如有必要可重绘网络。
- Watch for backward arcs in the residual network when augmenting flow; they represent flow that can be reduced.
- 在增广流量时注意残余网络中的反向弧；它们代表可以减少的流。
9. Simulating Real-World Processes | 仿真现实世界过程
Simulation questions involve generating random numbers and mapping them to distributions or inter-arrival times. You might be given a table of random digits and asked to simulate a queuing system, recording events such as arrivals and service completions. Create a simulation table with clear columns for time, event, queue size, etc.
仿真问题涉及生成随机数并将其映射到分布或到达间隔时间。可能会给你一张随机数字表，要求你模拟一个排队系统，记录到达和服务完成等事件。创建一个仿真表，清晰标出时间、事件、队列长度等列。
Always follow the rules for the simulation exactly: if the service can start only at certain times, record it appropriately. Some papers ask for a summary statistic like average waiting time. Show all calculations and state your answer to the required precision.
务必严格遵循仿真规则：如果服务只能在特定时间开始，就相应地记录。有些试卷会要求汇总统计量，如平均等待时间。展示所有计算过程，并根据所需精度给出答案。
- Use the random number mapping carefully; a small misread can cascade errors through the simulation.
- 谨慎使用随机数映射；一个微小的误读会引发仿真中的连锁错误。
- vert random digits into times, e.g., service time = 3 min if random digit 0-4, else 6 min.
- 写下将随机数字转化为时间的公式，例如：若随机数字为0-4，则服务时间为3分钟，否则为6分钟。
10. Common Mistakes and How to Avoid Them | 常见错误及避免策略
One of the most frequent errors is misinterpreting the precedence table—students often draw a network where two activities incorrectly share the same start and end nodes without a dummy. Always check for parallel activities that need to be distinguished. Another mistake is failing to update the working values in Dijkstra's algorithm systematically, which leads to wrong final distances.
最常见的错误之一是误读前趋表——学生们经常会画出两个活动错误地共享相同起始和结束节点而没有虚拟活动的网络。始终检查需要区分的并行活动。另一个错误是在Dijkstra算法中未能系统性地更新临时标号，导致最终距离错误。
In linear programming, shading the wrong side of a line is a classic slip. Test the origin (0,0) in the inequality to verify which side to shade. In critical path analysis, miscalculating the EST by using an incorrect maximum will cause cascading errors throughout the backward pass and float calculations.
在线性规划中，给直线的错误一侧打阴影是典型的疏忽。用原点(0,0)检验不等式来验证该涂哪一侧。在关键路径分析中，由于使用了错误的最大值而算错最早开始时间，会导致逆推和浮动时间计算中的连锁错误。
- For Bubble Sort, not counting comparisons when items are already in order can lose comparison marks.
- 对于冒泡排序，当项目已经有序时不计算比较次数会丢失比较分。
- Always re-read the final part of a question: 'Hence' means use your previous answers; 'State a limitation' requires a concise sentence, not a paragraph.
- 始终重读问题的最后部分：'Hence'意味着使用你之前的答案；'State a limitation'要求简洁的一句话，而不是一段。
11. Time Management and Exam Technique | 时间管理与应试技巧
With roughly 1.2 marks per minute, you must keep moving. Allocate time proportionally: a 5-mark algorithm trace should take no more than 6-7 minutes. If you get stuck on a drawing, move on and return later. Start with the questions you feel most confident about, but do not spend more than a minute choosing. Often the paper starts with a gentle sorting question to build confidence.
试卷大约每分钟1.2分，因此你必须保持节奏。按比例分配时间：一个5分的算法追踪题不应超过6-7分钟。如果卡在绘图上，跳过它回头再做。从你最有信心的题目开始，但花在选择上的时间不要超过一分钟。通常试卷一开始会有一道简单的排序题来建立信心。
For the long free-response problem at the end, sketch a plan before writing. In CPA, quickly draft the activity network in pencil, annotate with EST/LFT, and then transfer to the answer book. Use bullet points or numbered steps to communicate working—this saves time and makes your reasoning visible to the examiner.
对于最后的长自由作答问题，在动笔前先拟个计划。在CPA中，用铅笔快速草画活动网络，标注EST/LFT，然后誊写到答题本上。使用项目符号或编号步骤来展示计算过程——这样既节省时间，也让考官清晰看到你的推理。
- Keep an eye on the clock: 30 minutes remaining, you should be starting the last few questions.
- 留意时间：剩余30分钟时，你应该开始解答最后几道题。
- If a calculation check reveals a mistake, fix it neatly with a single line through and correct above; avoid messy scribbles.
- 如果验算发现错误，用单划线删掉并在上方改正，保持整洁；避免涂写一团糟。
12. Final Revision Checklist | 最终复习清单
Two weeks before the exam, focus your revision on past paper practice under timed conditions. Know all the algorithmic steps by heart; create flashcards for the Hungarian algorithm reduction steps, the order of operations in Dijkstra, and the conditions for Eulerian trails. Verify that you can explain why a network might need a dummy activity in one sentence.
考试前两周，把你的复习重点放在计时条件下的往年真题练习上。熟记所有算法步骤；为匈牙利算法的归约步骤、Dijkstra的操作顺序、欧拉轨迹的条件制作闪卡。确保你能用一句话解释为什么某个网络需要一个虚拟活动。
On the day before the exam, review your common mistakes log. Sleep well, and in the exam hall, read the instruction page for any specific requirements such as 'use the back of the sheet for rough work'. With a methodical approach, D1 can be the section that pushes your Further Maths grade to the top boundary.
考试前一天，复习你的常见错误日志。睡个好觉，在考场中，阅读说明页是否有任何具体要求，比如“使用试卷背面做草稿”。凭借有条不紊的方法，D1完全可以成为将你的进阶数学成绩推向最高等级边界的那一部分。
Published by TutorHao | Further Mathematics Decision Maths 1 Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图