📚 Year 12 AQA Computer Science: Exam Techniques and Marking Criteria | AQA 计算机 Year 12：答题技巧与评分标准
Welcome to this comprehensive guide on exam techniques and marking criteria for the AQA Year 12 Computer Science course. Mastering the content is only half the battle; understanding how to present your answers to maximise marks is crucial for success. This article will walk you through the structure of the exam papers, the meaning of command words, the specific requirements for programming and theory questions, and how examiners allocate marks. By internalising these techniques, you can avoid common pitfalls and demonstrate your knowledge effectively.
欢迎阅读这份针对 AQA Year 12 计算机科学课程的答题技巧与评分标准综合指南。掌握学科内容仅成功了一半；懂得如何呈现答案以获取最高分数至关重要。本文将带你了解试卷结构、指令词的含义、编程与理论题的具体要求，以及考官如何分配分数。通过内化这些技巧，你可以避开常见陷阱，并有效展示自己的知识。
1. Understanding the Exam Structure and Assessment Objectives | 理解考试结构与评估目标
The AQA AS Computer Science qualification consists of two papers: Paper 1 (on-screen programming) and Paper 2 (written theory). Paper 1 focuses on practical programming, problem-solving, and algorithm design, while Paper 2 tests your understanding of computer systems, data representation, networking, databases, and the social and legal aspects of computing. The assessment objectives (AOs) underpin every question: AO1 requires recall of knowledge, AO2 demands application, and AO3 expects analysis and evaluation. Recognising which AO is being targeted can help you tailor your response; for example, a question asking you to "evaluate" calls for a balanced argument, not just a description.
AQA AS 计算机科学资格由两份试卷构成：Paper 1（上机编程题）和 Paper 2（书面理论题）。Paper 1 侧重于实际编程、问题求解和算法设计，而 Paper 2 测试你对计算机系统、数据表示、网络、数据库，以及计算机的社会与法律方面的理解。每道题背后都有评估目标（AO）：AO1 要求回忆知识，AO2 要求应用，AO3 期望分析与评价。识别试题所考察的 AO 能帮助你调整答题方式，例如，要求你“评价”的题目需要你给出一个平衡的论证，而不仅仅是描述。
Both papers contain a mix of short-answer and extended-response questions, with Paper 1 requiring you to write, test, and refine actual code. In contrast, Paper 2 often includes essays or structured comparisons on abstract topics like the ethical impacts of artificial intelligence. Understanding the structure allows you to practise with a targeted approach, such as timing yourself for programming tasks and learning to develop a coherent line of argument for evaluation questions.
两份试卷都包含简答题和扩展回答题，其中 Paper 1 要求你编写、测试并完善实际代码。相比之下，Paper 2 经常包含关于人工智能的伦理影响等抽象主题的论文或结构化比较。理解试卷结构能让你有针对性地练习，例如对编程任务进行计时，并学习如何为评价性问题构建连贯的论证线索。
2. The Importance of Command Words | 指令词的重要性
Command words such as "state", "describe", "explain", "compare", and "evaluate" precisely define the depth and style of answer expected. "State" requires a concise, factual answer, often a single word or phrase. "Describe" asks you to give an account of something without necessarily explaining why. "Explain" requires you to link causes and effects, providing reasons. "Compare" expects similarities and differences, while "evaluate" demands a judgement backed by evidence, considering pros and cons. Underestimating these words can cost you marks because you might provide a superficial answer when a detailed explanation is needed.
指令词，例如“陈述”(state)、“描述”(describe)、“解释”(explain)、“比较”(compare)和“评价”(evaluate)，精确地定义了所期待答案的深度和形式。“陈述”要求给出简洁、事实性的答案，通常是一个词或短语。“描述”要求你对某事物进行说明，而不一定解释原因。“解释”需要你连接因果关系，提供理由。“比较”期望你指出相同点和不同点，而“评价”则要求你做出有证据支撑的判断，并权衡利弊。低估这些词的意思可能会让你丢分，因为你可能在需要详细解释时只给出了一个肤浅的回答。
To help you internalise these terms, the table below summarises the most common AQA command words alongside their meanings and typical response lengths. Referring to this during revision will train you to answer exactly what is asked.
为了帮助你内化这些术语，下表总结了 AQA 考试中最常见的指令词及其含义和典型回答长度。在复习过程中参考此表将训练你准确回答题目所问。
| Command Word 指令词 | Meaning 含义 | Expected Response 期待回答 |
|---|---|---|
| State / 陈述 | Give a fact or definition | Short phrase or single sentence |
| Describe / 描述 | Provide characteristics or a detailed account | Several sentences without explaining 'why' |
| Explain / 解释 | Give reasons; show causes and effects | Linked sentences that clarify a process |
| Compare / 比较 | Identify similarities and differences | Balanced points, often with 'whereas' |
| Evaluate / 评价 | Make a judgement after weighing evidence | Argument with pros, cons, and a conclusion |
3. Programming Questions: On-screen and Paper Techniques | 编程题：机上与笔试技巧
Programming questions in Paper 1 are completed in a controlled on-screen environment, but the skills required are the same as those you would use for any assessed code: readability, correctness, and efficiency. Always use meaningful variable names and consistent indentation; these not only help you debug but also impress the examiner when hand-tracing is required. Check boundary conditions, validate inputs, and comment on non-obvious logic. AQA mark schemes reward correct use of selection (if-else), iteration (for/while), and data structures, often allocating one mark per correct feature.
Paper 1 的编程题在受控的上机环境中完成，但所需的技能与任何评估性代码相同：可读性、正确性和效率。始终使用有意义的变量名和一致的缩进；这不仅有助于调试，还能在手写追踪时给考官留下好印象。检查边界条件，验证输入，并注释非显而易见逻辑。AQA 标记方案奖励正确使用选择结构（if-else）、循环（for/while）和数据结构，通常为每个正确的特性分配一分。
When you encounter hand-written code tasks in Paper 2, write pseudo-code clearly, following the style of the AQA pseudo-code guide. Use keywords like WHILE...ENDWHILE and IF...THEN...ELSE...ENDIF, and be explicit about type conversions. A common mistake is to leave variables uninitialised; always show SET total TO 0 before a loop. Even if your logic is slightly flawed, accurate syntax and logical structure will gain several marks.
当你在 Paper 2 中遇到手写代码任务时，清晰地写出伪代码，遵循 AQA 伪代码指南的风格。使用 WHILE...ENDWHILE 和 IF...THEN...ELSE...ENDIF 等关键词，并明确说明类型转换。一个常见错误是变量未初始化；始终在循环前显示 SET total TO 0。即使你的逻辑略有瑕疵，准确的语法和逻辑结构也能获得几分。
Remember that examiners apply "own figure rule" (OFR) liberally, meaning if you make an error early but follow a correct method thereafter, you can still be awarded method marks. Never leave a programming question blank—a partial attempt can often secure a significant portion of the available marks.
请记住，考官会宽松地应用“自有数值规则”（own figure rule），也就是说，如果你早期出错但此后遵循正确的方法，你仍然可以获得方法分。绝不要留空编程题——部分作答往往能拿下该题的可观分数。
4. Algorithm Representation and Pseudocode | 算法表示与伪代码
For algorithm questions, clarity is king. Whether you are tracing an algorithm or writing one from scratch, use a structured layout with indentation. In trace tables, list all variables in the order they are modified and show each step explicitly; partial marks are awarded for any correct row. If asked to design an algorithm, begin with a brief structured English outline before converting it into pseudo-code. This shows logical progression, and even if the final code contains minor syntactic errors, the underlying idea can still be credited.
对于算法题，清晰最为重要。无论你是追踪算法还是从零开始编写，都要使用带有缩进的结构化布局。在追踪表中，按变量被修改的顺序列出所有变量，并明确展示每个步骤；任何正确的行都能获得部分分数。如果被要求设计算法，先用结构化的自然语言列出简要大纲，再转换为伪代码。这展示了逻辑递进过程，即便最终代码包含轻微语法错误，其底层思路仍可获得认可。
Avoid ambiguous constructs like "add one" without specifying what to add one to. Use explicit assignments: x ← x + 1 or x = x + 1. For searching and sorting algorithms, know the classic patterns for linear search, binary search, bubble sort and insertion sort. In an exam, you may be asked to state the worst-case time complexity using Big-O notation such as O(n) or O(n²). Always express complexity in terms of n, the size of the data set.
避免模棱两可的写法，比如不指明对象就写“加一”。应使用明确的赋值：x ← x + 1 或 x = x + 1。对于搜索和排序算法，请熟悉线性搜索、二分搜索、冒泡排序和插入排序的经典模式。考试中，你可能被要求用大O符号表达最坏情况时间复杂度，例如 O(n) 或 O(n²)。始终以 n（数据集大小）来表达复杂度。
Example pseudo-code snippet for a linear search (AQA style):
线性搜索的伪代码示例（AQA 风格）：
OUTPUT "Enter item to find"
INPUT target
found ← FALSE
i ← 0
WHILE i < LEN(list) AND found = FALSE
IF list[i] = target THEN
found ← TRUE
OUTPUT "Found at index ", i
ELSE
i ← i + 1
ENDIF
ENDWHILE
IF found = FALSE THEN
OUTPUT "Not in list"
ENDIF
5. Explaining and Justifying in Theory Questions | 理论题中的解释与论证
In theory questions, simply stating a fact is seldom enough; you need to provide a clear, step-by-step explanation or a justified argument. For example, when asked "Explain how virtual memory enables a computer to run more applications", you should mention the role of secondary storage, pages, and the memory management unit, and link them in a causal chain: "When RAM is full, the OS moves less frequently used pages to secondary storage, freeing space for new pages; when those pages are needed again, they are swapped back in." This demonstrates deep understanding and hits multiple mark points.
在理论题中，仅仅陈述事实往往不够；你需要提供清晰的、按步骤的解释或合理的论证。例如，当被问到“解释虚拟内存如何使计算机运行更多的应用程序”时，你应该提及二级存储器、页面和内存管理单元的作用，并用因果链条将它们连接起来：“当 RAM 满时，操作系统将不常用的页面移到二级存储器，释放空间容纳新页面；当再次需要这些页面时，它们会被交换回来。”这展示了深刻理解，并能命中多个得分点。
Use technical vocabulary precisely: distinguish between "cache" and "RAM", "interrupt" and "polling", "protocol" and "layer". When comparing, use comparative phrases such as "faster but more expensive" for static RAM vs. dynamic RAM. In evaluation questions, plan a balanced response: present at least two arguments for and two against, then reach a final judgement. Linking your conclusion to a specific context (e.g., a school network vs. a bank's server) shows the sophistication expected for AO3 marks.
精准使用技术词汇：区分“高速缓存”与“RAM”、“中断”与“轮询”、“协议”与“层”。进行比较时，使用比较性短语，例如在比较静态 RAM 与动态 RAM 时说“更快但更昂贵”。在评价性问题中，计划一个平衡的回答：提出至少两个支持观点和两个反对观点，然后得出最终判断。将你的结论与特定场景联系起来（如学校网络与银行服务器），这展示了 AO3 所期望的深度。
6. Data Representation and Binary Arithmetic | 数据处理与二进制算术
ng point, and image/sound encoding are heavily tested in Paper 2. Always show your working— 0₂ to denary, write out the place values: (1×2⁷)+(1×2⁶)+(0×2⁵)+(1×2⁴)+(0×2³)+(1×2²)+(1×2¹)+(0×2⁰), then calculate to 128+64+0+16+0+4+2+0 = 214₁₀. If you mis-add but show the expansion, you still gain marks.
Paper 2 大量考查数据表示主题，如二进制、十六进制、浮点数以及图像与声音编码。始终写出你的计算过程——标记方案通常为正确的中间步骤给一分，即使最终答案错误。例如，将 11010110₂ 转换为十进制时，写出位值：(1×2⁷)+(1×2⁶)+(0×2⁵)+(1×2⁴)+(0×2³)+(1×2²)+(1×2¹)+(0×2⁰)，然后计算出 128+64+0+16+0+4+2+0 = 214₁₀。如果你加错了，但展示了展开式，你仍然能得分。
For two' que: flip all bits and add 1. Use the subscript notation: 00110110₂ (positive 54), its two' u carry over correctly but miscalculate a single bit sum, you may only lose one mark. For floating point, practise separating the mantissa and exponent and applying the formula: value = mantissa × 2ᵉˣᵖᵒⁿᵉⁿᵗ. Use the AQA preferred representation even if others exist.
对于二进制补码，始终说明位数并应用取反加一法。使用下标标记：00110110₂（正 54），其补码负数为 11001010₂。对于二进制加法，清晰地写出进位，标记 C₁、C₂ 等。错误只会被扣一次分，因此如果你进位正确但某一位求和算错，可能仅丢一分。对于浮点数，练习将尾数和指数分开，并应用公式：值 = 尾数 × 2指数。即使存在其他表示法，也请使用 AQA 偏好的表示法。
7. Scoring Points in Hardware and Architecture Questions | 硬件与体系结构题的得分要领
Questions about the processor and its components reward precise naming and sequencing. In the fetch-decode-execute (FDE) cycle, you must mention the specific registers—Program Counter (PC), Memory Address Register (MAR), Memory Data Register (MDR), and Current Instruction Register (CIR)—and describe the flow of data across buses. A model answer for the fetch step: "The address in the PC is copied to the MAR via the address bus. The control unit sends a read signal to memory, and the instruction is placed on the data bus and stored in the MDR, then transferred to the CIR. The PC is
Published by TutorHao | Year 12 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图