📚 Year 12 WJEC Computer Science: Mastering Past Papers | WJEC计算机历年真题深度解析
Working through past papers is the single most effective revision strategy for Year 12 WJEC Computer Science. It reveals the examiner's expectations, common question patterns, and the precise depth of knowledge required for each topic. This article provides a structured analysis of typical past‑paper questions from both Unit 1 (Fundamentals of Computer Science) and Unit 2 (Practical Programming), along with model approaches, mark‑scheme insights, and practical tips to boost your grade.
做历年真题是复习 WJEC 计算机科学 Year 12 最有效的策略。它直接揭示出题人的意图、常见的题型模式以及每个知识点所需的深度。这篇文章将对 Unit 1（计算机科学基础）和 Unit 2（实用编程）的典型历年真题进行结构化分析，提供解题思路、评分标准解读和实用的提分技巧。
1. Why Past Papers Are the Key to Success | 历年真题为何是成功的关键
WJEC examiners often reuse question styles, especially for core topics like logic gates, trace tables, and data representation. By analysing five or more years of papers, you will start to recognise predictable phrasing such as "State two advantages of...", "Explain the role of the... in the fetch‑decode‑execute cycle", or "Complete the trace table for the following algorithm". Familiarity with these patterns reduces anxiety and saves time in the exam.
WJEC 考官经常重复使用相似的题型，尤其是逻辑门、追踪表和数字表示等核心主题。分析五年以上的真题后，你会识别出可预测的提问方式，比如"写出……的两个优点""解释……在取指‑解码‑执行周期中的作用"或"完成以下算法的追踪表"。熟悉这些模式能减少焦虑，在考场上节省时间。
Moreover, past papers train you to read questions with examiner eyes. You learn to identify the command words (describe, explain, compare) and the marks available per sub‑question. For instance, an "explain" instruction usually demands a cause‑and‑effect sentence, not just a definition. Reviewing official mark schemes will teach you exactly how many points to make for 1, 2, or 3 marks.
此外，真题训练你以考官视角读题。你会学会识别指令词（描述、解释、比较）以及每个小问的分数。例如，"解释"通常要求写出因果关系，而不仅仅是下定义。回顾官方评分标准能让你准确知道 1 分、2 分或 3 分需要写出多少个要点。
2. Understanding the Year 12 WJEC Specification | 了解 WJEC Year 12 考纲
WJEC AS Computer Science consists of two units. Unit 1: Fundamentals of Computer Science is a 2‑hour written paper worth 62.5 % of the AS qualification. It covers computer architecture, data representation, logic, networking, and ethical issues. Unit 2: Practical Programming to Solve Problems is a 2‑hour on‑screen exam worth 37.5 %, requiring you to write, test, and debug code in a high‑level language (typically Python or VB.NET) using an IDE provided by your centre.
WJEC AS 计算机科学包含两个单元。Unit 1《计算机科学基础》为 2 小时笔试，占 AS 总成绩的 62.5 %，涵盖计算机体系结构、数据表示、逻辑、网络和伦理问题。Unit 2《通过编程解决问题》为 2 小时机考，占 37.5 %，要求你在考场提供的 IDE 中用高级语言（通常是 Python 或 VB.NET）编写、测试和调试代码。
Past papers reflect this split precisely. In Unit 1, you will always find a logic circuit question, a data‑conversion question (binary, hexadecimal, two’s complement), and a section on the fetch‑decode‑execute cycle. Unit 2 papers usually present an incomplete program or algorithm description, followed by coding challenges that test your ability to work with arrays, files, validation, and subroutines.
真题完全体现了这种划分。在 Unit 1 中，总能找到逻辑电路题、数据转换题（二进制、十六进制、补码）以及有关取指‑解码‑执行周期的段落。Unit 2 的真题通常给出不完整的程序或算法描述，然后要求你解决涉及数组、文件、验证和子程序的编码挑战。
3. Common Question Types in Unit 1 | Unit 1 常见题型分析
Unit 1 questions fall into three broad categories: short‑answer recall, structured explanation, and application. Recall questions test definitions, such as "What is meant by a volatile storage device?" or "State two features of the von Neumann architecture." For these, precise terminology and a direct answer are vital.
Unit 1 的题目大致分为三类：简答回忆题、结构化解释题和应用题。回忆题考查定义，比如"什么是易失性存储设备？"或"写出冯·诺依曼架构的两个特征"。对这些题目，准确的术语和直接的答案是关键。
Explanation questions typically ask you to describe a process, e.g. "Explain the steps in the fetch phase." Here you must present a logical sequence using technical vocabulary, such as "the Program Counter (PC) contains the address of the next instruction; this address is copied to the Memory Address Register (MAR) via the address bus..." Each step that matches the mark scheme gains a mark.
解释题通常要求描述一个过程，例如"解释取指阶段的步骤"。这时你需要用专业词汇呈现一个逻辑序列，比如"程序计数器 (PC) 存放着下一条指令的地址；该地址通过地址总线被复制到内存地址寄存器 (MAR)……"。与评分标准匹配的每个步骤都会得分。
Application questions give you a scenario and ask you to apply knowledge: "Convert the denary number −27 into 8‑bit two’s complement." These require working out the positive binary, flipping bits, and adding 1. Showing your working is essential because the mark scheme awards method marks even if a small arithmetic error occurs later.
应用题给出一段场景并要求运用知识："将十进制数 −27 转换为 8 位补码"。这需要写出正数的二进制、翻转各位再加 1。展示运算过程至关重要，因为评分标准会给予方法分，即使后续出现计算小错。
4. Tackling Data Representation Questions | 数据表示题解析
Data representation appears in every WJEC Unit 1 paper. You must be fluent in converting between binary, denary, and hexadecimal, and comfortable with two’s complement for negative numbers. A typical 6‑mark question might read: "The binary number 1101 0110 is stored in two registers. Interpret it as (i) an unsigned integer, (ii) a signed integer using two’s complement, and (iii) hexadecimal."
数据表示是每份 WJEC Unit 1 试卷的必考题。你必须熟练地在二进制、十进制和十六进制之间转换，并能用补码表示负数。一道典型的 6 分题可能是："二进制数 1101 0110 存放在两个寄存器中。将其解释为 (i) 无符号整数，(ii) 采用补码的有符号整数，以及 (iii) 十六进制。"
gnificant bit is 1, indicating a negative number. Find its magnitude: flip all bits → 0010 1001, add 1 → 0010 → D6. Always check your conversions against the mark scheme’s allowance for method marks.
解题思路：无符号情况，直接计算 1×2⁷ + 1×2⁶ + 0×2⁵ + 1×2⁴ + 0×2³ + 1×2² + 1×2¹ + 0×2⁰ = 214。有符号补码时，最高位为 1 表示负数。求其大小：翻转所有位 → 0010 1001，加 1 → 0010 1010 = 42，因此值为 −42。十六进制则将位分组为半字节：1101 为 D，0110 为 6 → D6。始终核对你的转换是否符合评分标准中方法分的要求。
Another common challenge involves floating point representation. WJEC may ask you to normalise a binary number or identify the mantissa and exponent in a given format. Remember the mantissa is usually a fixed‑point fraction, and normalisation means the first two bits after the sign bit differ. Practicing with a range of positive and negative values will build confidence.
另一个常见挑战是浮点表示。WJEC 可能要求你将一个二进制数规格化，或在给定格式中识别尾数和指数。记住尾数通常是一个定点小数，规格化意味着符号位之后的头两个位不同。反复练习正负数值，能树立信心。
5. Computer Architecture and the Fetch‑Decode‑Execute Cycle | 计算机体系结构与取指‑解码‑执行周期
A reliable 8‑to‑10‑mark question in Unit 1 requires you to describe the fetch‑decode‑execute cycle in detail, often with reference to specific registers (PC, MAR, MDR, CIR, ACC). The examiner wants a running narrative, not a bullet list of acronyms. Link each step to the buses and control signals.
Unit 1 中总有一道可靠的高分题（8–10 分），要求你详细描述取指‑解码‑执行周期，通常引用特定寄存器（PC、MAR、MDR、CIR、ACC）。考官想要的是连贯的叙述，而不是一份缩略语的要点清单。要将每一步与总线和控制信号联系起来。
For example: "In the fetch phase, the address in the PC is placed on the address bus, and the control unit issues a read signal. The MAR receives this address, and the content of that memory location is fetched into the MDR. Simultaneously, the PC is incremented. The instruction in the MDR is then copied to the CIR for decoding." This level of detail picks up all the available marks.
例如："在取指阶段，PC 中的地址被放到地址总线上，控制单元发出读信号。MAR 接收该地址，内存中该位置的内容被取到 MDR。同时，PC 递增。然后 MDR 中的指令被复制到 CIR 进行解码。" 这样的细节能拿到所有可得的分数。
You may also be asked to explain how the cycle differs for an immediate instruction versus a direct address instruction, or how an interrupt can alter the cycle. In such cases, show awareness that the PC may need to be saved to a stack before the interrupt service routine is called.
你还可能被问到，立即数指令与直接寻址指令的周期有何不同，或中断如何改变周期。这种情况下，要表现出你知道在调用中断服务程序前，PC 可能需要被保存到堆栈中。
6. Logic Gates and Boolean Algebra | 逻辑门与布尔代数
rcuit from a Boolean expression, or derive an expression from a given circuit. A typical 4‑mark task: "Complete the truth table for Q = (A AND B) OR (NOT C)."
逻辑题是 WJEC Unit 1 中的必考题。要么要求你填写真值表，要么根据布尔表达式画出逻辑电路，要么从给定电路中推导表达式。一个典型的 4 分任务是："完成 Q = (A AND B) OR (NOT C) 的真值表"。
| A | B | C | (A ∧ B) ∨ ¬C |
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 |
When simplifying Boolean expressions, the examiner expects you to use laws such as De Morgan’s theorem, distribution, and absorption. For example, ¬(A ∨ B) = ¬A ∧ ¬B is frequently examined. Practice rearranging gate symbols: a NAND gate can be drawn as an AND followed by a NOT, or, using De Morgan, as an OR with inverted inputs.
在化简布尔表达式时，考官期望你使用德·摩根定理、分配律和吸收律等定律。例如，¬(A ∨ B) = ¬A ∧ ¬B 是经常考查的内容。要练习重新组合门符号：NAND 门可以画成与门后接非门，或者根据德·摩根定理画成输入取反的或门。
Equality checking between two circuits is another higher‑mark question. Build the truth table for both expressions; if their output columns match, the circuits are logically equivalent. This method reliably secures full marks.
比较两个电路是否相等是另一种高分题。分别为两个表达式建立真值表；如果它们的输出列完全一致，那么电路逻辑等价。这种方法能可靠地拿到满分。
7. Networking and Communication | 网络与通信
Networking questions often ask you to describe the role of specific hardware (router, switch, NIC) or protocols (TCP/IP, HTTP, FTP). A generic answer will lose marks; you need to link the device’s function to the OSI or TCP/IP layers. For instance, a switch operates at the data link layer, using MAC addresses to forward frames within a LAN.
网络题通常要求你描述特定硬件（路由器、交换机、网卡）或协议（TCP/IP、HTTP、FTP）的作用。笼统的回答会丢分；你需要将该设备的功能与 OSI 或 TCP/IP 模型层次联系起来。例如，交换机在数据链路层工作，利用 MAC 地址在局域网内转发帧。
WJEC also tests your ability to analyse packet structures. A past question provided a diagram of a TCP segment and asked students to label the source port, destination port, sequence number, and acknowledgment number. Learn the key fields and understand how the three‑way handshake works (SYN, SYN‑ACK, ACK).
WJEC 还考查你分析数据包结构的能力。有一道真题给出一张 TCP 报文段的示意图，要求学生标出源端口、目的端口、序列号和确认号。要掌握关键字段，并理解三次握手是如何进行的（SYN、SYN‑ACK、ACK）。
When asked to compare circuit switching and packet switching, use a structured approach: define both, mention resource reservation versus dynamic routing, and give an example (traditional phone network vs. internet). Use accurate comparison phrases such as "circuit switching guarantees a dedicated path but can waste bandwidth; packet switching shares bandwidth efficiently but may introduce latency."
当被要求比较电路交换与分组交换时，要采用结构化方法：定义两者，提及资源预留与动态路由的对比，并给出例子（传统电话网络 vs. 互联网）。使用准确的比较用语，如"电路交换保证一条专用路径但可能浪费带宽；分组交换高效地共享带宽但可能引入延迟"。
8. Programming Fundamentals in Unit 2 | Unit 2 编程基础
Unit 2 is entirely practical. Past on‑screen exams start with a partially completed program and a series of tasks. You are expected to demonstrate competence with data types, selection (if‑elif‑else), iteration (for, while), arrays/lists, string handling, and file I/O. A common opening task asks you to correct syntax errors in provided code, so sharpen your debugging skills.
Unit 2 完全是实践性的。历年机考试卷都从一个部分完成的程序和一系列任务开始。你需要展示对数据类型、选择结构 (if‑elif‑else)、循环 (for, while)、数组/列表、字符串处理和文件输入输出的熟练掌握。常见的第一个任务要求你修正所提供代码中的语法错误，所以请强化你的调试技能。
Subroutines and parameter passing carry heavy weighting. You will be asked to write a function with parameters and a return value, then call it from the main program. WJEC examiners look for correct use of local variables versus global variables. For example, a past task required writing a function validate_email(email) that returns True if the string contains '@' and at least one dot after the '@', and False otherwise.
子程序和参数传递占有很高的比重。你会被要求编写一个带有参数和返回值的函数，然后在主程序中调用它。WJEC 考官看重局部变量与全局变量的正确使用。例如，一道真题要求编写一个函数 validate_email(email)，如果字符串包含 '@' 且 '@' 后至少有一个点，则返回 True，否则返回 False。
Program trace questions are still present in Unit 2. You may be given a short algorithm and asked to predict its output or complete a trace table. Even though you are at a computer, hastily running the code without understanding the logic can lead you to miss edge cases. Physically drawing a trace table on the scrap paper provided will help you verify your coded solution later.
Unit 2 中仍然会出现程序跟踪题。你可能会被给出一段短算法，要求预测其输出或完成追踪表。尽管你坐在电脑前，但不理解逻辑就匆忙运行代码会让你遗漏边界情况。在提供的草稿纸上手动绘制追踪表，有助于稍后验证编码方案。
9. Algorithm Design and Trace Tables | 算法设计与追踪表
Algorithm design appears in both units, but Unit 2 demands implementation. You might be asked to design a solution in pseudocode before coding. Past WJEC papers have featured algorithms such as linear search, counting occurrences, or calculating a running total from a file of numbers. Being able to construct a precise trace table – listing each variable’s value after every iteration – is a guaranteed way to check your logic.
算法设计在两个单元中都会出现，但 Unit 2 要求实现。你可能会被要求先用伪代码设计方案，再编码。过往的 WJEC 试卷曾出现过线性搜索、统计出现次数或从数字文件中计算累计总和等算法。能够构建一个精确的追踪表——列出每次迭代后每个变量的值——是检验逻辑的可靠方法。
Let us consider a typical trace table task. Algorithm: `total ← 0; for count ← 1 to 5: input n; if n > 10 then total ← total + n; endif; next count. If inputs are 8, 15, 12, 9, 20, the trace table would show total` changing from 0 to 0, then to 15, then to 27, then still 27, and finally 47. Writing this out prevents confusion over whether the final total includes the 9 (it should not).
我们看一个典型的追踪表任务。算法：`total ← 0; for count ← 1 to 5: 输入 n; 如果 n > 10 则 total ← total + n; 结束条件; 下一个 count。假设输入为 8、15、12、9、20，追踪表将显示 total 从 0 变为 0，然后变为 15，再变为 27，继续保持 27，最后变成 47。动手写出来可以避免对最终 total` 是否包含 9（应该不包含）的混淆。
When the task involves arrays, trace tables expand to show indices and element values. WJEC mark schemes reward methodical row‑by‑row labels, so never skip an iteration. Even if the question only asks for final outputs, a well‑kept trace table in your exam notes will support your coded answer and may earn marks for showing the right approach.
当任务涉及数组时，追踪表需要扩展以显示索引和元素值。WJEC 评分标准青睐有条理的一行行标注，所以绝不要跳过任何一次迭代。即使题目只要求最终输出，你在考试备注中保持一张清晰的追踪表也能支撑你的编程答案，并可能因展示出正确方法而得分。
10. Practical Programming Exam Tips | 编程实验考试技巧
Time management during the 2‑hour on‑screen exam is critical. You will typically have four to six tasks of increasing difficulty. Start by reading the entire question paper and the provided code base, even before touching the keyboard. Underline the deliverables: "Write a function that...", "Amend the procedure so that...", "Test your solution with the following data".
在 2 小时机考中，时间管理至关重要。你通常会遇到四到六个难度递增的任务。在触碰键盘之前，先通读整份试卷和所给的代码库。标出交付要求："编写一个函数……""修改过程使得……""用下列数据测试你的方案"。
Save your work every few minutes, using a version suffix (v1, v2) in the filename. This mirrors real‑world development and means you can revert if a new change breaks previous functionality. WJEC centres typically provide an IDE with debugging capabilities; learn to use breakpoints and watch windows well before the exam day.
每几分钟就保存一次工作文件，文件名使用版本后缀（v1、v2）。这模仿了真实开发场景，如果新改动破坏了之前的功能，你可以回退。WJEC 考点通常会提供具有调试功能的 IDE；一定要在考前熟练掌握断点和监视窗口的使用。
Testing is a specific requirement in the mark scheme. You must document the test data you use, the expected results, and the actual results. Create a simple test plan inside a comment block or a separate text file. Even if your code is perfect, failure to show evidence of testing can cost you marks. Use boundary values (e.g., empty string, zero, the maximum integer) and invalid inputs to demonstrate robustness.
测试是评分标准中的一项具体要求。你必须记录所使用的测试数据、预期结果和实际结果。在注释块或单独的文本文件中创建一个简单的测试计划。即使你的代码完美无缺，缺少测试证据也会导致丢分。使用边界值（如空字符串、零、最大整数）和无效输入来展示程序的健壮性。
11. Time Management and Using Mark Schemes | 时间管理与利用评分标准
For Unit 1, allocate roughly one minute per mark. A 62‑mark paper gives you 62 minutes for writing, leaving about 58 minutes for reading and checking. If you get stuck on a 2‑mark logic diagram, mark it and move on; the later essay‑style fetch‑execute question (often 10 marks) deserves your full attention.
对于 Unit 1，大致按每分钟一分来分配时间。一份 62 分的试卷，你有 62 分钟作答，剩下约 58 分钟用于阅读和检查。如果你在一道 2 分的逻辑图题上卡住了，先做标记往下走；后面那道论述式的取指‑执行题（通常 10 分）值得你全身心投入。
When you finish a paper in practice, always compare your answers against the official WJEC mark scheme, not just the model answer. Mark schemes use indented bullet points: bold for essential (mandatory) points and plain for supplementary points. Notice how "Accept any other suitable alternative" is often stated; this gives you freedom as long as your logic holds.
在练习完一份试卷后，一定要对照官方的 WJEC 评分标准进行批改，而不仅仅是对照参考答案。评分标准使用缩进的要点符号：粗体表示必须（强制）的要点，普通字体表示补充要点。注意"接受任何其他合适的替代答案"常会标注；这给了你自由，只要你的逻辑站得住脚。
In Unit 2, the mark scheme for on‑screen exams is usually less publicly detailed, but the principle is the same: marks are awarded for correct syntax, correct logic, and evidence of testing. When you self‑mark, ask: "Does my code compile? Does it meet all the stated requirements? Have I included comments?" If all three are a yes, you are on track for top marks.
Published by TutorHao | Year 12 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图