📚 Year 11 WJEC Computer Science: In-depth Analysis of Past Papers | Year 11 WJEC 计算机：历年真题深度解析
Past papers are the single most effective tool for mastering WJEC GCSE Computer Science. They reveal exactly how examiners test theoretical knowledge and computational thinking, and they highlight the recurring question patterns that appear year after year. This article provides a detailed, bilingual breakdown of what you can learn from WJEC past papers, covering key topics, question types, common pitfalls, and smart revision strategies.
历年真题是掌握 WJEC GCSE 计算机科学最有效的工具。它们准确揭示了考官如何测试理论知识、如何考查计算思维，并凸显了年复一年出现的题型规律。本文提供一份详细的双语解析，拆解历年真题所蕴含的考点、题型、常见失分陷阱以及高效的备考策略。
1. Overview of Past Papers | 历年真题概述
WJEC GCSE Computer Science consists of two examined units: Unit 1 'Understanding Computer Science' and Unit 2 'Computational Thinking and Programming'. Past papers from 2018 onwards closely follow the current specification and demonstrate a consistent blend of knowledge recall, application, and problem-solving. By reviewing papers across multiple series, students can identify how weighting shifts between topics like hardware, networking, algorithms, and Python coding.
WJEC GCSE 计算机科学包括两个笔试单元：单元一“理解计算机科学”和单元二“计算思维与编程”。2018年起的历年真题严格遵循现行大纲，呈现出知识记忆、应用与解决问题的稳定混合。通过回顾多个考试系列的真题，学生可以识别出硬件、网络、算法和 Python 编程等主题的分数权重变化。
A clear pattern is that Paper 1 focuses heavily on systems architecture, data representation, networks, and legal/ethical issues, while Paper 2 challenges students with algorithm design, trace tables, and Python code fragments. Knowing this split helps you allocate revision time efficiently.
一个清晰的规律是，试卷一重点考查系统架构、数据表示、网络以及法律与伦理问题，而试卷二则以算法设计、追踪表和 Python 代码片段挑战学生。了解这一分工有助于高效分配复习时间。
2. High-Frequency Topics: Computer Systems | 高频考点：计算机系统
Questions on computer systems appear in nearly every Unit 1 paper. Typical areas include the fetch–decode–execute cycle, the role of the CPU, and characteristics of embedded systems. For example, a common question asks: 'Explain how the CPU executes an instruction using the fetch–decode–execute cycle.' Model answers must mention the program counter (PC), memory address register (MAR), and the control unit (CU) sequentially.
计算机系统的题目几乎出现在每一份单元一试卷中。典型考点包括取指—解码—执行周期、CPU 的作用以及嵌入式系统的特征。例如，常见题目：“解释 CPU 如何使用取指—解码—执行周期执行一条指令。”标准答案必须按顺序提到程序计数器（PC）、内存地址寄存器（MAR）和控制单元（CU）。
Secondary storage types are also frequently tested. You need to compare magnetic, solid state, and optical storage in terms of speed, durability, and capacity. Past papers reward precise technical vocabulary like 'NAND flash memory' and 'magnetic platters'.
辅助存储器类型也是高频考点。你需要从速度、耐用性和容量等方面比较磁存储、固态存储和光存储。历年真题青睐精确的技术词汇，如“NAND 闪存”和“磁盘盘片”。
3. High-Frequency Topics: Data Representation | 高频考点：数据表示
Data representation is consistently worth 8–12 marks per paper. The most examined skills are: converting between binary and denary, binary and hexadecimal, adding binary integers, and using two's complement to represent negative numbers. A typical exam question will ask you to convert the denary number 125 to an 8-bit binary number and then to hexadecimal.
数据表示在每份试卷中稳定占据 8–12 分。考查最多的技能包括：二进制与十进制之间的转换、二进制与十六进制的转换、二进制整数加法，以及使用二进制补码表示负数。一道典型的试题是要求将十进制数 125 转换为 8 位二进制数，然后再转换为十六进制。
Character representation appears through ASCII and Unicode. You should know how many bits are used in standard ASCII (7 bits, extended 8 bits) and why Unicode requires more bits. Image and sound representation calculations also recur: questions may ask you to calculate file size given resolution and colour depth, as in the formula
File size = resolution × colour depth
.字符表示通过 ASCII 和 Unicode 进行考查。你需要知道标准 ASCII 使用多少位（7 位，扩展 8 位）以及为何 Unicode 需要更多位。图像和声音表示的计算也反复出现：题目可能要求根据分辨率和色彩深度计算文件大小，公式为
文件大小 = 分辨率 × 色彩深度
。4. High-Frequency Topics: Programming Fundamentals | 高频考点：编程基础
Unit 2 papers extensively test programming fundamentals using Python or WJEC‑style pseudocode. Variables, data types (integer, string, float, boolean), and assignment are assumed knowledge. A frequent question format provides a short Python script with blank lines and asks you to complete it so that it operates correctly, such as reading user input and performing a conditional check.
单元二试卷大量考查使用 Python 或 WJEC 风格伪代码的编程基础。变量、数据类型（整数、字符串、浮点数、布尔型）和赋值是必备知识。一种常见题型是提供一段带空白行的简短 Python 脚本，要求你补全代码使其正确运行，例如读取用户输入并执行条件检查。
Control structures—sequence, selection (if‑elif‑else), and iteration (for, while)—are bedrock. Past papers often include nested if statements inside a while loop. Practise hand‑tracing such code and building trace tables to avoid logic errors.
控制结构——顺序、选择（if‑elif‑else）和迭代（for、while）——是基石。真题经常在 while 循环里嵌套 if 语句。练习手工追踪此类代码并构建追踪表，以避免逻辑错误。
5. High-Frequency Topics: Algorithms and Problem Solving | 高频考点：算法与问题解决
Algorithm questions demand both comprehension and creation. You may be asked to interpret a flowchart or pseudocode of a linear search, binary search, or bubble sort. Typical marks are awarded for stating the steps of a binary search and explaining why it is more efficient than a linear search on large sorted datasets.
算法题同时要求理解和编写。你可能被要求解释一个线性搜索、二分搜索或冒泡排序的流程图或伪代码。典型的得分点在于陈述二分搜索的步骤，并解释为何在大规模有序数据集上它比线性搜索更高效。
Merge sort and insertion sort appear less frequently but are examinable. When a six‑mark question asks you to describe the bubble sort or show a pass, you must demonstrate how adjacent elements are compared and swapped. Use a numbered list and insert a trace table to secure full marks.
归并排序和插入排序出现较少但仍可能考查。当一道六分题要求你描述冒泡排序或展示一趟排序时，你必须演示如何比较和交换相邻元素。使用编号列表并插入追踪表来确保得满分。
6. Analysis of Question Types: Multiple Choice | 真题题型分析：选择题
Multiple‑choice questions in Unit 1 cover a broad sweep of the specification, from network protocols (HTTP, HTTPS, FTP, SMTP) to logic gate truth tables. They are designed to discriminate between students who have surface knowledge and those who truly understand concepts. Always read every option; distractors often contain subtle errors such as confusing lossy with lossless compression.
单元一的选择题覆盖大纲广泛，从网络协议（HTTP、HTTPS、FTP、SMTP）到逻辑门真值表。它们旨在区分表面知识与真正理解概念的学生。务必读完每一个选项；干扰项常包含细微错误，例如混淆有损压缩与无损压缩。
When you encounter a multiple‑choice question about logical operators (AND, OR, NOT), quickly draw the truth table if the time allows. Past papers show that questions combining two logic gates are common; for instance, a circuit of an AND gate followed by a NOT gate yields a NAND function.
当你遇到关于逻辑运算符（AND、OR、NOT）的选择题时，若时间允许快速画出真值表。历年真题表明，组合两个逻辑门的问题很常见；例如一个与门后接一个非门的电路产生与非功能。
7. Analysis of Question Types: Short Answer | 真题题型分析：简答题
Short answer questions usually carry 2–4 marks and require concise technical responses. For example, 'State two differences between a LAN and a WAN' expects answers like geographical scope and ownership of infrastructure. Superficial responses lose marks; always use precise terms such as 'dedicated leased lines' instead of just 'phone lines'.
简答题通常占 2–4 分，要求简洁的技术性回答。例如，“陈述局域网和广域网的两个区别”期望的答案是地理范围和基础设施所有权。肤浅的回答会丢分；务必使用精确术语，如“专用租用线路”而不仅仅是“电话线路”。
Definition questions, such as 'Define the term algorithm', reward standard wording. A good answer echoes the specification: 'A sequence of steps that can be followed to complete a task and terminate.' Many students lose a mark by omitting 'terminate' or writing 'solve a problem' instead of 'complete a task'.
定义题，如“定义算法”，青睐规范措辞。一个好的回答应呼应大纲：“一组可遵循以完成任务并终止的步骤序列”。许多学生因遗漏“终止”或用“解决问题”替代“完成任务”而丢分。
8. Analysis of Question Types: Programming Tasks | 真题题型分析：编程题
Programming tasks in Unit 2 are usually worth 6–10 marks and require you to write, correct, or complete code. A popular style is 'The following code should output the largest of three numbers entered by the user, but it contains two errors. Identify and correct the errors.' This tests both syntax and logical understanding.
单元二的编程题通常占 6–10 分，要求编写、改错或补全代码。一种流行的题型是：“以下代码应输出用户输入的三个数中的最大值，但包含两处错误。找出并更正错误。”这同时测试语法和逻辑理解。
When the question asks you to write a function, use meaningful variable names and include comments even if not explicitly required—examiners can award marks for clarity. For example, when writing a data validation loop, explicitly show input, condition check, and a suitable error message.
当题目要求你编写一个函数时，使用有意义的变量名并添加注释，即使没有明确要求——考官可能因清晰性给分。例如，编写数据验证循环时，明确显示输入、条件检查和合适的错误消息。
9. Common Mistakes and Pitfalls | 常见错误与失分陷阱
One of the most frequent mistakes is confusing binary and denary in data‑size calculations. For instance, many students incorrectly use a kilobyte as 1000 bytes when the exam expects 1024 bytes (210 her convention is sometimes accepted, but you must state which you are using. Always write '1 KB = 1024 bytes' to be safe.
最常见的错误之一是在数据大小计算中混淆二进制与十进制。例如，许多学生错误地将千字节视为 1000 字节，而考试期望 1024 字节（2¹⁰）。在 WJEC 评分方案中，有时两种约定都被接受，但你必须声明你使用哪一种。为安全起见，始终写上“1 KB = 1024 bytes”。
Another major pitfall is missing the final 'end if' or 'end while' in pseudocode. WJEC pseudocode expects explicit closing keywords. Similarly, when tracing code, students often skip updating loop counters or fail to record the final value of a variable after the loop exits. Use trace tables religiously—they are rewarded directly in the mark scheme.
另一个重大陷阱是在伪代码中漏写最后的“end if”或“end while”。WJEC 伪代码要求明确的关键字结束。同样，追踪代码时，学生经常漏掉更新循环计数器或未能记录循环退出后变量的最终值。要认真使用追踪表——评分方案会直接给分。
10. Understanding Mark Schemes | 评分标准解读
Mark schemes are not just answers; they are a guide to terminology and the level of detail required. They often contain 'allow' notes, indicating acceptable alternatives, and 'do not accept' prompts. For example, for 'State the function of an operating system', 'managing files' is allowed, but 'storing files' is insufficient.
评分方案不仅是答案；它们是指引术语表达和所需细节程度的指南。它们常包含“允许”注释，指出可接受的替代说法，以及“不接受”提示。例如，对于“陈述操作系统的功能”，“管理文件”被允许，但“存储文件”则不充分。
In programming tasks, mark schemes award marks for each correct keyword or logical step. A partial solution can still gain several marks if the algorithm's core idea is correct. Therefore, always write something rather than leaving a coding box blank; you can earn marks for initialisation, input, or output statements.
在编程题中，评分方案为每个正确的关键字或逻辑步骤给分。如果一个算法的核心思路正确，即使部分答案也能获得好几分。因此，务必在编程空格中写下内容，而非留空；初始化、输入或输出语句都能挣分。
11. Revision Strategies and Past Paper Practice Tips | 备考策略与真题练习技巧
Begin by sitting a full past paper under timed conditions without notes. Mark it honestly using the official mark scheme, then categorise your errors: knowledge gaps, misinterpretation, or silly mistakes. Focus your next week of revision on the weakest two categories. This targeted approach rapidly raises marks.
从在限时条件下完成一份完整真题开始，不看笔记。对照官方评分方案诚实地批改，然后将错误分类：知识漏洞、理解偏差或低级错误。接下来一周的复习重点放在最薄弱的两个类别。这种针对性的方法能快速提高分数。
Create a 'past paper tracker' table that lists every topic and the marks you scored. After completing three papers, patterns will emerge. You might discover that you consistently lose marks on network protocols or two's complement questions. Then, use focused worksheets until those topics become strengths.
创建一个“真题追踪表”，列出所有主题及你的得分。完成三份试卷后，规律就会显现。你可能发现自己总是在网络协议或二进制补码题上丢分。然后，使用专项练习单，直到这些主题成为你的强项。
12. Sample Analysis of Recent Past Papers | 2023/2024 真题示例解析
Consider a question from a recent Unit 1 paper: 'A computer system uses an 8‑bit register. The two's complement representation of a negative number is 11101010. Calculate the denary value.' To solve this, you note the MSB is 1, so it is negative. Convert from two' in denary, so the answer is -22. Marks are awarded for showing the inversion and addition steps.
以近期单元一试卷中的一道题为例：“某计算机系统使用 8 位寄存器。一个负数的二进制补码表示为 11101010。计算十进制值。”要解决这个问题，你注意到最高有效位为 1，因此是负数。从补码转换需翻转其余各位并加 1：翻转 1101010 → 0010101，加 1 → 0010110，十进制为 22，因此答案为 -22。展示翻转和加法步骤能得分。
From a Unit 2 paper, a typical 8‑mark programming question: 'Write a Python function that accepts a list of integers and returns the number of values greater than 100.' A high‑scoring solution initialises a count variable, iterates through the list with a for loop, compares each element using if item > 100:, increments the count, and returns the count. Missing the return statement or ignoring list input validation can cause unnecessary mark loss.
来自单元二试卷的一道典型 8 分编程题：“编写一个 Python 函数，接受一个整数列表并返回大于 100 的值的个数。”高分方案会初始化一个计数变量，用 for 循环遍历列表，使用 if item > 100: 进行比较，递增计数，并返回计数。遗漏 return 语句或忽略列表输入验证会导致不必要的失分。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图