📚 AS Eduqas Computer Science: Unit Test Mock Paper Walkthrough | AS Eduqas 计算机：单元测试模拟卷解析
Mock exams are a crucial part of revision for AS Computer Science. In this article, we will break down a typical unit test paper for the Eduqas board, covering key topics from Component 1 (Computer Systems) and Component 2 (Computational Thinking and Programming). Each question is analysed step‑by‑step, highlighting common pitfalls and essential mark‑winning techniques.
模拟考试是AS计算机科学复习的关键部分。在本文中，我们将解析一份典型的Eduqas考试局单元测试卷，涵盖组件1（计算机系统）和组件2（计算思维与编程）的核心主题。每道题目均逐步分析，突出常见陷阱和必备得分技巧。
1. Exam Format Overview | 考试格式概览
Eduqas AS Computer Science unit tests typically assess a mix of theory and practical skills. A paper may contain short‑answer questions, binary calculations, logic circuit analysis, algorithm tracing, programming error‑spotting, and data‑handling tasks. Marks are often allocated for clear working steps, not just final answers.
Eduqas AS计算机科学单元测试通常考察理论与实操技能的综合。试卷可能包含简答题、二进制计算、逻辑电路分析、算法追踪、编程查错和数据处理任务。评分往往依据清晰的解题步骤，而不仅仅是最终答案。
Understanding the command words is vital. ‘State’ requires a concise fact, ‘Describe’ asks for characteristics, and ‘Explain’ expects reasoning or cause‑and‑effect. Pay close attention to the number of marks as a guide to how much detail to provide.
理解指令词至关重要。“State”（陈述）要求一个简洁的事实，“Describe”（描述）问的是特征，“Explain”（解释）则需要论证或因果关系。要密切关注分值，它提示了答案的详细程度。
2. Q1: Number Systems & Two’s Complement | 第1题：数制与二进制补码
Mock question: Convert the decimal value –55 into 8‑bit two’s complement binary. Show all working.
模拟题目：将十进制数 –55 转换为 8 位二进制补码。请展示全部步骤。
First, write the positive value 55 in unsigned 8‑bit binary. 55 = 32 + 16 + 4 + 2 + 1, giving 00110111₂.
首先，将正数 55 写为无符号 8 位二进制。55 = 32 + 16 + 4 + 2 + 1，得到 00110111₂。
Invert all the bits to find the one’s complement: 11001000₂.
将所有位取反得到反码：11001000₂。
Add 1 to the one’s complement to obtain the two’s complement. 11001000₂ + 1₂ = 11001001₂.
在反码上加 1 得到补码。11001000₂ + 1₂ = 11001001₂。
–55₁₀ → 11001001₂ (8‑bit two’s complement)
–55₁₀ → 11001001₂（8位补码）
Always check the most significant bit is 1 for a negative number. A common mistake is forgetting to invert all 8 bits, including leading zeros.
务必检查负数最高位为 1。常见错误是忘记将所有 8 位（包括前导零）全部取反。
If asked to state whether overflow occurs during an addition, compare the carry‑in and carry‑out of the most significant bit. If they differ, an overflow has occurred.
如果题目要求判断加法过程中是否发生溢出，需要比较最高位的进位输入与进位输出。若两者不同，则发生了溢出。
3. Q2: Logic Gates & Truth Tables | 第2题：逻辑门与真值表
Mock question: For the circuit with inputs A, B, C where Q = (A AND B) OR (NOT C), draw the truth table and give the Boolean expression.
模拟题目：对于输入为 A、B、C、输出 Q = (A AND B) OR (NOT C) 的电路，画出真值表并写出布尔表达式。
The expression is already supplied, but you must reproduce it clearly: Q = (A · B) + 𝐶̅ (using dot for AND, plus for OR, overbar for NOT).
表达式已经给出，但你需要清晰地复现它：Q = (A · B) + 𝐶̅（点号表示 AND，加号表示 OR，上划线表示 NOT）。
Construct the truth table row by row. Evaluate A AND B first, then NOT C, then the final OR.
逐行构建真值表。先求 A AND B，再求 NOT C，最后求最终的 OR。
| A | B | C | A AND B | NOT C | Q |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 1 |
The truth table shows the output is 1 when C is 0, or when both A and B are 1. Understanding the intermediate columns helps avoid errors.
真值表显示，当 C 为 0 或当 A 与 B 同时为 1 时，输出为 1。理解中间过渡列有助于避免错误。
When drawing logic gate diagrams by hand, use the correct symbols: a D‑shape for AND, a shield for OR, and a triangle with a bubble for NOT.
手绘逻辑门图时，请使用正确的符号：AND 用 D 形，OR 用盾形，NOT 用带圆圈的三角形。
4. Q3: Data Structures & Algorithm Tracing | 第3题：数据结构与算法追踪
Mock question: Apply a bubble sort to the list [7, 3, 9, 1, 5]. Show the list after the first two passes.
模拟题目：对列表 [7, 3, 9, 1, 5] 应用冒泡排序算法。展示前两趟排序后的列表。
Pass 1: Compare adjacent elements and swap if out of order. 7 and 3 → swap → [3, 7, 9, 1, 5]. 7 and 9 → no swap. 9 and 1 → swap → [3, 7, 1, 9, 5]. 9 and 5 → swap → [3, 7, 1, 5, 9]. After pass 1 the largest element, 9, is in its correct final position.
第一趟：比较相邻元素，若顺序错误则交换。7 与 3 → 交换 → [3, 7, 9, 1, 5]。7 与 9 → 不交换。9 与 1 → 交换 → [3, 7, 1, 9, 5]。9 与 5 → 交换 → [3, 7, 1, 5, 9]。第一趟过后，最大的元素 9 已到达最终正确位置。
Pass 2: Consider elements up to index 3 (ignore the last). 3 and 7 → no swap. 7 and 1 → swap → [3, 1, 7, 5, 9]. 7 and 5 → swap → [3, 1, 5, 7, 9]. After pass 2, the two largest elements (7 and 9) are in place.
第二趟：只考虑前四个元素（忽略最后一位）。3 与 7 → 不交换。7 与 1 → 交换 → [3, 1, 7, 5, 9]。7 与 5 → 交换 → [3, 1, 5, 7, 9]。第二趟后，最大的两个元素（7 和 9）已就位。
In an exam, always show your working step‑by‑step as marks are given for correct intermediate states.
在考试中，务必逐步展示过程，因为中间状态正确也能得分。
5. Q4: Programming Error Spotting & Trace Tables | 第4题：编程查错与追踪表
Mock question: The following Python function is intended to calculate the factorial of n. Identify the error and complete a trace table for n = 4.
def factorial(n):
result = 0
for i in range(2, n):
result = result * i
return result
模拟题目：下面的 Python 函数用于计算 n 的阶乘。找出错误，并针对 n = 4 完成追踪表。
The error is that result is initialised to 0 instead of 1, and the loop starts from 2 while missing n and 1. Multiplying by 0 will always give 0, so the function returns 0 for any n.
错误在于 result 初始化为 0 而非 1，并且循环从 2 开始，却遗漏了 n 和 1。任何数乘以 0 始终为 0，所以该函数始终返回 0。
Corrected code should set result = 1 and use for i in range(1, n+1): or start at 2 but include n.
正确的代码应设置 result = 1，并使用 for i in range(1, n+1):，或从 2 开始但将 n 包含在内。
| Iteration | i | result (before) | result (after) |
|---|---|---|---|
| 1 | 2 | 0 | 0 |
| 2 | 3 | 0 | 0 |
The trace table shows the bug clearly – result remains 0 throughout. After correcting the code, the expected factorial of 4 is 24.
追踪表清晰地展示了这个缺陷——result 始终为 0。修正代码后，4 的阶乘应为 24。
6. Q5: Computer Architecture – Fetch‑Decode‑Execute | 第5题：计算机体系结构——取指‑解码‑执行
Mock question: Describe the role of the Program Counter (PC) and Memory Address Register (MAR) in the fetch stage of the cycle.
模拟题目：描述程序计数器 (PC) 和内存地址寄存器 (MAR) 在取指周期阶段的作用。
The PC holds the address of the next instruction to be fetched. Its content is copied into the MAR at the start of the fetch phase.
PC 保存下一条要取的指令地址。在取指阶段开始时，其内容被复制到 MAR 中。
The MAR then sends this address along the address bus to main memory, allowing the control unit to read the instruction stored at that location.
随后 MAR 将该地址通过地址总线送至主存，使控制单元能够读取存储在该位置的指令。
After fetching, the PC is incremented by 1 (or by the length of the instruction in words) so that it points to the next instruction in sequence, unless a jump instruction alters the flow.
取指过后，PC 的值加 1（或加上指令的字长度），从而指向序列中的下一条指令，除非跳转指令改变了流程。
In examinations, distinguish between the PC (incremented before the execute phase) and the Current Instruction Register (CIR), which holds the instruction being executed.
在考试中，注意区分 PC（在执行阶段前递增）和当前指令寄存器 (CIR)，后者存放正在执行的指令。
7. Q6: Networks & TCP/IP Layers | 第6题：网络与 TCP/IP 层次模型
Mock question: Explain how the Transport layer in TCP/IP ensures reliable data delivery, and contrast it with the Link layer.
模拟题目：解释 TCP/IP 模型中的传输层如何确保数据的可靠交付，并将其与链路层进行对比。
The Transport layer, using protocols like TCP, provides reliability through sequence numbers, acknowledgements, and retransmission of lost packets. It also handles flow control and error checking.
传输层通过 TCP 等协议，利用序列号、确认应答以及丢失数据包的重传来保证可靠性。它还负责流量控制和错误校验。
In contrast, the Link layer (e.g., Ethernet) operates on the local network segment. It frames data and uses MAC addresses for delivery, but it does not guarantee end‑to‑end reliability – that is left to higher layers.
相比之下，链路层（如以太网）在本地网段上工作。它将数据封装成帧，并使用 MAC 地址进行传输，但不保证端到端的可靠性——这由更高层负责。
When answering such questions, use OSI/TCP‑IP terminology precisely. Mentioning ‘three‑way handshake’ or ‘windowing’ demonstrates deeper understanding.
回答此类问题时，要准确使用 OSI/TCP‑IP 术语。提到“三次握手”或“窗口机制”可以体现更深的理解。
8. Q7: Databases & SQL Queries | 第7题：数据库与 SQL 查询
Mock question: A table named Pupils contains fields PupilID, Name, YearGroup, and AverageScore. Write an SQL query to fetch the names and scores of all Year 12 pupils whose average score exceeds 70, ordered by score descending.
模拟题目：名为 Pupils 的表包含字段 PupilID、Name、YearGroup 和 AverageScore。请写出一条 SQL 查询，提取所有 Year 12 且平均分超过 70 的学生的姓名和分数，并按分数降序排列。
The correct query is: SELECT Name, AverageScore FROM Pupils WHERE YearGroup = 'Year 12' AND AverageScore > 70 ORDER BY AverageScore DESC;
正确的查询语句为：SELECT Name, AverageScore FROM Pupils WHERE YearGroup = 'Year 12' AND AverageScore > 70 ORDER BY AverageScore DESC;
Always remember the semicolon at the end of an SQL statement. Use ORDER BY ... DESC for descending order and ASC for ascending. Enclose string literals in single quotes.
务必记得 SQL 语句末尾的分号。使用 ORDER BY ... DESC 实现降序排列，ASC 实现升序。字符串字面量要用单引号括起。
If asked to explain normalisation, refer to reducing data redundancy and avoiding update anomalies by splitting tables into relations linked by primary/foreign keys.
如果题目要求解释规范化，应提到通过将表拆分成由主键/外键关联的关系可以减少数据冗余并避免更新异常。
9. Q8: Ethical, Legal & Environmental Impacts | 第8题：伦理、法律与环境影响
Mock question: Discuss the ethical implications of using facial recognition software in public spaces.
模拟题目：论述在公共场所使用面部识别软件所涉及的伦理问题。
Facial recognition can enhance security and help find missing persons, but it raises serious privacy concerns. Mass surveillance can create a chilling effect on personal freedom and may lead to data misuse.
面部识别可以加强安全并帮助寻找失踪人员，但它引发了严重的隐私担忧。大规模监控可能对个人自由产生寒蝉效应，并可能导致数据滥用。
Ethically, developers should consider bias in training data, as inaccuracies can disproportionately affect minority groups. Legally, compliance with data protection laws such as GDPR is essential – individuals must consent or be informed about data collection.
在伦理上，开发者应考虑训练数据中的偏见，因为不准确的结果可能对少数群体造成不成比例的影响。在法律层面，必须遵守如 GDPR 等数据保护法——个人必须同意数据收集或至少知情。
When answering such questions, structure your response around stakeholders (public, law enforcement, developers) and balance positive and negative impacts.
回答此类问题时，应围绕利益相关方（公众、执法机构、开发者）组织论点，并平衡正面与负面影响。
10. Final Tips for Success | 成功备考建议
Practice under timed conditions with past papers to build speed. For calculation questions, always show working – even a partially correct step can earn marks. Read the question twice to ensure you have identified all the requirements.
用历年真题进行计时练习以提升做题速度。对于计算题，务必展示过程——即便是部分正确的步骤也可能得分。仔细阅读题目两遍，确保你已识别出所有要求。
For programming tasks, write neat, well‑indented code and annotate your logic. When tracing algorithms, use a structured trace table. Finally, manage your time:
Published by TutorHao | AS Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导