📚 Past Paper Questions Deep Dive | 历年真题深度解析
WJEC Year 10 Computer Science past papers are not just revision tools — they are a window into the examiner's mind. Every question is carefully designed to test specific assessment objectives: knowledge recall, application to scenarios, and higher-order analysis. This deep dive will walk you through the most frequently examined topics, common pitfalls, and proven strategies to turn past paper practice into top marks. Whether you are preparing for Unit 1 (Understanding Computer Science) or Unit 2 (Computational Thinking and Programming), this guide will sharpen your exam technique and deepen your conceptual understanding.
WJEC 十年级计算机科学历年真题不仅是复习工具——它们是通往考官思维的一扇窗。每一道题目都精心设计，用以测试特定的评估目标：知识回忆、情景应用以及高阶分析。本次深度解析将带你梳理最高频的考点、常见的失分陷阱，以及将真题练习转化为高分的成熟策略。无论你正在准备第一单元（理解计算机科学）还是第二单元（计算思维与编程），本指南都将打磨你的考试技巧，深化你的概念理解。
1. Understanding the Exam Structure | 理解考试结构
WJEC GCSE Computer Science is assessed through two written papers, each worth 50% of the final grade. Unit 1 focuses on theory — hardware, software, data representation, networks, and societal issues. Unit 2 centres on computational thinking, programming concepts, and algorithm design. Knowing which topics appear on which paper is half the battle. Past papers reveal that Unit 1 typically includes short-answer questions, structured scenarios, and extended writing, while Unit 2 leans heavily on pseudocode, trace tables, and logic-based problems.
WJEC GCSE 计算机科学通过两份笔试进行评估，各占总成绩的 50%。第一单元侧重理论——硬件、软件、数据表示、网络和社会议题。第二单元聚焦计算思维、编程概念和算法设计。知道哪些主题出现在哪张试卷上是成功的一半。历年真题显示，第一单元通常包含简答题、结构化情景题和扩展写作，而第二单元则大量依赖伪代码、追踪表和逻辑问题。
A common mistake students make is treating both papers as identical in style. Unit 1 rewards precise terminology and clear explanations, whereas Unit 2 demands logical rigour and step-by-step problem-solving. Always read the command words carefully: 'State' means a concise answer; 'Describe' requires linked sentences; 'Explain' needs reasoning with cause and effect; 'Evaluate' asks for balanced judgement with supporting evidence. Past paper mark schemes consistently penalise vague or incomplete responses.
学生常犯的一个错误是将两份试卷视为风格相同。第一单元青睐精准术语和清晰的解释，而第二单元要求逻辑严谨和逐步解题。务必仔细审读指令词：'State' 意味着简洁回答；'Describe' 需要连贯的句子；'Explain' 要求带因果关系的推理；'Evaluate' 则需平衡的判断并附支持证据。历年真题的评分方案一贯惩罚模糊或不完整的作答。
2. Binary and Hexadecimal Conversions | 二进制与十六进制转换
Data representation questions appear in nearly every Unit 1 paper, and binary-hexadecimal conversions are a guaranteed skill to master. A typical past paper question asks you to convert the denary number 218 into binary and then into hexadecimal. The examiner expects a clear method: successive division by 2 for binary (reading remainders bottom to top), then grouping binary digits into nibbles of 4 for hexadecimal. 218 in denary gives 11011010 in binary, which groups into 1101 (D) and 1010 (A), producing DA in hex.
数据表示问题几乎出现在每一份第一单元试卷中，而二进制与十六进制的转换是必须掌握的技能。一道典型的真题会要求你将十进制数 218 转换为二进制，再转换为十六进制。考官期望清晰的方法：二进制采用连续除以 2（从下往上读取余数），然后将二进制位每 4 位一组进行十六进制分组。十进制 218 得出二进制 11011010，分组为 1101（D）和 1010（A），得出十六进制 DA。
| Denary | Binary | Hexadecimal |
| 0 | 0000 | 0 |
| 10 | 1010 | A |
| 15 | 1111 | F |
| 255 | 11111111 | FF |
Examiners often test overflow and range. An 8-bit register can store values from 0 to 255 (unsigned) or -128 to +127 (signed using two's complement). Past papers frequently ask: 'Explain why an overflow error occurs when adding two 8-bit numbers.' The answer must mention that the result exceeds the maximum value representable in 8 bits, causing the most significant carry to be lost. Always show your working — even if the final answer is wrong, method marks are available.
考官经常测试溢出和范围。一个 8 位寄存器可存储 0 到 255 的值（无符号）或 -128 到 +127（有符号，使用二进制补码）。真题常问：'解释为何两个 8 位数相加时会发生溢出错误。' 答案必须提到结果超出了 8 位可表示的最大值，导致最高位进位丢失。始终展示你的计算过程——即使最终答案错误，仍可获得方法分。
3. Data Structures Fundamentals | 数据结构基础
WJEC Unit 2 papers regularly feature questions on arrays, records, and files. An array is a collection of elements of the same data type, accessed via an index. A record is a data structure that groups related fields of potentially different types — think of a student record containing name (string), age (integer), and grade (character). Past paper scenarios often ask you to declare arrays in pseudocode: DECLARE scores : ARRAY[1:10] OF INTEGER. Understanding the difference between one-dimensional and two-dimensional arrays is critical; a 2D array is essentially a table with rows and columns.
WJEC 第二单元试卷经常出现关于数组、记录和文件的问题。数组是相同数据类型元素的集合，通过索引访问。记录是一种将可能不同类型的相关字段组合在一起的数据结构——想象一个包含姓名（字符串）、年龄（整数）和成绩（字符）的学生记录。真题情景常要求你用伪代码声明数组：DECLARE scores : ARRAY[1:10] OF INTEGER。理解一维数组和二维数组的区别至关重要；二维数组本质上是一个有行和列的表格。
Trace table questions are among the most heavily weighted in Unit 2. You are given an algorithm and must track variable values through each iteration. A typical past paper provides a loop processing an array and asks you to complete a trace table with columns for each variable. Common pitfalls include forgetting to update the loop counter or misreading the loop condition. Practice by dry-running algorithms on paper before looking at the mark scheme — this builds the mental discipline needed under timed conditions.
追踪表题目是第二单元中权重最高的题型之一。你会得到一个算法，必须追踪每次迭代中的变量值。一道典型真题提供一个处理数组的循环，要求你完成一个包含各变量列的追踪表。常见陷阱包括忘记更新循环计数器或误读循环条件。在查看评分方案前先在纸上手动运行算法来练习——这能培养限时条件下所需的心智纪律。
4. Search and Sort Algorithms | 搜索与排序算法
Linear search and binary search are staple topics in WJEC past papers. Linear search checks each element sequentially until the target is found or the list ends. Its time complexity is O(n) — in the worst case, every element is examined. Binary search requires a sorted list and repeatedly divides the search interval in half. Its time complexity is O(log n), making it far more efficient on large datasets. A classic exam question asks: 'Explain why binary search cannot be used on an unsorted list.' The answer centres on the algorithm's reliance on the median value to eliminate half the remaining elements — without ordering, this elimination logic collapses.
线性搜索和二分搜索是 WJEC 真题中的常驻主题。线性搜索依次检查每个元素，直到找到目标或列表结束。其时间复杂度为 O(n)——最坏情况下，每个元素都被检查。二分搜索要求列表已排序，并反复将搜索区间减半。其时间复杂度为 O(log n)，在大数据集上效率高得多。一道经典考题是：'解释为何二分搜索不能用于未排序列表。' 答案核心在于该算法依赖中位值来排除剩余的一半元素——没有排序，这种排除逻辑就崩溃了。
Bubble sort and insertion sort are the two sorting algorithms explicitly named in the WJEC specification. Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. After each pass, the largest unsorted element 'bubbles' to its correct position. Insertion sort builds the sorted list one element at a time by taking each new element and inserting it into its correct position within the already-sorted portion. Past papers often ask you to show the state of the list after each pass — draw clear diagrams and label each step. Mark schemes reward clarity even if a minor swap error occurs.
冒泡排序和插入排序是 WJEC 考纲中明确指定的两种排序算法。冒泡排序反复遍历列表，比较相邻元素，并在顺序错误时交换它们。每轮遍历后，最大的未排序元素'冒泡'到其正确位置。插入排序一次一个元素地构建有序列表，将每个新元素插入已排序部分中的正确位置。真题常要求你展示每轮遍历后列表的状态——画出清晰图表并标注每一步。即使发生轻微交换错误，评分方案仍奖励清晰度。
5. Programming Constructs and Common Traps | 编程结构与常见陷阱
WJEC Unit 2 assesses three fundamental programming constructs: sequence, selection, and iteration. Sequence is the default — statements execute one after another. Selection uses IF...THEN...ELSE...ENDIF to make decisions. Iteration comes in two flavours: definite (FOR loops, where the number of iterations is known in advance) and indefinite (WHILE or REPEAT...UNTIL loops, where termination depends on a condition). A recurring past paper question asks you to rewrite a WHILE loop as a REPEAT...UNTIL loop, testing your understanding that the condition is checked at the end rather than the beginning.
WJEC 第二单元评估三种基本编程结构：顺序、选择和迭代。顺序是默认方式——语句逐条执行。选择使用 IF...THEN...ELSE...ENDIF 来做决策。迭代有两种形式：确定型（FOR 循环，迭代次数预先已知）和不确定型（WHILE 或 REPEAT...UNTIL 循环，终止取决于条件）。一道反复出现的真题要求你将 WHILE 循环改写为 REPEAT...UNTIL 循环，测试你对条件在末尾而非开头检查的理解。
Variable scope is a subtle but examinable concept. A local variable is declared inside a subroutine and exists only during its execution; a global variable is accessible throughout the program. Past papers often present a pseudocode snippet with variables declared in different scopes and ask for the output. Students frequently lose marks by assuming a local variable retains its value between subroutine calls — it does not, unless explicitly passed as a parameter or returned. Always trace variable lifecycles carefully.
变量作用域是一个微妙但可考的概念。局部变量在子程序内部声明，仅在其执行期间存在；全局变量可在整个程序中访问。真题常提供一段在不同作用域中声明变量的伪代码片段，并要求输出。学生常因假设局部变量在子程序调用之间保留其值而失分——除非显式作为参数传递或返回，否则不会保留。务必仔细追踪变量的生命周期。
6. Computer Networking Essentials | 计算机网络要点
Networking questions in Unit 1 cover LANs, WANs, topologies, and protocols. A LAN (Local Area Network) connects computers within a limited geographical area, typically using Ethernet or Wi-Fi. A WAN (Wide Area Network) spans large distances, often using leased telecommunications lines. The star topology, where all nodes connect to a central switch, is the most common in modern networks. Past papers ask for advantages: if one cable fails, only that node is affected; adding new nodes is simple. The disadvantage is the central switch as a single point of failure.
第一单元的网络问题涵盖局域网、广域网、拓扑结构和协议。LAN（局域网）在有限地理区域内连接计算机，通常使用以太网或 Wi-Fi。WAN（广域网）跨越远距离，常使用租用电信线路。星型拓扑中所有节点连接到中央交换机，是现代网络中最常见的结构。真题要求说出优点：如果一根电缆故障，仅该节点受影响；添加新节点简单。缺点是中央交换机是单点故障。
Protocol layers are a topic that separates high-achieving students from the rest. The TCP/IP four-layer model — Application, Transport, Internet, Network Access — underpins all internet communication. Each layer has specific responsibilities: the Transport layer (TCP) ensures reliable delivery through acknowledgements and retransmissions; the Internet layer (IP) handles addressing and routing. A typical 6-mark past paper question asks: 'Describe how data is sent across a network using layers.' The model answer traces data from the Application layer down through encapsulation at each lower layer, transmission across the physical medium, and de-encapsulation at the receiving end. Use the term 'encapsulation' explicitly — examiners look for it.
协议分层是区分高分学生与他人的一个主题。TCP/IP 四层模型——应用层、传输层、互联网层、网络接入层——支撑所有互联网通信。每层有特定职责：传输层（TCP）通过确认和重传确保可靠交付；互联网层（IP）处理寻址和路由。一道典型的 6 分真题问：'描述数据如何使用分层模型在网络中发送。' 标准答案从应用层向下追踪数据，经过每一下层的封装、跨物理介质传输，以及在接收端的解封装。明确使用术语'封装'——考官会寻找这个词。
7. Cybersecurity Threats and Defences | 网络安全威胁与防护
Cybersecurity forms a significant portion of Unit 1, with past papers consistently featuring malware, social engineering, and network security. Malware is a broad category covering viruses (self-replicating, attach to files), worms (self-replicating, spread independently), and trojans (disguised as legitimate software). Social engineering exploits human psychology — phishing emails trick users into revealing credentials, while shoulder surfing involves observing someone's screen or keyboard in a public space. Brute-force attacks systematically try all possible password combinations; the defence is account lockout policies and strong password requirements.
网络安全占第一单元的相当比重，真题一贯涉及恶意软件、社会工程和网络安全。恶意软件是一个大类，涵盖病毒（自我复制，附着于文件）、蠕虫（自我复制，独立传播）和木马（伪装成合法软件）。社会工程利用人类心理——钓鱼邮件诱骗用户泄露凭证，而肩窥则是在公共空间观察他人的屏幕或键盘。暴力攻击系统地尝试所有可能的密码组合；防御措施是账户锁定策略和强密码要求。
Encryption questions test both symmetric and asymmetric methods. Symmetric encryption uses a single shared key for both encryption and decryption — fast but requires secure key distribution. Asymmetric encryption uses a key pair: a public key for encryption and a private key for decryption. It solves the key distribution problem but is computationally slower. Past papers often present a scenario of secure online banking and ask which encryption type is suitable and why. The strongest answers link the choice to the specific context — for bulk data transfer, symmetric (like AES) is preferred; for initial key exchange, asymmetric (like RSA) is essential.
加密问题测试对称和非对称两种方法。对称加密使用单一共享密钥进行加密和解密——速度快但需要安全的密钥分发。非对称加密使用密钥对：公钥用于加密，私钥用于解密。它解决了密钥分发问题，但计算速度较慢。真题常呈现一个安全网上银行的情景，询问哪种加密类型合适及原因。最强答案会将选择与具体情境联系起来——对于大量数据传输，对称加密（如 AES）更优；对于初始密钥交换，非对称加密（如 RSA）必不可少。
8. Logic Gates and Truth Tables | 逻辑门与真值表
Boolean logic appears regularly in Unit 1, with AND, OR, and NOT gates forming the foundation. The AND gate outputs 1 only when both inputs are 1. The OR gate outputs 1 when at least one input is 1. The NOT gate is a unary operator that inverts its input. From these, more complex circuits are built — NAND (NOT-AND), NOR (NOT-OR), and XOR (exclusive OR, true when inputs differ). Past papers frequently ask you to complete a truth table for a given logic circuit diagram. The method is systematic: label intermediate points, work from inputs towards the output, and fill in columns methodically.
布尔逻辑经常出现在第一单元中，AND、OR 和 NOT 门构成基础。AND 门仅在两个输入均为 1 时输出 1。OR 门在至少一个输入为 1 时输出 1。NOT 门是一元运算符，反转其输入。由此构建更复杂的电路——NAND（与非）、NOR（或非）和 XOR（异或，输入不同时为真）。真题常要求你为给定的逻辑电路图完成真值表。方法是系统性的：标注中间点，从输入向输出推进，有条理地填写各列。
Simplifying Boolean expressions using Boolean algebra laws — such as De Morgan's theorems — is a higher-tier skill. De Morgan' ow complex expressions to be reduced, saving logic gates in circuit design. Past papers sometimes ask for a circuit to be redrawn using only NAND gates, since NAND is a universal gate — y NAND gates. This tests both theoretical knowledge and practical circuit design thinking.
使用布尔代数定律（如德摩根定理）简化布尔表达式是一项高阶技能。德摩根第一定律指出：NOT(A AND B) = (NOT A) OR (NOT B)。第二定律：NOT(A OR B) = (NOT A) AND (NOT B)。这些定律可简化复杂表达式，在电路设计中节省逻辑门。真题有时要求仅使用 NAND 门重新绘制电路，因为 NAND 是通用门——任何布尔函数都可仅用 NAND 门实现。这既测试理论知识，也测试实践性电路设计思维。
9. Databases and SQL Queries | 数据库与 SQL 查询
Database questions in WJEC papers focus on relational databases, primary keys, and SQL. A primary key is a field that uniquely identifies each record in a table — it cannot be null and must be unique. Foreign keys link tables together, creating relationships. A one-to-many relationship is the most common: one customer can place many orders, so the CustomerID appears as a foreign key in the Orders table. Past papers present a scenario with two or three linked tables and ask you to write SQL queries. The basic structure is: SELECT field1, field2 FROM TableName WHERE condition ORDER BY field ASC;.
WJEC 试卷中的数据库问题聚焦于关系数据库、主键和 SQL。主键是唯一标识表中每条记录的字段——不能为空且必须唯一。外键将表连接起来，创建关系。一对多关系最为常见：一个客户可下许多订单，因此 CustomerID 作为外键出现在 Orders 表中。真题呈现一个包含两到三个关联表的情景，要求你编写 SQL 查询。基本结构是：SELECT field1, field2 FROM TableName WHERE condition ORDER BY field ASC;。
names, and using = instead of LIKE for pattern matching. The LIKE operator with wildcards — % for multiple characters, _ for a single character — is often tested: SELECT * FROM Students WHERE Name LIKE 'J%'; returns all students whose names start with J. Aggregate functions (COUNT, SUM, AVG, MAX, MIN) appear in questions requiring summary statistics. Always check whether GROUP BY is needed when mixing aggregate and non-aggregate fields — a classic error that mark schemes penalise.
真题中常见的 SQL 陷阱包括忘记末尾分号、拼错字段名以及在模式匹配中使用 = 而非 LIKE。带通配符的 LIKE 运算符——% 代表多个字符，_ 代表单个字符——经常被测试：SELECT * FROM Students WHERE Name LIKE 'J%'; 返回所有名字以 J 开头的学生。聚合函数（COUNT、SUM、AVG、MAX、MIN）出现在需要汇总统计的问题中。混合聚合和非聚合字段时务必检查是否需要 GROUP BY——这是一个评分方案会惩罚的典型错误。
10. Exam Strategy and Common Pitfalls | 考试策略与常见错误
Success in WJEC Computer Science past papers depends as much on exam technique as on subject knowledge. Time management is critical: allocate roughly one mark per minute, leaving time at the end to review. For Unit 1, read the scenario carefully — key details are often embedded in the context and must be referenced in your answer to earn full marks. For Unit 2, show all working in algorithm and trace table questions; even if the final output is incorrect, the method earns partial credit. Never leave a question blank — a sensible attempt, even if incomplete, can pick up marks.
WJEC 计算机科学真题的成功既取决于学科知识，也同样取决于考试技巧。时间管理至关重要：大致按每分钟一分的比例分配，最后留出时间检查。对于第一单元，仔细阅读情景——关键细节常嵌入上下文中，必须在答案中引用才能获得满分。对于第二单元，在算法和追踪表题目中展示所有过程；即使最终输出不正确，方法也能获得部分分数。绝不要留空题——一个合理的尝试，即使不完整，也能获得分数。
Command word confusion is a leading cause of lost marks. 'State' requires a brief factual answer — one word or a short phrase. 'Describe' needs a sequence of linked points painting a picture. 'Explain' demands reasoning with 'because' or 'therefore'. 'Evaluate' requires a balanced argument with a conclusion. Past paper examiner reports repeatedly note that students who simply list points when asked to explain fail to access higher mark bands. Practice by highlighting command words in past papers before answering, and check your response against the mark scheme's indicative content.
指令词混淆是失分的主要原因。'State' 要求简要事实性回答——一个词或一个短语。'Describe' 需要一系列连贯的要点来描绘图景。'Explain' 要求使用'因为'或'因此'进行推理。'Evaluate' 需要平衡的论证并得出结论。真题考官报告一再指出，当被要求解释时仅罗列要点的学生无法进入更高分档。练习时先在真题中高亮指令词再作答，并将你的回答与评分方案的指示性内容对照检查。
Finally, learn the mark scheme, not just the content. WJEC mark schemes follow consistent patterns: certain phrases recur as 'indicative content'. For example, any question about the advantages of cloud storage expects phrases like 'accessible from any device with internet', 'automatic backup', 'no local storage space required'. Building a mental library of these examiner-approved phrases gives you a reliable vocabulary for constructing high-mark answers under pressure.
最后，学习评分方案，而不仅仅是内容。WJEC 评分方案遵循一致的模式：某些短语作为'指示性内容'反复出现。例如，任何关于云存储优点的问题都期望出现'可从任何联网设备访问'、'自动备份'、'无需本地存储空间'等短语。在心中建立一个由考官认可短语组成的库，为你提供可靠词汇，以便在压力下构建高分的答案。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图