📚 KS3 WJEC Computer Science: Mock Test Paper Walkthrough | KS3 WJEC 计算机：单元测试模拟卷解析
This walkthrough provides model answers and detailed explanations for a WJEC-style KS3 Computer Science unit test. It covers binary conversions, logic gates, flowcharts, Python debugging, hardware, network topologies and cybersecurity. Use it to identify gaps in your knowledge and to learn how to present full-mark answers.
本文提供一套WJEC风格KS3计算机科学单元测试模拟卷的详细解析。涵盖二进制转换、逻辑门、流程图、Python程序排错、硬件、网络拓扑和网络安全。通过标准答案和要点分析，帮助你查漏补缺，掌握高分答题技巧。
1. Binary to Denary Conversion | 二进制转十进制
Mock question: Convert the binary number 10110₂ into denary. Show full working. Solution: 16) + (0×8) + (1×4) + (1×2) + (0×1) = 16 + 0 + 4 + 2 + 0 = 22. Final answer: 22 in denary.
模拟题：将二进制数 10110₂ 转换成十进制，并写出完整步骤。解答：从最低位开始写出位权值：2⁰=1, 2¹=2, 2²=4, 2³=8, 2⁴=16。然后对应相乘相加：(1×16) + (0×8) + (1×4) + (1×2) + (0×1) = 16 + 0 + 4 + 2 + 0 = 22。最终结果：十进制为 22。
A common mistake is to align the binary bits with the wrong place values or to forget that the least significant bit is always on the right. Always double-check your column headings before adding.
常见错误是将二进制位与位权值对应错乱，或忘记最低有效位在最右侧。相加前请务必再次核对每列的权值。
2. Denary to Binary Conversion | 十进制转二进制
Mock question: Represent the denary number 43 as an 8-bit binary number. Solution: Reading remainders from bottom to top gives 101011₂. As an 8-bit number, pad with leading zeros: 00101011₂.
模拟题：将十进制数 43 表示为 8 位二进制数。解答：采用除以 2 取余法：43 ÷ 2 = 21 余 1，21 ÷ 2 = 10 余 1，10 ÷ 2 = 5 余 0，5 ÷ 2 = 2 余 1，2 ÷ 2 = 1 余 0，1 ÷ 2 = 0 余 1。从下往上读取余数得到 101011₂。扩展为 8 位，必须在左侧补零：00101011₂。
Many students forget to add leading zeros when the question asks for an 8-bit representation. Make sure you count the bits and, if fewer than 8, fill the left-hand side with zeros until you reach exactly 8 bits.
很多学生忘记题目要求用 8 位表示，结果直接写 101011₂ 而丢分。务必数清位数，不足 8 位时在左侧补零直到正好 8 位。
3. Binary Addition | 二进制加法
Mock question: Add the binary numbers 1011₂ and 1101₂. Show your carry bits. Solution: rry 1; 1 (carry) + 0 + 1 = 0, carry 1; 1 (carry) + 1 + 1 = 1, carry 1; finally write the extra carry as a new leftmost bit. Result: 11000₂ (which is 24, matching 11+13).
模拟题：计算二进制数 1011₂ 与 1101₂ 的和，并标出进位。解答：对齐两个数：1011 (十进制 11) 和 1101 (十进制 13)。从右向左逐位相加：1+1 = 0 进 1；1 (进位) + 1 + 0 = 0 进 1；1 (进位) + 0 + 1 = 0 进 1；1 (进位) + 1 + 1 = 1 进 1；最后将额外进位作为新的最高位写出。结果为 11000₂ (十进制 24，符合 11+13)。
When performing binary addition, always label the carry row above your numbers. It helps to avoid missing any carries, especially when three 1s need to produce a carry and a sum of 1.
进行二进制加法时，一定要在数字上方单独标注进位行。这样可以避免遗漏进位，尤其是当三个 1 相加需要产生进位并留下和为 1 时。
4. Hexadecimal and Binary | 十六进制与二进制转换
Mock question: Convert the binary number 11010110₂ into hexadecimal. Solution: ependently: 1101₂ = 13 (D in hex), 0110₂ = 6. Read the hex digits in the same order: D6₁₆.
模拟题：将二进制数 11010110₂ 转换为十六进制。解答：从右向左将二进制数分成 4 位一组（半字节）：1101 0110。分别转换：1101₂ = 13 (十六进制中用 D 表示)，0110₂ = 6。按顺序读出得到 D6₁₆。
Remember that the hexadecimal digits A–F represent denary values 10–15. When you get a result like 13, it must be replaced with the letter D. Writing '136' instead of D6 is a common error.
牢记十六进制数字 A–F 分别表示十进制 10–15。当计算结果为 13 时，必须写成字母 D。常见错误是直接写出 '136'，而正确答案应是 D6。
5. Logic Gates and Truth Tables | 逻辑门与真值表
Mock question: Complete the truth table for a two-input AND gate with inputs A and B, and output Q. Then explain when the output is 1. Solution: B=0 → Q=0; A=0, B=1 → Q=0; A=1, B=0 → Q=0; A=1, B=1 → Q=1. In Boolean terms, Q = A AND B.
模拟题：补全一个两输入与门（AND）的真值表，输入为 A 和 B，输出为 Q。并解释何时输出为 1。解答：与门仅在两个输入均为 1 时输出 1。真值表为：A=0, B=0 → Q=0；A=0, B=1 → Q=0；A=1, B=0 → Q=0；A=1, B=1 → Q=1。用布尔代数表示即 Q = A AND B。
In an exam, always draw the truth table with column headings clearly labelled. The order of rows is conventional but not essential; however, it is easier to check if you start with 00 and increase the input combination as if counting in binary.
考试时，真值表一定要清晰标注每列的表头。行顺序并非强制，但如按二进制计数的形式从 00 开始递增，会更容易核对。
6. Flowchart Symbols and Algorithm Tracing | 流程图符号与算法跟踪
Mock question: Identify the flowchart shape used to represent a decision (yes/no question) and explain what happens at that step in an algorithm. Solution: A diamond (rhombus) represents a decision. The algorithm reaches the diamond, evaluates a condition (e.g. 'Is x > 5?'), then follows the 'Yes' branch if the condition is true, or the 'No' branch if false. This creates selection (branching) in the program flow.
模拟题：指出用于表示判断（是/否问题）的流程图符号名称，并解释算法在该步骤的行为。解答：菱形代表判断。算法执行到菱形时，会评估一个条件（如 'x > 5?'），若条件为真则沿 '是' 分支继续，若为假则沿 '否' 分支继续。这实现了程序流中的选择（分支）结构。
Do not confuse the decision diamond with the parallelogram used for input/output or the rectangle used for processing. Labelling each symbol as you draw it can prevent mistakes.
不要将判断菱形与用于输入/输出的平行四边形或用于处理过程的矩形混淆。绘制时在每个符号旁标注其功能有助于避免误用。
7. Python Code Debugging | Python 代码排错
Mock question: The following Python code is meant to print 'Hello, world!' but contains two errors. Find and fix them. prit('Hello, world!'). Solution: Error 1: 'prit' is a misspelling of the function name; it should be 'print'. Error 2: the string literal uses a curly opening quotation mark and a straight closing mark, but Python requires straight quotes on both sides. The corrected code is print('Hello, world!').
模拟题：下面 Python 代码本意是打印 'Hello, world!'，但包含两处错误。找出并修正。prit('Hello, world!')。解答：错误 1：'prit' 是函数名拼写错误，应改为 'print'。错误 2：字符串引号不匹配——开引号为弯引号，闭引号为直引号。Python 要求两侧均为直引号。修正后的代码为 print('Hello, world!')。
Always check that every opening quotation mark has a matching closing quotation mark of the same type. A syntax error like this will prevent the whole script from running.
务必确保每个开引号都有类型一致、成对的闭引号。此类语法错误会导致整个脚本无法运行。
8. Computer Hardware Components | 计算机硬件组件
Mock question: Name the component responsible for executing program instructions and performing calculations. Describe its role with reference to the fetch-decode-execute cycle. Solution: The Central Processing Unit (CPU). The CPU fetches an instruction from memory, decodes it to determine what action is required, and then executes that action using its arithmetic/logic unit. This cycle repeats billions of times per second.
模拟题：说出负责执行程序指令和进行计算的组件名称，并结合取指-译码-执行周期描述其作用。解答：中央处理器（CPU）。CPU 从内存中取出一条指令，译码以确定需要执行的操作，接着利用其算术逻辑单元执行该操作。这个周期每秒钟重复数十亿次。
The CPU is often called the 'brain' of the computer. Make sure you can name all three stages of the cycle and explain that the clock speed (measured in GHz) determines how many cycles can be completed per second.
CPU 常被称为计算机的 '大脑'。请务必能说出周期的三个阶段，并解释时钟速度（以 GHz 为单位）决定了每秒可完成的周期数。
9. Network Topologies | 网络拓扑
Mock question: Describe one advantage and one disadvantage of a star network topology compared to a bus topology. Solution: Advantage: If one cable fails, only that single node is affected; the rest of the network continues to function. Disadvantage: The entire network depends on the central switch or hub. If that central device fails, the whole network goes down. Star topologies also use more cabling than bus topologies.
模拟题：与总线拓扑相比，说出星形网络拓扑的一个优点和一个缺点。解答：优点：单一电缆发生故障时，只有对应节点受影响，其余网络仍可正常工作。缺点：整个网络依赖中心交换机或集线器；若该中心设备故障，整个网络将瘫痪。星形拓扑比总线拓扑需要更多的电缆。
Many students correctly identify the single point of failure as a disadvantage but forget to mention it as the reason the star topology is more robust for individual connections. Be precise: the central device is a critical point, not the individual cables.
许多学生能正确指出单点故障是缺点，但忘记说明正因如此星形拓扑在个别连接上更健壮。请精准表达：关键点在于中心设备，而非各条电缆。
10. Cybersecurity – Brute Force Attacks | 网络安全 – 暴力破解攻击
Mock question: Explain what is meant by a brute force attack and give one way a system can defend against it. Solution: A brute force attack is a method of cracking a password by systematically trying every possible combination of characters until the correct one is found. This can be automated by software. Defence: implementing account lockout after a small number of failed login attempts (e.g. three tries) prevents an attacker from making unlimited guesses. Another defence is implementing a delay between login attempts.
模拟题：解释什么是暴力破解攻击，并给出一种系统防御此类攻击的方法。解答：暴力破解攻击是一种通过系统尝试所有可能的字符组合来破解密码的方法，直到找到正确密码。该过程可由软件自动完成。防御方式：实施账户锁定策略，在少量登录失败尝试（如三次）后锁定账户，阻止攻击者无限制猜测。另一种防御是在登录尝试之间增加延迟。
Brute force attacks are effective against short, simple passwords. Using long passwords with a mix of character types makes the number of possible combinations so large that the attack becomes impractical. Always mention 'account lockout' as a key countermeasure.
暴力破解对短小简单的密码尤其有效。使用包含多种字符类型的长密码可大幅增加组合数量，使攻击难以实施。答题时务必把 '账户锁定' 列为关键对策。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图