📚 High-Scoring Techniques for OxfordAQA 9660-MA05 Decision 1 June 2023 | 牛津AQA 9660-MA05 决策数学1 2023年6月高分技巧
Achieving a top grade in the OxfordAQA International A-level Mathematics Decision 1 (unit MA05) requires more than just algorithmic knowledge—it demands clarity, precision, and strategic exam technique. This guide dissects the June 2023 paper structure and delivers actionable high-score tips for every major topic.
在牛津AQA国际A-level数学决策数学1（单元MA05）中取得高分，不仅需要掌握算法知识，更要求步骤清晰、计算精准与应试策略。本指南剖析2023年6月试卷结构，并针对每个核心主题提供可操作的高分技巧。
1. Understanding the Exam Structure | 试卷结构解析
The MA05 Decision 1 paper lasts 1 hour 30 minutes and carries 80 marks, typically comprising 6‑7 compulsory questions. Marks are awarded for method (M), accuracy (A) and, on occasion, for clear explanations (E). Even if a final answer is incorrect, well‑documented workings can secure the majority of marks.
MA05决策数学1考试时长1小时30分钟，满分80分，通常包含6至7道必答题。评分包括方法分（M）、准确分（A），有时还需解释分（E）。即使最终答案出错，清晰的过程展示仍能斩获大部分分数。
Questions frequently integrate multiple topics, for instance a linear programming exercise that first requires a sorting pass or a graph algorithm. Cultivate the habit of recognising cross‑topic links as you read each question.
考题经常将多个主题融合在一起，例如一道线性规划题需要先完成排序，或结合图论算法。阅读题目时就要养成识别跨知识点关联的习惯。
2. Sorting and Searching Algorithms | 排序与搜索算法
Sorting questions demand a meticulous, step‑by‑step approach. Whether you use bubble sort, shuttle sort or quick sort, record comparisons and swaps on each pass. For bubble sort, number the passes and show the list after each pass, underlining elements that are in their final position.
排序题要求逐次、逐步骤的细致书写。无论采用冒泡排序、穿梭排序还是快速排序，都要逐趟记录比较和交换。冒泡排序要标出第几趟，每趟后写出当前列表，并在已归位元素下划线。
For quick sort, clearly state the pivot, partition the list into sub‑lists, and repeat the process recursively. Show the sub‑list boundaries and the sorted result at each stage. A common pitfall is omitting the pivot from the sub‑lists; always place it correctly between the partitions.
快速排序需明确写出枢轴，划分子列表，递归重复。展示子列表边界和每阶段排序结果。常见错误是遗漏枢轴，未将其正确放置在两个分区之间。
Binary search on an ordered list should show the middle index and value at each iteration. When the target is found, state its position; if not, conclude ‘not in list’ with justification. Remember to write the comparisons clearly to gain method marks.
在有序列表上执行二分搜索时，每次迭代都要写出中间索引和取值。找到目标则声明位置；找不到需给出“不在列表中”的结论并说明理由。清晰书写比较过程以获取方法分。
3. Graph Theory and Network Algorithms | 图论与网络算法
Kruskal’s algorithm begins by listing all edges in ascending order of weight. Select edges in order, rejecting those that create a cycle, until a spanning tree with (n‑1) edges is formed. Tabulate the chosen edges, their weights and the running total. Prim’s algorithm can be presented as a table of vertices and distances, updating from the tree.
克鲁斯卡尔算法先按权重升序列出所有边，按序选择不构成回路的边，直到生成具有(n‑1)条边的生成树。用表格列出被选边、权重和累积总重。普里姆算法可用一个顶点距离更新表呈现。
For Dijkstra’s shortest path, draw a separate box for each vertex showing the working values. Write the permanent label above the box and cross out temporary labels as you update. When tracing the route, work backwards from the destination and list the vertices in order. Always indicate the final path and its length.
迪杰斯特拉最短路径题要为每个顶点画出独立方框，展示工作值。永久标号写在方框上方，临时标号在更新时划去。反向追溯路径时从终点回溯，依次列出顶点。务必注明最终路径及其长度。
In route inspection (Chinese postman) problems, first identify all odd‑degree vertices. Pair them to minimise the sum of shortest distances between pairs, then duplicate those edges. Write down the extra edges added and compute the total length of the new Eulerian trail. Chosen pairings must be justified with a matching table.
在中国邮递员（路线检查）问题中，先找出所有奇度顶点，配对使两两间最短距离之和最小，然后重复这些路径上的边。写出添加的额外边并计算新欧拉巡回总长度。选定的配对须用匹配表加以证明。
4. Critical Path Analysis | 关键路径分析
Start by converting the precedence table into an activity‑on‑arc network. Use exactly one start and one finish node, and introduce dummies only when two activities share some, but not all, predecessors. Label each arc with its activity letter and duration.
首先将紧前关系表转化为活动弧网络。只使用一个开始节点和一个结束节点，仅在两个活动共享部分非全部紧前活动时引入虚工作。每条弧标上活动字母和持续时间。
Carry out a forward pass to obtain earliest start times (EST), writing values at each node. Then perform a backward pass to find latest start times (LST). Calculate total float = LST – EST – duration for each activity. Activities with zero total float form the critical path(s). Present the results in a clear table.
进行前向传递计算最早开始时间（EST），将数值标注在每个节点旁。再进行后向传递得到最迟开始时间（LST）。对每个活动计算总时差 = LST – EST – 持续时间。总时差为零的活动构成关键路径。用清晰的表格呈现结果。
A common exam mistake is forgetting to include all immediate predecessors when drawing the network. Double‑check the precedence table before moving to the float calculations—an incorrect network will invalidate all subsequent marks.
考试中常见的错误是绘制网络时遗漏某个紧前活动。在执行时差计算前务必再次核对紧前关系表——网络图错误将导致后续得分全部作废。
5. Linear Programming: Graphical and Simplex Methods | 线性规划：图形法与单纯形法
For a two‑variable problem, graph each constraint as a line, shade the feasible region, and test each vertex in the objective function to find the optimum. Label axes and constrain lines clearly. If the question asks for integer solutions, examine points on the boundary nearest to the optimal vertex.
两变量问题需将每个约束条件画成直线，标出可行域，然后计算每个顶点处的目标函数值以确定最优解。清楚标注坐标轴和约束线。若题目要求整数解，则检查最优顶点附近的边界整数点。
The simplex method begins by writing the linear programme in standard form, adding slack, surplus and artificial variables as needed. Enter the initial tableau with the objective row written as an equation (e.g. P – 3x₁ – 4x₂ = 0). Select the pivot column from the most negative coefficient in the objective row, then the pivot row by the minimum positive ratio test.
单纯形法首先将线性规划问题写成标准形式，按需添加松弛变量、剩余变量和人工变量。建立初始单纯形表，目标行写成方程（如 P – 3x₁ – 4x₂ = 0）。从目标行中最负系数选择主元列，再用最小正比值检验选择主元行。
Elementary row operations are performed to make the pivot element 1 and all other entries in the pivot column zero. Continue until there are no negative entries in the objective row. The optimal solution can then be read directly from the final tableau: basic variables equal right‑hand side values, non‑basic are zero.
通过初等行运算将主元化为1，主元列其余元素化为0。持续迭代直到目标行无负值。此时可直接从最终表中读取最优解：基变量等于右端项值，非基变量取0。
A two‑stage simplex is needed when artificial variables appear in the initial basis. In Stage 1, minimise the sum of artificial variables; if the minimum is zero, proceed to Stage 2 with the original objective. Always interpret the final tableau in context: state the values of original decision variables and the objective.
若初始基中含人工变量，则需使用两阶段单纯形法。第一阶段最小化人工变量之和；若最小值为零，则进入第二阶段，替换为原目标函数。最终表一定要结合题意解释：给出原决策变量的值和目标函数值。
6. Matching and Allocation Problems | 匹配与分配问题
The Hungarian algorithm is the standard tool for minimising assignment costs on an n×n matrix. Start by subtracting the smallest element in each row from every entry in that row, then do the same for columns. Cover all zeros with the minimum number of lines; if the number of lines equals n, an optimal assignment can be made.
匈牙利算法是求解n×n成本矩阵最小化分配的标准工具。首先每行减去该行最小元素，然后每列进行同样操作。用最少数量的直线覆盖所有零，若直线数等于n，则可得到最优分配。
If lines < n, identify the smallest uncovered element, subtract it from all uncovered elements, and add it to elements covered twice. Repeat the covering and adjustment until an optimal assignment is achieved. Clearly show each transformed matrix and the final assignment list with costs.
若直线数小于n，找出未被覆盖的最小元素，将其从未覆盖元素中减去，并加到被双重覆盖的元素上。重复覆盖与调整直至找到最优分配。清晰展示每一步变换后的矩阵以及最终分配列表与成本。
In some exam questions, you may be asked to find a maximal matching on a bipartite graph. Use the alternating path algorithm, starting from an unmatched vertex and labelling alternating vertices until an augmenting path is found. Record the labelling clearly and update the matching at the end.
部分考题可能要求在二分图上寻找最大匹配。使用交替路径算法，从一个未匹配顶点开始，标记交替顶点，直到找到增广路径。清晰记录标记过程，最后更新匹配。
7. Dynamic Programming Essentials | 动态规划要点
Dynamic programming (DP) appears in contexts like minimising cost or maximising revenue over a series of stages. Define the stages and states, then build a table or recursion where each cell stores the best value from that state to the destination. Work backwards from the final stage.
动态规划（DP）常用于在一系列阶段中最小化成本或最大化收益。先定义阶段和状态，然后建立表格或递推，每个单元格存有从该状态到终点的最优值。从最终阶段开始逆向计算。
For example, a project investment DP might have states representing remaining capital and stages representing years. At each stage‑state pair, compare the immediate reward plus the future optimal value from the next stage. Use arrows or labels to indicate the optimal decisions.
例如，一个项目投资DP可能将剩余资金设为状态，将年份设为阶段。在每个阶段‑状态组合上，比较即时收益加上下一阶段最优值。用箭头或标注指明最优
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply