📚 AS AQA Further Maths Unit 2: January 2022 Exam Report & Revision Guide | AS AQA 进阶数学 Unit 2：2022年1月考试报告与复习指南
The January 2022 series of the AQA AS Further Mathematics Unit 2 paper provided valuable insight into the applied branches of the specification. This report-style revision guide summarises the key themes, common student errors and effective revision strategies based on the typical expectations of this examination. It is designed to help you sharpen your technique and approach the next sitting with confidence.
2022年1月的AQA AS进阶数学Unit 2试卷为我们提供了关于应用数学分支的重要信息。本篇报告式复习指南总结了该考试的主要主题、学生常见错误以及高效复习策略，旨在帮助你打磨答题技巧，以更自信的姿态迎接下一次考试。
1. Overview of Unit 2 and January 2022 Session | Unit 2 概览与2022年1月考试概况
Unit 2 in the AQA AS Further Mathematics specification is the applied paper, typically containing two or three areas of study: discrete mathematics (including algorithms, graph theory, critical path analysis and linear programming) and an optional application such as mechanics or statistics. The January 2022 report highlighted a broad but balanced paper, with a strong emphasis on the practical interpretation of results rather than mere routine calculation.
在AQA AS进阶数学考试大纲中，Unit 2是应用数学试卷，通常包含两到三个学习领域：离散数学（包括算法、图论、关键路径分析和线性规划），以及力学或统计学等可选应用模块。2022年1月的报告强调该试卷范围广泛但分布均衡，重点考察对结果的实用解读，而不仅仅是常规计算。
Candidates who performed well were those who could move between different representations: from a graph to an algorithm, from a linear programming problem to a sketched feasible region, and from a critical path network to a clear schedule. The paper required careful reading and precise use of standard notation.
表现出色的考生能够灵活切换不同的表示形式：从图到算法、从线性规划问题到绘制的可行域、从关键路径网络到清晰的进度表。试卷要求仔细阅读题目并准确使用标准符号。
2. Algorithms and Flow Charts | 算法与流程图
Algorithms were tested in their recursive, iterative and sorting forms. The January 2022 paper included a bubble sort question and a search algorithm trace, requiring candidates to demonstrate each pass clearly. Mark schemes reward unambiguously recorded comparisons and swaps; many candidates lost marks by skipping intermediate lines.
算法部分考查了递归、迭代和排序形式。2022年1月试卷中包含一道冒泡排序题和一道搜索算法追踪题，要求考生清晰展示每一趟的过程。评分标准鼓励明确记录比较和交换步骤；许多考生因为跳过中间行而失分。
For bubble sort, it is essential to show the complete list after every pass, with the final pass written even if no swaps occur. For binary search, state the midpoint chosen and the remaining sublist after each comparison. Do not use shorthand that only you can understand.
对于冒泡排序，必须展示每一趟之后的完整列表，即使最后一趟没有交换也要写出。对于二分搜索，需要说明每次比较后所选择的中点以及剩余子表。不要使用只有你自己能理解的简写。
Always write "pass 1", "pass 2" etc. so that the examiner can follow your process.
务必标注“第1趟”“第2趟”等标记，以便考官能够跟随你的解答过程。
For Dijkstra's algorithm, place permanent labels in squared boxes and temporary labels without boxes; update all temporary labels before confirming any permanent one.
对于迪杰斯特拉算法，永久标记应写入方框，临时标记不加框；在确认任何永久标记之前，更新所有临时标记。
3. Graphs and Networks | 图与网络
Graph theory questions required determining whether a graph was Eulerian, semi-Eulerian or neither, and applying Prim's or Kruskal's algorithm to find minimum spanning trees. A key lesson from the January 2022 report is that many candidates confused an 'edge' with an 'arc' when a graph was directed, leading to incorrect tree constructions.
图论题目要求判断一个图是欧拉图、半欧拉图还是两者皆非，并应用普里姆算法或克鲁斯卡尔算法求最小生成树。2022年1月报告中的一个关键教训是：许多考生在有向图中混淆了“边”和“弧”，导致生成树构造错误。
Remember that Prim's algorithm grows a tree from a starting vertex, adding the cheapest edge that connects the existing tree to a new vertex. Kruskal's algorithm sorts all edges by weight and adds them in order if they do not create a cycle. In a directed graph, you must respect the direction of arcs.
记住普里姆算法是从一个起始顶点生长出一棵树，每次添加连接已有树和新顶点的最便宜边。克鲁斯卡尔算法则按权重对所有边排序，并在不形成环的情况下按顺序添加。在有向图中，必须尊重弧的方向。
When a question asks for a route inspection (Chinese postman), the key is to find all vertices of odd degree, choose the shortest pairing of these vertices, and add those repeated edges. Candidates often only listed odd vertices without computing the pairing cost, losing the final answer.
当题目要求邮递员路线（中国邮递员问题）时，关键是找出所有奇度数顶点，选择这些顶点之间的最短配对，并添加这些重复的边。考生常常只列出奇顶点而不计算配对成本，导致最终答案错误。
4. Critical Path Analysis | 关键路径分析
Critical path analysis appeared in the form of a precedence network. Candidates were asked to calculate earliest start times, latest finish times and total float. The most frequent error was in reading the duration on a 'dummy activity' – a dummy always has duration zero. Misplacing the dummy led to many subsequent mistakes.
关键路径分析以紧前关系网络图的形式出现。考生需要计算最早开始时间、最迟完成时间和总浮动时间。最常见的错误是读取“虚拟活动”上的持续时间——虚拟活动时长始终为零。虚拟活动放置错误导致后续大量失误。
When drawing a Gantt chart for a schedule, be careful about resource constraints. The January 2022 paper included a question requiring the minimum number of workers so that activities complete in the project duration. Many candidates counted overlapping intervals but failed to note that a non-critical activity can be delayed within its float.
在绘制甘特图时，注意资源约束。2022年1月试卷中有一道题要求计算完成整个项目所需的最少工人数。许多考生计算了重叠区间，但未注意到非关键活动可以在其浮动时间内延迟开始。
float, use the formula: total float = latest finish time − earliest start time − duration.
总浮动时间的计算公式为：总浮动时间 = 最迟完成时间 − 最早开始时间 − 持续时间。
Total float = LFT − EST − duration
5. Linear Programming | 线性规划
Linear programming questions typically require formulating constraints from a worded context, sketching the feasible region and evaluating the objective function at vertices. The January 2022 report noted that the most valuable marks were lost through non-integer solutions when an integer answer was required. You must check whether variables must be whole numbers. If so, test integer points around the continuous optimum within the feasible region.
线性规划题目通常需要从实际情境中建立约束条件、绘制可行域并在顶点处评估目标函数。2022年1月报告指出，当要求整数答案时，许多考生因给出非整数解而丢失了有价值分数。你必须检查变量是否必须为整数。如果是，则需要在可行域内连续最优解附近的整数点进行测试。
Always label each constraint line with its inequality, use a clear shading method for the feasible region, and write the objective function as P (or C shading the wrong side of a line; test a point such as (0,0) if it is not on the boundary.
务必用不等式标记每条约束线，用清晰的阴影方式表示可行域，并将目标函数写作 P（或 C）= ...。常见的错误是在线的错误一侧画阴影；若(0,0)不在边界上，可以用它来测试。
In integer programming cases, record your table of integer candidates. For example, if the optimum is at (3.6, 4.2), you need to test (3,4), (3,5), (4,4), (4,5) and perhaps more, subject to the constraints.
在整数规划情况下，记录你的整数候选表。例如，如果最优点在(3.6, 4.2)，你需要测试(3,4)、(3,5)、(4,4)、(4,5)等，且要满足所有约束条件。
6. Mechanics or Statistics Option | 力学或统计学选项
Depending on your centre's chosen option, Unit 2 may include mechanics or statistics. The January 2022 mechanics questions demanded clear vector diagrams and correct sign conventions. Candidates who set up a clear coordinate system and wrote equations of motion in the direction of acceleration scored well. Vague words like 'up' are insufficient; specify positive direction.
根据你所在学校的选项，Unit 2可能包含力学或统计学。2022年1月的力学题要求清晰的矢量图和正确的符号约定。建立了明确坐标系并沿加速度方向写运动方程的考生得分较高。模糊的词如“向上”是不够的；必须明确正方向。
For statistics, the common pitfalls are using the normal distribution without verifying a continuity correction, or forgetting to state the degrees of freedom in a chi-squared test. Always write down the distribution model with parameters before carrying out calculations.
对于统计学，常见陷阱包括在未验证连续性校正的情况下使用正态分布，或在卡方检验中忘记说明自由度。在进行计算之前，务必写出带有参数的分布模型。
Regardless of option, show the formula you are using before substituting numbers. This allows method marks even if your arithmetic is wrong. If an answer is given to a sensible degree of accuracy, state it clearly with units.
无论选择哪个板块，代入数字前都要写出所用公式。这样即使计算错误也能获得方法分。如果答案保留到合理的精度，请清晰写出并附上单位。
7. Notation and Working | 符号与书写规范
The examiner's report for January 2022 repeatedly emphasised that correct notation is not optional. For example, in a recursive algorithm, an+1 = 2an + 3 with a1 = 1 must be stated with the initial condition. Omitting it often made the whole recurrence meaningless.
2022年1月的考官报告反复强调正确符号不是可选的。例如，在递归算法中，必须写出 an+1 = 2an + 3 以及初始条件 a1 = 1。省略初始条件往往使整个递推式失去意义。
Use ≤ and ≥ instead of words when describing inequalities. When giving fractions, do not use a slash unless it is clearly a ratio. In network diagrams, label arcs carefully with their weights and directions. In critical path analysis, distinguish between the earliest start time (EST) and latest finish time (LFT) by writing them in the correct positions on the node.
在描述不等式时使用 ≤ 和 ≥，而不是文字。给出分数时，除非明确表示比例，否则不要使用斜杠。在网络图中，仔细标注每条弧的权重和方向。在关键路径分析中，通过将最早开始时间（EST）和最迟完成时间（LFT）写在节点的正确位置来区分它们。
Keep your working in a logical column style. For simplex-like tableaus or algorithmic traces, one row per step is essential. Use a ruler for graphs and straight lines; a freehand sketch is not acceptable in linear programming.
保持你的解答过程按逻辑分列书写。对于类似单纯形表或算法追踪的过程，每一步一行是必需的。画图和直线要用直尺；在线性规划中，徒手草图是不可接受的。
8. Calculator and Time Management | 计算器与时间管理
In Unit 2, a permitted calculator can be used for statistics, numerical evaluations and some graph operations. However, the January 2022 report noted that candidates who relied on the calculator for simple arithmetic made avoidable precision errors. For example, where a final answer requires a specific degree of accuracy, follow the question's requirement: 3 significant figures or 2 decimal places.
在Unit 2中，允许使用的计算器可用于统计、数值计算以及部分图形操作。然而，2022年1月报告指出，那些依赖计算器进行简单算术的考生出现了可避免的精度错误。例如，当最终答案需要特定精确度时，请遵循题目要求：3位有效数字或2位小数。
Time management is critical. Allocate about 1.5 minutes per mark. If a part of a question is worth 4 marks, spend at most 6 minutes on it. If you are stuck, move on and return later. Many candidates spent too long on the critical path construction, leaving insufficient time for the final linear programming integer check.
时间管理至关重要。大约按每题1.5分钟/分分配时间。如果某小问值4分，最多花6分钟。如果卡住了，先跳过，稍后再回来。许多考生在关键路线构建上花了太长时间，导致没有足够时间进行线性规划的整数检查。
Use your calculator's list and statistical functions efficiently. When finding the mean of grouped data, store the midpoints in a list before multiplying by frequencies. This reduces button-press errors and allows you to revisit values quickly.
高效使用计算器的列表和统计功能。在求分组数据均值时，先存储每组中点值，再与频率相乘。这可以减少按键错误，并允许你快速回顾数值。
9. Lessons from the January 2022 Report | 2022年1月考试报告的启示
The examiner's report from January 2022 offered several detailed lessons that are still relevant today. One major point was that many candidates did not read the command word carefully. Words like 'state', 'write down', 'explain', 'determine' and 'verify' require different responses. 'State' does not require a proof; 'explain' requires a reason in words tied to the context.
2022年1月的考官报告提出了几个至今仍有意义的详细教训。一个重要观点是许多考生没有仔细阅读指令词。像“写出”“直接填写”“解释”“确定”“验证”等词要求不同的回答。“写出”不需要证明；“解释”需要结合情境用文字说明原因。
Another lesson concerned the interpretation of "the minimum number of workers" in resource scheduling. This is a classic optimisation question: you need to schedule activities respecting their ESTs and LSTs, and sometimes a later start actually reduces the peak number of workers needed. Candidates who assumed all activities should start as early as possible lost marks.
另一个教训涉及资源调度中“最少工人数”的解读。这是一个经典优化问题：你需要根据活动的最早开始时间和最迟开始时间进行调度，有时推迟某些活动的开始反而能降低所需工人峰值。假设所有活动都要尽可能早开始的考生失分了。
Finally, the report emphasised that correct units (e.g., hours, workers, costs) are part of the final answer. A correct number without its unit is not a complete answer in the Applied paper.
最后，报告强调正确的单位（如小时、工人、成本）是最终答案的一部分。在应用数学卷中，没有单位的正确数字不是完整答案。
10. A Strategic Revision Plan | 策略性复习计划
Your revision should be built around three layers: knowledge, skill and speed. Knowledge means learning the definitions and formulas, such as the conditions for an Eulerian graph or the formula for total float. Skill means solving structured problems from past papers. Speed means completing timed practice under exam conditions. For Unit 2, past paper practice is indispensable because the mark schemes are precise about notation.
你的复习应围绕三个层次：知识、技能和速度。知识意味着学习定义和公式，例如欧拉图的条件或总浮动时间的公式。技能意味着解决历年真题中的结构化问题。速度意味着在考试条件下进行限时练习。对于Unit 2，历年真题练习必不可少，因为评分标准对符号有精确要求。
Create a one-page formula sheet with all standard algorithms written in your own words. For example, write the steps of Prim's algorithm in bullet points. Review this sheet before starting each practice paper. After marking, use an error log: table columns for question topic, error type and corrected method. This is more effective than simply redoing the whole paper.
制作一张包含所有标准算法且用自己的话编写的单页公式表。例如，用要点写出普里姆算法的步骤。每次开始练习卷之前，先复习这张表。批改后，使用错误日志：表格列为题目主题、错误类型和修正方法。这比简单重做整张试卷更有效。
In the final week before the exam, focus on the 20% of topics that tend to appear in almost every paper: bubble sort, Dijkstra's algorithm, critical path float, linear programming integer solutions, and your chosen option's basic modelling. Nail these to full marks before worrying about obscure edge cases.
考试前最后一周，集中精力在几乎每张试卷都会出现的20%主题上：冒泡排序、迪杰斯特拉算法、关键路径浮动、线性规划整数解，以及你所选选项的基本建模。在担心冷门边界情况之前，先确保这些内容能拿满分。
Finally, after each mock paper, read the official examiner's report. It reveals the exact misunderstandings that cost marks. Underline each warning and convert it into a check item for your next attempt. This closes the loop between practice and performance.
最后，每次模拟考试后，阅读官方考官报告。它揭示了导致失分的确切误解。将每一条警告划出，并转化为你下次尝试时的检查项。这样就形成了练习与表现之间的闭环。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图