📚 GCSE AQA Computer Science: Typical Exam Questions Explained in Detail | GCSE AQA 计算机：典型例题详解
In GCSE AQA Computer Science, mastering typical exam-style questions is essential for achieving top marks. This article walks you through ten common question types, from binary conversion to computational thinking, providing detailed explanations, step-by-step methods, and examiner tips. Each section is presented in both English and Chinese to support bilingual learners and reinforce key concepts.
在 GCSE AQA 计算机科学中，掌握典型的考试题型是取得高分的关键。本文将通过十个常见题型，从二进制转换到计算思维，提供详细的解析、分步方法和考官提示。每个部分都以中英双语呈现，帮助双语学习者巩固核心概念。
1. Binary to Hexadecimal Conversion | 二进制转十六进制转换
Example question: Convert the 8-bit binary number 10111100 into hexadecimal. Show your working.
例题：将8位二进制数 10111100 转换为十六进制，并写出你的解题步骤。
To convert binary to hexadecimal, group the binary digits into nibbles (sets of four bits) starting from the right. Then convert each 4-bit nibble into its hexadecimal equivalent using the mapping: 0000=0, 0001=1, … 1010=A, 1011=B, 1100=C, 1101=D, 1110=E, 1111=F.
要将二进制转换为十六进制，从右往左将二进制位每四位一组进行划分。然后将每个4位半字节转换为十六进制数字，对应关系为：0000=0, 0001=1, …, 1010=A, 1011=B, 1100=C, 1101=D, 1110=E, 1111=F。
For 10111100, group as 1011 and 1100. 1011₂ = 11₁₀ = B₁₆. 1100₂ = 12₁₀ = C₁₆. Therefore, the hexadecimal representation is BC.
对于 10111100，分组为 1011 和 1100。1011₂ = 11₁₀ = B₁₆；1100₂ = 12₁₀ = C₁₆。因此，十六进制表示为 BC。
Final answer: 10111100₂ = BC₁₆. Always show your grouping steps to gain full marks.
最终答案：10111100₂ = BC₁₆。务必展示分组步骤以获得满分。
2. Boolean Logic and Truth Tables | 布尔逻辑与真值表
Example question: Construct a truth table for the logic expression Q = (A AND B) OR (NOT C).
例题：为逻辑表达式 Q = (A AND B) OR (NOT C) 构造一个真值表。
A truth table lists all possible input combinations and the resulting output. For three inputs (A, B, C), there are 2³ = 8 rows. Evaluate intermediate columns: NOT C, A AND B, and then the final OR.
真值表列出所有可能的输入组合及对应的输出。对于三个输入（A, B, C），共有 2³ = 8 行。逐步计算中间列：NOT C，A AND B，最后再进行 OR 运算。
| A | B | C | NOT C | A AND B | Q |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 | 1 |
Notice that Q is 1 when C=0 regardless of A and B, or when both A and B are 1. Always double-check the intermediate columns to avoid simple errors.
注意当 C=0 时，无论 A 和 B 为何值 Q 都为 1；或者当 A 和 B 同时为 1 时 Q 也为 1。务必仔细核对中间列，避免简单错误。
3. Linear Search Algorithm | 线性搜索算法
Example question: An array stores the numbers [5, 12, 7, 3, 9, 15]. Use a linear search to find the value 9. Show each step and state the index where it is found.
例题：数组存储了数字 [5, 12, 7, 3, 9, 15]。使用线性搜索查找数值 9。展示每一步骤，并说明在哪个索引位置找到它。
Linear search checks each element one by one from the beginning. Step 1: compare element at index 0 (5) with 9 – not equal. Step 2: index 1 (12) – no. Step 3: index 2 (7) – no. Step 4: index 3 (3) – no. Step 5: index 4 (9) – match found. The search stops, and the index 4 is returned.
线性搜索从开头逐个检查每个元素。步骤1：比较索引0处的元素（5）与9——不相等。步骤2：索引1（12）——不等。步骤3：索引2（7）——不等。步骤4：索引3（3）——不等。步骤5：索引4（9）——匹配成功。搜索停止，返回索引4。
Pseudocode representation: for i = 0 to length-1, if array[i] == target then output i. This algorithm has a worst-case time complexity of O(n).
伪代码表示：for i = 0 到 length-1，若 array[i] == target 则输出 i。该算法在最坏情况下的时间复杂度为 O(n)。
4. Bubble Sort Algorithm | 冒泡排序算法
Example question: Sort the following list using bubble sort: [8, 3, 5, 1, 9, 2]. Show the list after each complete pass.
例题：使用冒泡排序对列表 [8, 3, 5, 1, 9, 2] 进行排序。展示每一趟完整扫描后的列表状态。
Bubble sort repeatedly steps through the list, compares adjacent items and swaps them if they are in the wrong order. After each pass, the largest unsorted element ‘bubbles’ to its correct position.
冒泡排序反复遍历列表，比较相邻元素并在顺序错误时交换它们。每完成一趟，最大的未排序元素就会“冒泡”到正确位置。
Original: [8, 3, 5, 1, 9, 2]
Pass 1: compare 8 and 3 → swap → [3, 8, 5, 1, 9, 2]; 8 and 5 → swap → [3, 5, 8, 1, 9, 2]; 8 and 1 → swap → [3, 5, 1, 8, 9, 2]; 8 and 9 → no swap; 9 and 2 → swap → [3, 5, 1, 8, 2, 9].
Pass 2: [3, 1, 5, 2, 8, 9].
Pass 3: [1, 3, 2, 5, 8, 9].
Pass 4: [1, 2, 3, 5, 8, 9].
Pass 5: no swaps → list is sorted.
初始：[8, 3, 5, 1, 9, 2]
第一趟：比较8和3 → 交换 → [3, 8, 5, 1, 9, 2]；8和5交换 → [3, 5, 8, 1, 9, 2]；8和1交换 → [3, 5, 1, 8, 9, 2]；8和9不交换；9和2交换 → [3, 5, 1, 8, 2, 9]。
第二趟：[3, 1, 5, 2, 8, 9]。
第三趟：[1, 3, 2, 5, 8, 9]。
第四趟：[1, 2, 3, 5, 8, 9]。
第五趟：无交换 → 列表已排序。
5. Pseudocode to Flowchart | 伪代码转流程图
Example question: Here is a pseudocode snippet:
INPUT num
IF num MOD 2 = 0 THEN
OUTPUT ‘Even’
ELSE
OUTPUT ‘Odd’
ENDIF
Draw a flowchart for this algorithm.
例题：以下是一段伪代码：
INPUT num
IF num MOD 2 = 0 THEN
OUTPUT ‘Even’
ELSE
OUTPUT ‘Odd’
ENDIF
请为该算法绘制流程图。
A flowchart uses standard symbols: an oval for Start/End, a parallelogram for Input/Output, a diamond for Decision, and rectangles for processes. The flow is represented by arrows.
流程图使用标准符号：椭圆形表示开始/结束，平行四边形表示输入/输出，菱形表示判断，矩形表示处理步骤。流程用箭头表示。
Start → Input num (parallelogram) → Decision diamond containing ‘num MOD 2 = 0?’. If true → Output ‘Even’ (parallelogram) → End. If false → Output ‘Odd’ (parallelogram) → End. Both paths converge to the End oval.
开始 → 输入 num（平行四边形） → 判断菱形，内容为 ‘num MOD 2 = 0?’。若为真 → 输出 ‘Even’（平行四边形） → 结束。若为假 → 输出 ‘Odd’（平行四边形） → 结束。两条路径最终汇聚到结束椭圆形。
6. Network Protocols and Security | 网络协议与安全
Example question: Explain two reasons why websites that handle online payments should use HTTPS instead of HTTP.
例题：解释为什么处理在线支付的网站应使用 HTTPS 而不是 HTTP，给出两个理由。
HTTP (Hypertext Transfer Protocol) transmits data in plain text, making it vulnerable to interception. HTTPS (HTTP Secure) uses SSL/TLS to encrypt data, providing confidentiality. First, encryption prevents attackers from reading sensitive information such as credit card numbers during transmission. Second, HTTPS enables authentication via digital certificates, assuring users that they are connected to the legitimate website and not an imposter.
HTTP（超文本传输协议）以明文形式传输数据，容易被截获。HTTPS（安全超文本传输协议）使用 SSL/TLS 加密数据，提供机密性。首先，加密可防止攻击者在传输过程中读取信用卡号等敏感信息。其次，HTTPS 通过数字证书实现身份验证，确保用户连接的是合法网站而不是假冒者。
Additionally, HTTPS uses port 443 and relies on a handshake process to establish a secure session. Always mention both encryption and authentication for full marks in AQA exams.
此外，HTTPS 使用端口 443，并依赖握手过程建立安全会话。在 AQA 考试中，务必同时提到加密和身份验证以获得满分。
7. Data Validation and Verification | 数据验证与校验
Example question: A database field stores a student’s age. Suggest two validation checks and provide an example of invalid data each would catch.
例题：一个数据库字段存储学生的年龄。请建议两种验证检查，并分别给出它们能捕获的无效数据示例。
Validation ensures data is sensible and reasonable before it enters the system. A range check can verify that the age falls within an acceptable range, e.g., 0 to 120. Entering -5 or 200 would be rejected. A presence check ensures the field is not left empty; a blank entry would fail this check and trigger an error message.
验证在数据进入系统前确保其合理有效。范围检查可以验证年龄是否在可接受的范围内，例如 0 到 120。输入 -5 或 200 将被拒绝。存在检查确保字段不为空；空白输入将无法通过此检查并触发错误提示。
Other checks like length check or type check are also useful, but the question specifically asks for two. Always match the check to the data type.
其他检查（如长度检查或类型检查）也很有用，但题目要求给出两种。始终根据数据类型选择适当的检查。
8. Subroutines and Parameters | 子程序与参数
Example question: Write a pseudocode subroutine called calculateArea that accepts length and width as parameters and returns the area of a rectangle. Then show how to call it with length = 5 and width = 3.
例题：编写一个名为 calculateArea 的伪代码子程序，接受长度和宽度作为参数，并返回矩形的面积。然后展示如何使用 length = 5 和 width = 3 调用它。
Subroutines (procedures/functions) promote modular programming. Parameters allow values to be passed into the subroutine. The subroutine header might be: SUBROUTINE calculateArea(length, width). Inside, area = length * width, then RETURN area.
子程序（过程/函数）促进了模块化编程。参数允许将值传入子程序。子程序头部可为：SUBROUTINE calculateArea(length, width)。内部计算 area = length * width，然后 RETURN area。
Full pseudocode:
SUBROUTINE calculateArea(l, w)
area = l * w
RETURN area
ENDSUBROUTINE
Calling code: result = calculateArea(5, 3) // result becomes 15.
完整伪代码：
SUBROUTINE calculateArea(l, w)
area = l * w
RETURN area
ENDSUBROUTINE
调用代码：result = calculateArea(5, 3) // result 变为 15。
9. Cybersecurity Threats and Mitigation | 网络安全威胁与缓解
Example question: Describe what a Denial of Service (DoS) attack is and explain one method a network administrator can use to protect against it.
例题：描述什么是拒绝服务（DoS）攻击，并解释网络管理员可以使用的一种防护方法。
A DoS attack floods a server or network with excessive traffic, overwhelming its resources so that legitimate users cannot access services. One protection method is to configure a firewall to filter traffic and block requests from suspicious IP addresses. Rate limiting can also restrict the number of requests from a single source. Additionally, intrusion prevention systems (IPS) can detect and mitigate such attacks in real time.
DoS 攻击通过大量流量淹没服务器或网络，耗尽资源，导致合法用户无法访问服务。一种防护方法是配置防火墙过滤流量并拦截来自可疑 IP 地址的请求。速率限制也可以约束单个来源的请求数量。此外，入侵防御系统（IPS）能够实时检测并缓解此类攻击。
The question asks for one method, so develop your answer with a clear technical explanation rather than a list.
题目要求解释一种方法，因此应给出清晰的技术说明，而非罗列清单。
10. Computational Thinking – Decomposition and Abstraction | 计算思维——分解与抽象
Example question: A team is developing a fitness tracking app. Explain how decomposition and abstraction can be applied during the design of this app.
例题：一个团队正在开发一款健身追踪应用。解释在设计该应用时如何应用分解和抽象。
Decomposition involves breaking a complex problem into smaller, manageable sub-problems. For the fitness app, the overall task can be decomposed into modules such as heart rate monitoring, step counting, calorie calculation, GPS tracking, and user interface.
分解是将复杂问题拆分为更小、更易管理的子问题。对于健身应用，整个任务可以分解为心率监测、步数计数、卡路里计算、GPS 追踪和用户界面等模块。
Abstraction is the process of focusing on essential features while ignoring irrelevant details. For example, when designing the step counting module, the developers abstract away the specifics of the accelerometer hardware and work with a simplified model that provides step count data. Similarly, the calorie calculator ignores individual metabolic variations and uses a standard formula based on weight, age, and activity.
抽象是关注基本特性而忽略无关细节的过程。例如，在设计步数计数模块时，开发人员会抽象掉加速度计硬件的具体细节，使用一个提供步数数据的简化模型。同样，卡路里计算器忽略个体新陈代谢差异，使用基于体重、年龄和活动的标准公式。
Together, decomposition and abstraction reduce complexity and allow parallel development. In an AQA exam, always link the definition directly to the scenario.
分解和抽象共同降低了复杂程度，并允许并行开发。在 AQA 考试中，始终将定义与具体情境直接关联。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导