📚 Year 11 Cambridge Computer Science: Interdisciplinary Integrated Practice Questions | 剑桥11年级计算机：跨学科综合题型训练
Mastering Cambridge IGCSE Computer Science requires much more than recalling facts about hardware and software. The most challenging examination questions often place core computing concepts into unfamiliar settings drawn from mathematics, physics, biology, geography, and even law. These interdisciplinary problems test your ability to transfer knowledge, analyse real-world scenarios, and construct logical solutions. This article provides a carefully designed set of integrated practice questions that mirror the style and rigour of Year 11 assessments. You will work with binary arithmetic, logic circuits, algorithm tracing, data errors, database design, network physics, cryptography, ethical dilemmas, scientific flowcharts, and simulation modelling. Each section pairs a sample problem with a detailed explanation, so you can deepen your understanding and build the flexible thinking needed for top grades.
掌握剑桥IGCSE计算机科学远不止记住硬件和软件的知识点。最具挑战性的考题往往将核心计算机概念嵌入数学、物理、生物、地理甚至法学等陌生情境中。这些跨学科问题检验你迁移知识、分析真实场景和构建逻辑解决方案的能力。本文提供了一套精心设计的综合训练题，完全匹配11年级评估的风格与难度。你将逐步处理二进制算术、逻辑电路、算法追踪、数据误差、数据库设计、网络物理、密码学、伦理困境、科学流程图以及模拟建模。每节都配套一道样题与详细解析，帮助你深化理解并培养高分所需的灵活思维。
1. Binary Conversion and Arithmetic | 二进制转换与算术
Computers store numbers in binary, and a firm grasp of conversion between denary (base-10) and binary (base-2) is essential. In science and engineering, binary arithmetic underpins calculations involving measurement limits and digital sensors. Consider a temperature sensor that records values as 8‑bit unsigned integers. You must interpret raw binary readings and perform addition to find temperature differences.
计算机以二进制形式存储数值，牢固掌握十进制（基数为10）与二进制（基数为2）的转换至关重要。在科学与工程领域，二进制算术支撑着涉及测量极限和数字传感器的计算。设想一个温度传感器以8位无符号整数记录读数，你需要解读原始二进制值并进行加法以求出温差。
Sample problem: A sensor outputs the denary value 79. Write 79 as an 8‑bit binary number. A second reading is given as 01001101. Convert this to denary. Finally, add the two 8‑bit binary values and state the result in both binary and denary, noting any overflow.
样题：某传感器输出十进制值79。将79表示为8位二进制数。第二次读数为01001101，将其转换为十进制。最后，将这两个8位二进制值相加，并用二进制和十进制表示结果，注意是否有溢出。
Explanation: To convert 79 to binary, we repeatedly divide by 2 and record remainders: 79 ÷ 2 = 39 r1, 39 ÷ 2 = 19 r1, 19 ÷ 2 = 9 r1, 9 ÷ 2 = 4 r1, 4 ÷ 2 = 2 r0, 2 ÷ 2 = 1 r0, 1 ÷ 2 = 0 r1. Reading remainders upwards gives 1001111. As an 8‑bit value we pad with a leading zero → 01001111. For the second reading, 01001101 has 1s in positions 0, 2, 3, 6 (from right, starting at 0), giving 64 + 8 + 4 + 1 = 77. Adding the two binary numbers:
解析：将79转换为二进制，不断除以2并记录余数：79 ÷ 2 = 39余1，39 ÷ 2 = 19余1，19 ÷ 2 = 9余1，9 ÷ 2 = 4余1，4 ÷ 2 = 2余0，2 ÷ 2 = 1余0，1 ÷ 2 = 0余1。从下往上读取余数得到1001111。作为8位值，我们在前面补一个零 → 01001111。第二个读数01001101从右起第0、2、3、6位是1，因此值为64 + 8 + 4 + 1 = 77。将两个二进制数相加：
01001111 + 01001101 = 10011100
The denary sum is 79 + 77 = 156. Since 156 exceeds 127 (the maximum 8‑bit signed integer in two’s complement), we simply treat the addition as unsigned: 10011100 in binary equals 128 + 16 + 8 + 4 = 156. There is no overflow beyond 8 bits in unsigned representation. This exercise mirrors how digital instruments combine readings and respects the limits of fixed‑width registers.
十进制之和为79 + 77 = 156。由于156超过127（8位二进制补码形式的最大有符号整数），我们将此加法视为无符号运算：二进制10011100等于128 + 16 + 8 + 4 = 156。在无符号表示下没有超出8位的溢出。这一练习模拟了数字仪器如何组合读数，并尊重固定宽度寄存器的限制。
2. Logic Gates and Boolean Algebra | 逻辑门与布尔代数
Logic gates form the building blocks of digital electronics, but their behaviour is described by Boolean algebra—a branch of mathematics. In physics and engineering, gate combinations control safety systems. Here we blend truth tables, Boolean expressions, and circuit diagrams with a real‑life safety lock scenario.
逻辑门是数字电子技术的基本构件，但其行为由布尔代数这一数学分支描述。在物理和工程中，门电路组合控制着安全系统。在此我们结合真值表、布尔表达式和电路图，设置一个现实的安全锁场景。
Scenario: A chemical storage cabinet has two electronic locks, Lock X and Lock Y. Access is allowed only when a key switch (K) is ON and an emergency stop (E) is NOT pressed, OR when a master override (M) is ON regardless of other inputs. Derive a Boolean expression for the unlock signal (U), draw the logic circuit, and complete the truth table for inputs K, E, M.
场景：一个化学品储存柜配有两个电子锁X和Y。仅当钥匙开关(K)为ON且急停按钮(E)未被按下时，或者主控超控(M)为ON而不管其它输入如何，才允许开锁。推导出开锁信号(U)的布尔表达式，绘制逻辑电路，并完成输入K、E、M的真值表。
Solution approach: We define signals as 1 = active/ ON/ pressed. The condition “K is ON and E is NOT pressed” is written as K AND (NOT E). The override condition is simply M. The overall unlock is therefore U = (K ∧ ¬E) ∨ M. The circuit uses one NOT gate, two AND gates, and one OR gate. The truth table is:
解题思路：我们定义信号1 = 激活/ON/按下。“K是ON且E未被按下”写为K AND (NOT E)。超控条件即为M。总体开锁表达式为 U = (K ∧ ¬E) ∨ M。电路使用一个非门、两个与门和一个或门。真值表如下：
| K | E | M | ¬E | K ∧ ¬E | U = (K ∧ ¬E) ∨ M |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 |
This integrated task demands fluency in translating English conditions into logical form, manipulating Boolean operators, and validating with a truth table—skills assessable across mathematics and physics papers as well.
这项综合任务要求你能顺畅地将英文条件转化为逻辑形式、操作布尔运算符并用真值表验证——这些技能在数学和物理考卷中同样会被评估。
3. Algorithm Design with Mathematical Sequences | 算法设计：数学序列
Algorithms often compute mathematical series such as the Fibonacci sequence or factorials. Cambridge questions frequently present pseudocode and ask you to dry‑run with given inputs. In this interdisciplinary example, an algorithm generates terms of a geometric progression found in population growth models.
算法常用来计算数学序列，如斐波那契数列或阶乘。剑桥考题常给出伪代码并要求你用给定输入进行手工执行。在这个跨学科示例中，一个算法生成了人口增长模型中的等比数列项。
Pseudocode:
INPUT a, r, n
term ← a
FOR i ← 1 TO n
OUTPUT term
term ← term × r
NEXT i
Given a = 120 (initial population in thousands), r = 1.05 (growth factor), and n = 4, list the output sequence and state what the final term represents after 4 years. Also rewrite the loop using a WHILE structure.
给定 a = 120（初始人口，单位千），r = 1.05（增长因子），n = 4，列出输出序列并说明最后一项在四年后代表什么。同时用 WHILE 结构重写这个循环。
Dry‑run: term initially 120. Loop i=1: output 120, term becomes 120×1.05 = 126. i=2: output 126, term=132.3. i=3: output 132.3, term≈138.915. i=4: output 138.915, term≈145.86. The sequence is 120, 126, 132.3, 138.915 (thousands). The final output after the loop represents the population at the end of year 4, i.e. 145.86 thousand. A WHILE equivalent:
手工执行：初始 term=120。循环 i=1：输出120，term=120×1.05=126。i=2：输出126，term=132.3。i=3：输出132.3，term≈138.915。i=4：输出138.915，term≈145.86。序列为120，126，132.3，138.915（千）。循环结束后最终输出代表第4年末的人口，即145.86千。等价的WHILE循环：
i ← 1
WHILE i <= n
OUTPUT term
term ← term × r
i ← i + 1
ENDWHILE
This bridges computer science with biology and environmental studies, reinforcing the importance of initialisation, condition checking, and iteration.
这连接了计算机科学与生物学及环境研究，强化了初始化、条件检查和迭代的重要性。
4. Data Representation and Measurement Error | 数据表示与测量误差
When computers store real numbers using floating‑point representation, precision is limited. This relates directly to scientific measurement error and significant figures. A common Cambridge exam task asks you to identify the binary floating‑point form of a decimal and calculate the absolute rounding error.
计算机使用浮点表示法存储实数时，精度是有限的。这与科学测量误差和有效数字直接相关。剑桥考试中常见的任务是确定一个小数的二进制浮点形式并计算绝对舍入误差。
Question: A 12‑bit floating‑point format uses 1 sign bit, 5 exponent bits (excess‑15), and 6 mantissa bits. Represent the denary number 6.3 in normalised binary floating‑point. Then convert your stored binary back to denary and find the absolute error.
问题：一种12位浮点格式使用1位符号位、5位阶码（偏移15）和6位尾数。将十进制数6.3表示为规格化二进制浮点形式。然后把你存储的二进制转换回十进制并求绝对误差。
Steps: 6.3 in binary is 110.0100110011… (repeating). Normalise to 1.10010011001… × 2². The sign is 0. Exponent: 2 + 15 = 17, binary 10001. Mantissa (6 bits after the leading 1): 100100 (the first 6 bits of fractional part). So stored bits: 0 10001 100100. Convert back: exponent 10001 = 17, subtract 15 gives 2. Mantissa 1.100100 = 1 + 0.5 + 0.0625 = 1.5625? Wait: .100100 = 1×½ + 0×¼ + 0×⅛ + 1×¹/₁₆ + 0×¹/₃₂ + 0×¹/₆₄ = 0.5 + 0.0625 = 0.5625. So value = 1.5625 × 2² = 6.25. Absolute error = |6.3 − 6.25| = 0.05. This is analogous to rounding a measurement to two decimal places.
步骤：6.3的二进制为110.0100110011…（循环）。规格化为1.10010011001… × 2²。符号位为0。阶码：2 + 15 = 17，二进制10001。尾数（前导1后的6位）：100100（小数部分的前6位）。因此存储比特：0 10001 100100。转换回去：阶码10001=17，减15得2。尾数1.100100 = 1 + 0.5 + 0.0625 = 1.5625（检查：.100100 = 1×½ + 0×¼ + 0×⅛ + 1×¹/₁₆ + 0×¹/₃₂ + 0×¹/₆₄ = 0.5 + 0.0625 = 0.5625）。所以数值 = 1.5625 × 2² = 6.25。绝对误差 = |6.3 − 6.25| = 0.05。这类似于将测量值舍入到两位小数。
This exercise highlights why scientists must understand computer precision limits when processing experimental data.
此练习突显了科学家在处理实验数据时为什么必须理解计算机精度限制。
5. Database Queries and Statistical Analysis | 数据库查询与统计分析
Databases are not just for storing records; they can be queried to produce statistics valuable in geography, economics, and social sciences. In this problem, you will use a small table of climate data and write SQL‑like queries to extract summaries.
数据库不仅用于存储记录，还能通过查询生成对地理、经济学和社会科学有价值的统计数据。在此问题中，你将使用一张小型气候数据表并编写类似SQL的查询来提取摘要信息。
| City | Country | AnnualRainfall_mm | AvgTemp_C |
|---|---|---|---|
| Mumbai | India | 2200 | 27 |
| London | UK | 600 | 11 |
| Cairo | Egypt | 25 | 23 |
| Singapore | Singapore | 2400 | 28 |
Tasks: (a) Write a query to select all fields for cities with rainfall above 2000 mm. (b) Write a query to calculate the average temperature for all cities. (c) Explain how the database engine might use indexing to speed up the rainfall filter.
任务：(a) 写出查询以选出降雨量高于2000 mm的城市的所有字段。(b) 写出查询以计算所有城市的平均温度。(c) 解释数据库引擎如何利用索引加速降雨量筛选。
Answers: (a) SELECT * FROM Climate WHERE AnnualRainfall_mm > 2000; (b) SELECT AVG(AvgTemp_C) FROM Climate; which returns (27+11+23+28)/4 = 22.25°C. (c) An index on the AnnualRainfall_mm column would store sorted rainfall values with pointers. The engine can perform a binary search rather than scanning every row, dramatically reducing access time—similar to using an ordered list in statistics for median finding.
答案：(a) SELECT * FROM Climate WHERE AnnualRainfall_mm > 2000；(b) SELECT AVG(AvgTemp_C) FROM Climate；返回 (27+11+23+28)/4 = 22.25°C。(c) AnnualRainfall_mm 列上的索引会存储排序后的降雨量值及指针。引擎可以执行二分查找而不是扫描每一行，大幅减少访问时间——类似于统计学中利用有序列表求中位数。
Queries like these underpin data analysis in subjects such as geography, where large climate datasets demand efficient summarisation.
类似的查询支撑了地理等学科的数据分析，在这些学科中大型气候数据集需要高效的汇总。
6. Network Topology and Physics of Signal Transmission | 网络拓扑与信号传输物理
Computer networks rely on physical principles: signal attenuation, latency, and bandwidth are rooted in physics. An exam question might combine a network topology diagram with calculations of propagation delay and bit rate.
计算机网络依赖物理原理：信号衰减、延迟和带宽都植根于物理学。考题可能结合网络拓扑图和传播延迟及比特率的计算。
Scenario: Two campuses, A and B, are connected by a fibre‑optic cable 80 km long. The speed of light in the fibre is approximately 2×10⁸ m/s. A file of 12.5 MB (megabytes) is to be transferred. The link bandwidth is 100 Mbps (megabits per second). Calculate (i) the propagation delay, and (ii) the total time to transfer the file if there is no other traffic. Express answers in appropriate units.
场景：两个校区A和B由一条80 km长的光纤电缆连接。光在光纤中的速度约为2×10⁸ m/s。需要传输一个12.5 MB（兆字节）的文件。链路带宽为100 Mbps（兆比特每秒）。计算 (i) 传播延迟，以及 (ii) 假设没有其他流量情况下传输文件的总时间。用适当单位表达答案。
Calculations: Propagation delay = distance / speed = 80×10³ m ÷ 2×10⁸ m/s = 4×10⁻⁴ s = 0.4 ms. File size in bits = 12.5 MB × 8 = 100 Mb (megabits). Transmission time = file size / bandwidth = 100 Mb ÷ 100 Mbps = 1.0 second. Total time ≈ 1.0 s + 0.0004 s = 1.0004 s (dominated by transmission time).
计算：传播延迟 = 距离/速度 = 80×10³ m ÷ 2×10⁸ m/s = 4×10⁻⁴ s = 0.4 ms。文件大小以比特计 = 12.5 MB × 8 = 100 Mb（兆比特）。传输时间 = 文件大小/带宽 = 100 Mb ÷ 100 Mbps = 1.0秒。总时间 ≈ 1.0 s + 0.0004 s = 1.0004 s（主要由传输时间主导）。
This cross‑disciplinary task connects computing with physics equations (t = d / v) and unit conversions, reinforcing the real‑world constraints on network performance.
这项跨学科任务将计算机与物理方程 (t = d / v) 和单位换算联系起来，强化了网络性能的现实约束。
7. Encryption and Modular Arithmetic | 加密与模运算
Cryptography relies heavily on modular arithmetic, a topic shared with mathematics. The Caesar cipher and modern public‑key algorithms both use modulo operations. Here you will encrypt and decrypt a message using a shift cipher and break a simple encrypted text with frequency analysis—a technique borrowed from linguistics.
密码学严重依赖模运算，这是与数学共有的主题。凯撒密码和现代公钥算法都使用模运算。在此你将用移位密码加解密消息，并用频率分析法——一种借用语言学的方法——破解一段简单的密文。
Problem: Using a Caesar cipher with a shift of +3 (right shift), encrypt the plaintext "CAMBRIDGE". Then decrypt the ciphertext "VHPSOH". Finally, explain how frequency analysis (observing letter occurrence patterns in English) could crack a longer message without knowing the shift.
问题：使用移位+3（右移）的凯撒密码，加密明文 "CAMBRIDGE"。然后解密密文 "VHPSOH"。最后解释如何利用频率分析（观察英文中字母出现频率的模式）在不知道移位的情况下破解更长的消息。
Solutions: For +3 shift, C→F, A→D, M→P, B→E, R→U, I→L, D→G, G→J, E→H → "FDPEULGJH". Decrypt "VHPSOH": subtract 3 gives V(22) -3 = 19→S, H(8) -3 =5→E, P(16) -3 =13→M, S(19) -3 =16→P, O(15) -3 =12→L, H(8) -3 =5→E → "SEMPLE". Frequency analysis works because English letters have characteristic frequencies (E ≈12.7%, T≈9.1%, A≈8.2%, etc.). By counting ciphertext letters, the most frequent likely maps to 'E'. This reveals the shift and thus the key.
解答：对于+3移位，C→F, A→D, M→P, B→E, R→U, I→L, D→G, G→J, E→H → "FDPEULGJH"。解密 "VHPSOH"：减3得 V(22)-3=19→S, H(8)-3=5→E, P(16)-3=13→M, S(19)-3=16→P, O(15)-3=12→L, H(8)-3=5→E → "SEMPLE"。频率分析之所以有效，是因为英语字母具有特征频率（E约12.7%，T约9.1%，A约8.2%等）。通过统计密文字母，出现频率最高的字母很可能对应 'E'。这揭示了移位量，从而得到密钥。
Mathematics provides the mod 26 arithmetic, while linguistic knowledge facilitates the attack—a true interdisciplinary blend.
数学提供了模26运算，而语言学知识则促成了攻击——这是真正的跨学科融合。
8. Ethics in Computing and Law | 计算机伦理与法律
Computer science is tightly bound to legal and ethical frameworks. Data protection laws, intellectual property, and cybercrime legislation require you to analyse scenarios from both technical and social perspectives. This section presents a case study requiring reasoned argument.
计算机科学与法律和伦理框架紧密相连。数据保护法、知识产权和网络犯罪立法要求你从技术和社会两个角度分析场景。本节呈现一个需要推理论证的案例研究。
Case study: A school develops an app to monitor students' online activity during remote lessons to ensure engagement. The app records keystrokes, mouse movements, and browser tabs. Some parents object, citing privacy rights. Using the principles of the UK Data Protection Act 2018, discuss whether the school's actions are justified. Mention data minimisation, consent, and the Children's code (age‑appropriate design).
案例研究：一所学校开发了一款应用程序，用于监控学生在远程课堂期间的在线活动以确保参与度。该应用记录按键、鼠标移动和浏览器标签页。部分家长以隐私权为由提出反对。运用《2018年英国数据保护法》的原则，讨论学校的行为是否合理。提及数据最小化、同意和儿童准则（适龄设计）。
Discussion points: The DPA 2018 requires that personal data processing be lawful, fair, and transparent. Monitoring without explicit consent may breach fairness. The principle of data minimisation says only the
Published by TutorHao | Year 11 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导