📚 GCSE CCEA Computer Science: Typical Example Questions Explained | GCSE CCEA 计算机：典型例题详解
This revision guide walks you through typical CCEA GCSE Computer Science exam questions, showing step-by-step methods and common pitfalls. Each section pairs an English explanation with a Chinese translation, so you can build confidence whether you are learning in English, Chinese, or both.
本复习指南带你演练 CCEA GCSE 计算机科学的典型考题，逐步展示解题方法和常见错误。每个部分都提供英文解释和中文翻译，帮助你在双语学习或英文学术环境中建立信心。
1. Binary to Denary Conversion | 二进制转十进制
(32), 2⁴(16), 2³(8), 2²(4), 2¹(2), 2⁰(1). Multiply each bit by its place value: 0×128 = 0, 1×64 = 64, 1×32 = 32, 0×16 = 0, 1×8 = 8, 0×4 = 0, 0×2 = 0, 1×1 = 1. Sum = 64 + 32 + 8 + 1 = 105.
例题：将8位二进制数 01101001 转换为十进制。从右到左标出位权：2⁷(128)、2⁶(64)、2⁵(32)、2⁴(16)、2³(8)、2²(4)、2¹(2)、2⁰(1)。每位乘以其位权：0×128=0，1×64=64，1×32=32，0×16=0，1×8=8，0×4=0，0×2=0，1×1=1。总和 = 64+32+8+1=105。
2. Denary to Binary Conversion | 十进制转二进制
39 ÷ 2 = 19 rem 1; 19 ÷ 2 = 9 rem 1; 9 ÷ 2 = 4 rem 1; 4 ÷ 2 = 2 rem 0; 2 ÷ 2 = 1 rem 0; 1 ÷ 2 = 0 rem 1. Read the remainders from bottom to top: 1001110. Pad with a leading 0 to make 8 bits: 01001110.
例题：将十进制数 78 转换为8位二进制数。方法：反复除以2，记录余数，直到商为0。78 ÷ 2 = 39 余 0；39 ÷ 2 = 19 余 1；19 ÷ 2 = 9 余 1；9 ÷ 2 = 4 余 1；4 ÷ 2 = 2 余 0；2 ÷ 2 = 1 余 0；1 ÷ 2 = 0 余 1。从下往上读取余数得 1001110。补上前导0成8位：01001110。
3. Hexadecimal to Binary | 十六进制转二进制
nswer is a 12-bit binary number. Conversely, to convert binary 11011010 to hex, split into nibbles: 1101 = D, 1010 = A → DA.
例题：将十六进制数 A3F 转换为二进制。拆分每个十六进制位：A = 1010，3 = 0011，F = 1111。组合起来：1010 0011 1111 → 101000111111，得到12位二进制数。反之，将二进制 11011010 转换为十六进制时，先分成半字节：1101 = D，1010 = A → DA。
4. Logic Gates and Truth Tables | 逻辑门与真值表
OR the two intermediate results. A=0,B=0,C=0: A AND B=0, NOT C=1, Q=1. Continue for all 8 rows. The full truth table shows Q=1 for rows where either A and B are both 1, or C is 0.
例题：画出电路 Q = (A AND B) OR (NOT C) 的真值表。列出 A、B、C 的所有组合（0或1）。计算 A AND B，计算 NOT C，再将两个中间结果进行 OR 运算。A=0,B=0,C=0：A AND B=0，NOT C=1，Q=1。以此类推完成8行。完整的真值表显示，当 A 和 B 均为 1，或者 C 为 0 时，Q = 1。
| 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 |
5. Pseudocode: Finding the Maximum | 伪代码：查找最大值
urrent element > Max, set Max = current element. Return Max. Typical CCEA syntax uses FOR loop and IF statements with indentation.
Max ← numbers[0]
FOR i ← 1 TO 9
IF numbers[i] > Max THEN
Max ← numbers[i]
ENDIF
ENDFOR
OUTPUT Max
例题：编写伪代码，找出包含10个整数的数组中的最大值。将变量 Max 设为第一个元素。从索引1循环至9：若当前元素大于 Max，则令 Max = 当前元素。最后返回 Max。典型的 CCEA 伪代码风格使用 FOR 循环和带缩进的 IF 语句。
6. Tracing an Algorithm | 算法跟踪
tep 3: x=7, y=5 → false, loop ends. Final values: x=7, y=5, loop executes 2 times. Trace tables should show each iteration clearly.
例题：跟踪以下算法：x = 3，y = 7；while x < y：x = x + 2，y = y - 1。步骤1：x=3，y=7 → 条件成立，x=5，y=6。步骤2：x=5，y=6 → 条件成立，x=7，y=5。步骤3：x=7，y=5 → 条件不成立，循环结束。最终值：x=7，y=5，循环执行2次。跟踪表应清晰显示每次迭代。
7. Arrays and Indexing | 数组与索引
Example: Given the array names = ['Alice', 'Bob', 'Chloe', 'David'], what is names[2]? Remember indexes usually start at 0. So names[0]='Alice', names[2]='Chloe'. If the program assigns names[1] = 'Ben', the array becomes ['Alice', 'Ben', 'Chloe', 'David']. Questions often test understanding of zero-based indexing and array updates.
例题：给定数组 names = ['Alice', 'Bob', 'Chloe', 'David']，names[2] 是什么？注意索引通常从0开始，因此 names[0]='Alice'，names[2]='Chloe'。如果执行 names[1] = 'Ben'，数组变为 ['Alice', 'Ben', 'Chloe', 'David']。此类题目常考查对从零开始的索引以及数组更新的理解。
8. Network Topologies | 网络拓扑
Example: Compare a star topology and a bus topology. In a star, all devices connect to a central switch. Advantage: if one cable fails, only that device is affected; easier to troubleshoot. Disadvantage: if the central switch fails, the whole network goes down. In a bus, all devices share a single backbone cable. Advantage: cheap and easy to install for small networks. Disadvantage: a break in the backbone can take down the whole segment, and performance degrades with many devices. CCEA often asks for diagrams alongside explanations.
例题：比较星型拓扑和总线拓扑。在星型网络中，所有设备都连接到中央交换机。优点：一条线缆故障只影响该设备，故障排除更方便；缺点：中央交换机故障会导致全网瘫痪。在总线型网络中，所有设备共享一条主干线缆。优点：小型网络安装便宜简单；缺点：主干线路断开会影响整个网段，且设备增多时性能下降。CCEA 常要求结合图示说明。
9. Cybersecurity Threats | 网络安全威胁
Example: Describe a phishing attack and one way to prevent it. Phishing is when an attacker sends a deceptive email that appears to be from a trusted source, tricking the user into revealing passwords or financial details. Prevention: use multi-factor authentication, educate users not to click suspicious links, and employ spam filters. Exam answers should provide clear, concise definitions and practical countermeasures.
例题：描述网络钓鱼攻击及一种防范方法。网络钓鱼指攻击者发送看似来自可信来源的欺骗性邮件，诱使用户泄露密码或金融信息。防范措施：使用多因素认证，教育用户不要点击可疑链接，并采用垃圾邮件过滤器。考试答案应给出清晰简洁的定义和切实可行的对策。
10. SQL Queries | SQL 查询
Example: A database table Students has fields StudentID, Name, Grade. Write an SQL query to retrieve the names of all students with Grade 'A'. Query: SELECT Name FROM Students WHERE Grade = 'A'; To count the number of such students: SELECT COUNT(*) FROM Students WHERE Grade = 'A'; Always use single quotes for strings in CCEA SQL questions unless told otherwise.
例题：数据库表 Students 包含字段 StudentID、Name、Grade。编写 SQL 查询，检索所有 Grade 为 'A' 的学生姓名。查询语句：SELECT Name FROM Students WHERE Grade = 'A'; 若要统计这些学生的人数：SELECT COUNT(*) FROM Students WHERE Grade = 'A'; 在 CCEA 的 SQL 题目中，除非特别说明，字符串统一使用单引号。
11. Binary Addition | 二进制加法
column. 01011011 + 00101001 = 10000100. Verify in denary: 91 + 41 = 132, and 10000100 in binary is indeed 128+4 = 132. Watch for overflow if the result exceeds 8 bits.
例题：将8位二进制数 01011011 与 00101001 相加。从右向左逐列相加，当两个1产生进位时，进到下一列。01011011 + 00101001 = 10000100。用十进制验证：91 + 41 = 132，而二进制 10000100 即为 128+4=132。注意若结果超出8位，则发生溢出。
12. Data Compression | 数据压缩
Example: Explain the difference between lossy and lossless compression, and give a use case for each. Lossless compression reduces file size without losing any original data; it is used for text files and executable programs (e.g., ZIP). Lossy compression permanently removes some data to achieve smaller sizes; it is suitable for images and audio where a slight quality loss is acceptable (e.g., JPEG, MP3). CCEA expects you to recall advantages and trade-offs.
例题：解释有损压缩和无损压缩的区别，并各举一个应用场景。无损压缩在减小文件大小的同时不丢失任何原始数据，适用于文本文件和可执行程序（例如 ZIP）。有损压缩会永久移除部分数据以实现更小的体积，适用于图像和音频等允许轻微质量损失的场合（例如 JPEG、MP3）。CCEA 要求考生能回忆优势与权衡。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图