📚 A-Level AQA Computer Science: Exam Preparation Timeline | A-Level AQA 计算机科学：备考时间规划
Crafting a structured revision schedule is the foundation of success in A-Level AQA Computer Science. This guide breaks down the preparation journey into manageable stages, integrating theory, programming, and exam technique from the very first week of the course right through to the final paper.
制定结构化的复习计划是在 A-Level AQA 计算机科学中取得成功的基础。本指南将备考过程分解为可操作的阶段，从课程的第一周一直到最终考试，全面融合理论学习、编程练习与应试技巧。
1. Understanding the Exam Structure & Syllabus | 理解考试结构与教学大纲
Begin by downloading the latest AQA A-level Computer Science specification (7516/7517) and the mark schemes for both Paper 1 and Paper 2. Identify exactly which topics appear on each paper: Paper 1 focuses on programming, data structures, algorithms, and computational thinking; Paper 2 covers computer systems, networking, databases, big data, and the consequences of computing.
首先下载最新的 AQA A-level 计算机科学教学大纲（7516/7517）以及 Paper 1 和 Paper 2 的评分方案。准确识别每份试卷涵盖的主题：Paper 1 侧重于编程、数据结构、算法和计算思维；Paper 2 涵盖计算机系统、网络、数据库、大数据以及计算机的影响。
Also map out your Non-Exam Assessment (NEA) requirements. Knowing the weightings — Paper 1 (40%), Paper 2 (40%), NEA (20%) — helps you allocate effort accordingly. Time spent on the programming project should be integrated early, not left until the final term.
同时梳理非考试评估（NEA）的要求。了解各部分的权重——Paper 1（40%）、Paper 2（40%）、NEA（20%）——有助于你合理分配精力。编程项目的时间应尽早融入计划，不要拖到最后一个学期。
2. Setting Goals & Baseline Assessment | 设定目标与基准评估
Take a diagnostic test on past paper questions from both units. Mark it honestly to identify your current weak spots. This baseline will inform your weekly time allocation. Be specific: for example, if you score low on tree traversal algorithms or Boolean logic simplification, schedule extra practice sessions for those strands.
用历年真题中的问题做一次诊断性测试。诚实评分，找出当前的薄弱环节。这个基准将为每周的时间分配提供依据。要具体：例如，如果你在树遍历算法或布尔逻辑化简上得分较低，就要为这些方面安排额外的练习。
Set realistic grade targets and break them into skill-based goals, such as 'write a recursive binary search without errors by mid-October' or 'draw and label all CPU components from memory within two minutes'. This approach keeps motivation high and progress measurable.
设定现实的分数目标，并将其分解为基于技能的目标，例如“到十月中旬能无误地编写递归二分查找”或“在两分钟内凭记忆画出并标注所有 CPU 组件”。这种方法能保持高水平的动力，并使进步可衡量。
3. Creating a Master Timeline | 制定总体时间表
Divide the academic year into three macro phases: Foundation (September-December), where you cover syllabus content systematically alongside your class teaching; Consolidation (January-March), dedicated to intensive practice and NEA refinement; and Final Revision (April-May), focused on past papers and high-frequency exam topics.
将一学年划分为三个宏观阶段：基础阶段（9 月-12 月），配合课堂教学系统覆盖大纲内容；巩固阶段（1 月-3 月），专门进行强化练习和完善 NEA；最后冲刺阶段（4 月-5 月），专注于历年真题和高频考点。
Use a digital or paper planner to block out fixed commitments, then assign at least 4-6 hours per week to independent study. Within each week, alternate between theory review and hands-on programming. Reserve weekends for longer NEA coding sessions or timed past papers.
使用电子或纸质计划本，标出固定事项，然后每周至少安排 4-6 小时的自主学习时间。每周内交替进行理论复习和动手编程。把周末留给较长的 NEA 编码环节或限时真题训练。
4. Theory Learning & Note-Making Strategies | 理论学习与笔记方法
Active note-making beats passive reading. Convert each syllabus bullet point into a condensed summary sheet. For topics like the fetch-decode-execute cycle, create flowcharts; for network protocols and TCP/IP stack layers, build comparison tables. Store everything in a single revision folder.
主动做笔记胜过被动阅读。将大纲中的每个要点转化为浓缩的摘要页。对于取指-解码-执行周期等主题，创建流程图；对于网络协议和 TCP/IP 协议栈层次，制作比较表格。把所有资料集中存放在一个复习文件夹内。
Use the Cornell method: key terms in the left margin, main notes in the centre, and a summary at the bottom. This format works exceptionally well for memorising definitions like 'serial vs parallel transmission', 'client-server vs peer-to-peer', and 'normalisation of floating point numbers'.
使用康奈尔笔记法：左侧栏记关键词，中间栏为主要笔记，底部写摘要。这种格式对于记忆“串行与并行传输”、“客户端-服务器与对等网络”、“浮点数规格化”等定义特别有效。
5. Programming Practice & the NEA Project | 编程实践与 NEA 项目
The NEA requires you to design, code, test, and evaluate a solution to a real problem. Start early — choose your project by October and submit a comprehensive analysis by November. Keep a development log that records every design decision, test case, and modification; this documentation counts towards the final mark.
NEA 要求你为一个真实问题设计、编码、测试和评估一个解决方案。尽早开始——在十月份前选定项目主题，十一月份前提交详尽的分析报告。保存一份开发日志，记录每一个设计决策、测试用例和修改；这些文档都将计入最终成绩。
For general programming skill, practice writing code on paper as well as on screen. AQA Paper 1 requires you to hand-write Python, VB.NET, or C# code. Drill common algorithms: linear search, bubble sort, insertion sort, merge sort, Dijkstra’s shortest path, and tree traversals both recursively and iteratively.
在一般编程技能方面，既要练习在屏幕上写代码，也要练习在纸上写代码。AQA Paper 1 要求你手写 Python、VB.NET 或 C# 代码。反复练习常见算法：线性搜索、冒泡排序、插入排序、归并排序、Dijkstra 最短路径以及递归和迭代形式的树遍历。
- Write a function to reverse a linked list without using extra memory.
- 编写一个不使用额外内存的反转链表函数。
- Implement a stack using an array and handle overflow/underflow with meaningful error messages.
- 用数组实现一个栈，并用有意义的错误信息处理溢出和下溢。
6. Algorithm & Data Structure Deep Dive | 算法与数据结构的专项训练
Create a dedicated algorithm workbook. For each algorithm, document its pseudocode, time complexity in Big-O notation (O(1), O(log n), O(n), O(n log n), O(n²)), and a step-by-step trace of a small example. This workbook becomes invaluable during last-minute revision.
创建一个专门的算法练习本。对每种算法，记录其伪代码、大 O 表示法的时间复杂度（O(1)、O(log n)、O(n)、O(n log n)、O(n²)），并逐步追踪一个小示例的执行过程。这个练习本在最后复习时非常有价值。
Pay special attention to recursion mechanics, stack frame visualisation, and comparing iterative vs recursive efficiency. Practice questions that ask you to complete a tracing table for a recursive routine — these are frequent in Paper 1 and carry high marks.
特别关注递归机制、栈帧可视化，以及迭代与递归效率的比较。练习那些要求你为递归例程完成追踪表的题目——这些在 Paper 1 中频繁出现且分值很高。
For data structures, draw and label static vs dynamic implementations of stacks, queues, trees, graphs (adjacency matrix vs adjacency list), and hash tables with collision resolution strategies like linear probing and chaining.
对于数据结构，画出并标注栈、队列、树、图（邻接矩阵与邻接表）以及带有线性探测和链式地址等冲突解决策略的哈希表的静态与动态实现。
7. Regular Testing & Error Log | 定期测试与错题日志
Integrate a weekly 30-minute quiz that mixes old and new content. Write your own questions based on command words: 'State', 'Describe', 'Explain', 'Compare', 'Evaluate'. Self-testing reinforces long-term memory far better than re-reading.
每周安排一次 30 分钟的测验，混合旧知识和新内容。根据指令词自己设计问题：“陈述”、“描述”、“解释”、“比较”、“评估”。自我测试比反复阅读更能巩固长期记忆。
Maintain an error log divided by topic. Whenever you lose marks on a past paper question, record the sub-topic, the exact mistake, and the correct approach. Review this log every fortnight to prevent repeated errors, especially on subtle points like the difference between lossy and lossless compression or the role of the accumulator in the Von Neumann architecture.
维护一个按主题分类的错题日志。每当在真题练习中失分，就记录子主题、具体错误和正确方法。每两周复习一次这个日志，避免重复犯错，尤其是有损压缩与无损压缩的区别，或冯·诺依曼架构中累加器的作用等细微之处。
8. Past Paper Practice & Time Management | 真题演练与时间管理
Starting at least three months before the exams, allocate one full timed paper per week. Early on, you may complete a paper in two sittings to master question types. Closer to the exams, simulate real conditions: 2 hours 30 minutes uninterrupted, with no notes and only the permitted materials.
至少在考试前三个月开始，每周完成一套完整的限时真题。初期可以分两次完成一套题，以熟悉题型。临近考试时，要模拟真实考试环境：连续作答 2 小时 30 分钟，不借助笔记，只能使用允许的材料。
Develop a strict per-mark timing strategy. Paper 1 has approximately 100 marks in 150 minutes, giving about 1.5 minutes per mark. A 9-mark programming question should take no more than 13-14 minutes. Practice leaving the last 10 minutes for checking skeleton code and tracing.
制定严格的分值时间策略。Paper 1 约 100 分，时长 150 分钟，每分大约 1.5 分钟。一道 9 分的编程题不应超过 13-14 分钟。练习留出最后 10 分钟检查框架代码和追踪结果。
| Section | 建议时间分配 |
|---|---|
| Paper 1 (100 marks) | ~2h 10min writing + 20min review |
| Paper 2 (100 marks) | similar allocation, with more time on extended writing |
9. Final Intensive Review & Mock Exams | 考前冲刺与模拟考试
In the final six weeks, switch to topic-based revision using a 'high priority' matrix. List every examinable topic and rate it by your confidence level and its past paper frequency. Dedicate more hours to low-confidence, high-frequency topics like object-oriented inheritance, SQL queries, and finite state machines.
在最后六周，采用“高优先级”矩阵进行专题复习。列出每一个可考主题，根据你的自信心和历年真题频率进行评级。将更多时间投入自信心低、高频出现的主题，如面向对象的继承、SQL 查询和有限状态机。
Arrange at least two full mock exams under timed conditions with no interruptions. Mark them using the official mark scheme, paying attention to the specific phrasing AQA expects. For example, 'describe how a packet travels across a network' requires reference to MAC addresses, default gateways, and routing tables — not just a generic overview.
至少安排两次完整的模拟考试，限时且不受干扰。使用官方评分方案进行批改，注意 AQA 期望的具体措辞。例如，“描述数据包如何在网络中传输”需要提到 MAC 地址、默认网关和路由表——而不仅仅是泛泛的描述。
10. Mental Wellbeing & Healthy Routines | 心理调适与健康习惯
Burnout is a real risk in the intense final weeks. Schedule at least one full day per week without any computer science study. During study hours, use the Pomodoro technique: 25 minutes focused work, 5 minutes break, with a longer pause after four cycles.
在紧张的最后几周里，倦怠是真实的风险。每周至少安排一整天完全不接触计算机科学的学习。在学习时段内使用番茄工作法：专注工作 25 分钟，休息 5 分钟，四个循环后休息更长时间。
Physical exercise improves cognitive function and memory retention. A 20-minute walk or light jog can reset your concentration. Avoid screen-based relaxation (social media, videos) during breaks; instead, stretch, hydrate, or close your eyes for a brief sensory rest.
体育锻炼能改善认知功能和记忆力。20 分钟的散步或慢跑可以重振注意力。休息期间避免屏幕放松（社交媒体、视频）；取而代之地，做拉伸运动、补充水分或闭上眼睛进行短暂的感官休息。
11. The Final Week Before the Exam | 考前最后一周
Shift your focus to summary review and low-stress consolidation. Avoid learning new content; instead, reread your error log, condensed summary sheets, and algorithm workbook. Speak key explanations aloud, as if teaching someone else — this self-explanation technique cements understanding of complex processes like the TCP handshake.
将重心转向概要复习和低压力巩固。避免学习新内容；而是重读错题日志、浓缩摘要页和算法练习本。大声复述关键解释，仿佛在教别人——这种自我解释技巧能巩固对 TCP 握手等复杂过程的理解。
Prepare your exam-day kit: clear pencil case, multiple black pens, a ruler (for circuit diagrams), and a wristwatch (non-smart). Check AQA’s permitted programming language reference sheet and ensure you have memorised basic syntax. Lay out your clothes and a nutritious, non-heavy breakfast plan.
准备好考试当天所需物品：透明铅笔盒、多支黑色签字笔、一把尺子（用于绘制电路图）和一块手表（非智能型）。检查 AQA 允许的编程语言参考表，确认已记住基本语法。准备好衣物和一份营养丰富又不过于油腻的早餐计划。
12. Exam Day Strategy | 考试当天策略
Arrive at the exam hall at least 20 minutes early. During the reading time (if provided), scan the entire paper to gauge question types and identify low-hanging fruit — short answer questions you can answer instantly. Start with these to build confidence and secure early marks.
提前至少 20 分钟到达考场。在阅读时间内（如有提供），浏览整份试卷，判断题型，并识别容易得分的题目——可以立刻作答的简答题。从这些题入手，建立信心，确保拿下基础分。
For programming questions, write clear pseudocode first in the margin before committing to final code. Use plenty of comments; AQA rewards readability. In extended writing for Paper 2, structure your answer with distinct paragraphs that mirror the bullet points of the question. If you feel stuck, mark the question and move on — never sacrifice later marks for a single stubborn question.
对于编程题，先在草稿栏中写出清晰的伪代码，再转化为最终代码。使用充足的注释；AQA 鼓励可读性。在 Paper 2 的延申写作中，用清晰的段落结构对应问题的分点。如果卡住，标记该题然后继续——绝不为了一道题而牺牲后面的分数。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图