Year 11 CIE Computer Science Interdisciplinary Exam Practice | CIE 计算机跨学科综合题型训练

📚 Year 11 CIE Computer Science Interdisciplinary Exam Practice | CIE 计算机跨学科综合题型训练

Computer Science is not an isolated subject; it draws heavily from mathematics, physics, electronics, and even biology or economics. In CIE IGCSE and O‑level examinations, you will face questions that weave together concepts from two or more disciplines – for example, using binary to understand sensor resolution, applying logic gates to control systems in a factory, or writing pseudocode that solves a quadratic equation. This article provides a structured set of interdisciplinary exercise types, each with a sample question, a walkthrough solution, and the reasoning that links computing to other fields. Treat these exercises as a revision tool to sharpen your ability to transfer skills across subject boundaries.

计算机科学并不是一门孤立的学科，它大量借鉴了数学、物理、电子学甚至生物和经济学的知识。在 CIE IGCSE 和 O‑level 考试中，你会遇到融合两个或多个学科概念的题目——例如，用二进制理解传感器分辨率，将逻辑门应用于工厂控制系统，或编写求解二次方程的伪代码。本文提供了一套结构化的跨学科练习题型，每种题型都配有示例问题、解答步骤以及将计算与其他领域联系起来的推理。把这些练习当作复习工具，增强你跨越学科界限迁移技能的能力。

1. Algorithms & Mathematics: Sequence Summation | 算法与数学：数列求和

Many algorithm questions require you to manipulate number sequences that are rooted in pure mathematics. A typical CIE task might ask you to write pseudocode to sum the first N multiples of 7, or to find the sum of squares. This tests both your understanding of loops and your ability to express a mathematical series computationally. The key is to identify the general term and then accumulate it inside a counted loop.

许多算法题要求你处理植根于纯数学的数字序列。典型的 CIE 考题可能会让你编写伪代码来求前 N 个 7 的倍数之和，或者求平方和。这既考查你对循环的理解，也考查你用计算思维表达数学级数的能力。关键在于找出通项，然后在计数循环中累加。

Example question: Write pseudocode to calculate the sum of the first N even numbers (2, 4, 6, ..., 2N). Assume N is a positive integer input.

示例问题：编写伪代码，计算前 N 个偶数（2, 4, 6, ..., 2N）之和。假设 N 是输入的正整数。

ns from 1 to N. We initialise a total to 0, then loop i from 1 to N, adding 2*i each time.

解法思路：偶数可通过 2 × i 生成，i 从 1 到 N。先将总和初始化为 0，然后循环 i 从 1 到 N，每次加上 2*i。

INPUT N
total ← 0
FOR i ← 1 TO N
  total ← total + 2 * i
NEXT i
OUTPUT total

1). Recognising such patterns can help you verify outputs without tracing every iteration.

这个简单算法体现了数学恒等式 S = N(N+1)。识别这种模式有助于你验证输出，无需跟踪每次迭代。

---

2. Physics & Data Representation: Sensor Resolution | 物理与数据表示：传感器分辨率

Sensors convert physical quantities into digital values using an analogue‑to‑digital converter (ADC). The resolution of the ADC determines how finely it can distinguish between levels. This topic merges physics (measurement) with computer science (binary word size). A typical question gives you the voltage range and the number of bits, then asks for the smallest detectable change.

传感器利用模数转换器 (ADC) 将物理量转换为数字值。ADC 的分辨率决定了它能区分的电平有多精细。这个主题融合了物理（测量）与计算机科学（二进制字长）。典型考题会给出电压范围和位数，然后要求计算最小可检测变化。

Example: A temperature sensor outputs 0–5 V, linearly mapped to 0–100°C. It uses an 8‑bit ADC. Calculate the smallest temperature change the system can detect.

示例：一个温度传感器输出 0–5 V，线性对应 0–100°C。它使用 8 位 ADC。计算系统可检测的最小温度变化。

= 5 V / 256. Temperature step = 100°C / 256 ≈ 0.39°C. Thus the resolution is about 0.4°C.

电平数 = 2⁸ = 256。电压步长 = 5 V / 256。温度步长 = 100°C / 256 ≈ 0.39°C。所以分辨率约为 0.4°C。

This directly links the binary bit‑depth to a physical measurement sensitivity. In CIE papers, you might also be asked how increasing the bit‑depth improves accuracy.

这直接将二进制位深与物理测量灵敏度联系起来。在 CIE 试卷中，还可能问到增加位深如何提高精度。

---

3. Logic & Control Systems: Boolean Decision Circuit | 逻辑与控制系统：布尔决策电路

Logic gates are not just abstract truth tables; they model real‑world decision‑making. Consider a greenhouse system that turns on a heater if it is cold OR if the light level is low, but ONLY when the main power switch is on. Such scenarios blend logic with environmental control (physics/biology). You must interpret the conditions and draw a logic circuit.

逻辑门不仅仅是抽象的真值表，它们模拟现实世界的决策。设想一个温室系统：如果温度低或光线弱，并且总电源开关打开，则打开加热器。这类场景将逻辑与环境控制（物理/生物）结合起来。你必须解读条件并绘制逻辑电路。

Example: Heater H turns on when P=1 AND (T=1 OR L=1). Design the logic circuit using AND, OR gates.

示例：有三个输入变量：P（电源开，1）、T（温度低，1）、L（光照低，1）。当 P=1 且 (T=1 或 L=1) 时，加热器 H 开启。使用与门和或门设计逻辑电路。

t of the OR gate together with P into an AND gate. The final output is H = P AND (T OR L).

解法：将 T 和 L 接入一个或门，然后将或门的输出与 P 共同接入一个与门。最终输出为 H = P AND (T OR L)。

You may be required to complete a truth table for this scenario, showing how computing rules match physical conditions.

你可能需要完成此情景的真值表，展示计算规则如何与物理条件相匹配。

---

4. Databases & Statistics: Querying Student Scores | 数据库与统计：查询学生成绩

Database queries frequently involve aggregate functions that calculate averages, counts, or maximum values. These are essentially statistical operations performed inside a DBMS. CIE expects you to write SQL or understand query results that answer a statistical question, such as finding the average score of students who passed.

数据库查询经常涉及计算平均值、计数或最大值的聚合函数。这些本质上是在 DBMS 内部执行的统计运算。CIE 期望你编写 SQL 或理解能回答统计问题的查询结果，例如找出及格学生的平均分。

Example: Table RESULT(StudentID, Subject, Mark). Write an SQL query to find the number of students who scored above 75 in Mathematics.

示例：表 RESULT(StudentID, Subject, Mark)。编写 SQL 查询，找出数学成绩高于 75 分的学生人数。

SELECT COUNT(StudentID) FROM RESULT
WHERE Subject = 'Mathematics' AND Mark > 75;

This task uses counting (a mathematical concept) and Boolean filtering (computing logic) together. You might also need to sort results using ORDER BY, linking to data presentation.

这个任务综合运用了计数（数学概念）和布尔过滤（计算逻辑）。还可能需要用 ORDER BY 排序结果，与数据呈现联系起来。

---

5. Networks & Geography: Transmission Delay over Distance | 网络与地理：距离导致的传输延迟

Data transmission speed is affected by the physical distance between hosts. In a cross‑ you could be given the speed of light in fibre optic cable (≈2 × 10⁸ m/s) and the straight‑ te the minimum propagation delay. This links computer networking to physics and geography.

数据传输速度受主机间物理距离的影响。在跨学科问题中，可能会给出光在光纤中的速度（约为 2 × 10⁸ m/s）和两座城市之间的直线距离，然后要求计算最小传播延迟。这将计算机网络与物理和地理联系起来。

Example: e cable of length 5500 km. The signal speed in the cable is 2 × 10⁸ m/s. Calculate the one‑way propagation delay in milliseconds.

示例：信号通过一条长度为 5500 公里的海底光缆从伦敦传送到纽约。信号在光缆中的速度为 2 × 10⁸ m/s。计算单程传播延迟（毫秒）。

5500 km = 5.5 × 10⁶ m. Time = Distance / Speed = 5.5 × 10⁶ / 2 × 10⁸ = 0.0275 s = 27.5 ms.

距离 = 5500 km = 5.5 × 10⁶ m。时间 = 距离 / 速度 = 5.5 × 10⁶ / 2 × 10⁸ = 0.0275 s = 27.5 ms。

This calculation shows why intercontinental online gaming experiences higher latency. You may also need to add processing delays at routers for a complete picture.

这个计算说明了为什么洲际在线游戏延迟更高。你可能还需要加上路由器的处理延迟才能获得完整情况。

---

6. Programming & Numerical Methods: Bisection Method | 编程与数值方法：二分法

sk shared by mathematics and computer science. The bisection method repeatedly halves an interval to narrow down the root. A typical CIE question provides a mathematical function, an interval [a, b] where f(a) and f(b) have opposite signs, and asks for pseudocode that outputs the root to a specified accuracy.

求解 f(x)=0 这样的方程是数学和计算机科学共有的任务。二分法反复对区间减半来缩小区间，逼近根。典型的 CIE 考题会给出一个数学函数，一个区间 [a, b]（其中 f(a) 和 f(b) 异号），并要求编写输出指定精度根的伪代码。

Example: Write pseudocode for the bisection method to find √2, i.e. solve x² – 2 = 0 in the interval [1, 2], stopping when the interval width is less than 0.001.

示例：编写二分法伪代码，求 √2，即解方程 x² – 2 = 0，区间 [1, 2]，当区间宽度小于 0.001 时停止。

a ← 1
b ← 2
WHILE (b - a) > 0.001
  mid ← (a + b) / 2
  IF mid*mid < 2 THEN
    a ← mid
  ELSE
    b ← mid
  ENDIF
ENDWHILE
OUTPUT (a+b)/2

gic with iterative control flow. You must handle the condition carefully: since we want x² – 2 = 0, if mid² < 2, the root lies to the right.

这融合了代数逻辑与迭代控制流。你必须仔细处理条件：因为我们要求解 x² – 2 = 0，如果 mid² < 2，根在右边。

---

广告 / Sponsored

7. Encryption & Modular Arithmetic: Caesar Cipher | 加密与模运算：凯撒密码

ar arithmetic to wrap around. You need to treat letters as numbers (A=0, B=1, ..., Z=25), apply the shift, then take mod 26. CIE often asks for the encryption algorithm or a decryption pseudocode, bridging computer science with modular arithmetic and language.

凯撒密码是一个经典的跨学科主题：它通过将字母表中的位置偏移一个固定密钥来替换每个字母，并使用模运算来循环。你需要将字母视为数字（A=0, B=1, ..., Z=25），应用偏移，然后取模 26。CIE 经常要求编写加密算法或解密伪代码，将计算机科学与模运算和语言联系起来。

Example: Given a secret key K=3, encrypt the letter 'X'. Provide the mathematical step and the encrypted character.

示例：给定密钥 K=3，加密字母 'X'。给出数学步骤和加密后的字符。

'X' numeric value = 23. Encrypted value = (23 + 3) mod 26 = 26 mod 26 = 0 → 'A'. So 'X' with shift 3 becomes 'A'.

'X' 的数值 = 23。加密值 = (23 + 3) mod 26 = 26 mod 26 = 0 → 'A'。所以 'X' 偏移 3 后变成 'A'。

Writing pseudocode to encrypt a whole word involves looping through characters, converting to ASCII codes, subtracting 65 for uppercase, applying mod, and converting back.

编写加密整个单词的伪代码涉及循环遍历字符，转换为 ASCII 码，减去 65（大写字母），应用取模运算，再转换回来。

---

8. Binary Arithmetic & Electronics: Full Adder Design | 二进制运算与电子学：全加器设计

A full adder is a combinational logic circuit that adds three binary digits: two input bits and a carry‑in, producing a sum and carry‑out. This is a direct embodiment of binary addition rules, linking computer architecture to digital electronics and mathematics.

全加器是一种组合逻辑电路，对三个二进制位（两个输入位和一个进位输入）求和，产生和位与进位输出。这直接体现了二进制加法规则，将计算机体系结构与数字电子学和数学联系起来。

Example: Derive the Boolean expressions for a full adder's Sum and Carry output, given inputs A, B, and Cin.

示例：给定输入 A、B 和 Cin，推导全加器和位与进位输出的布尔表达式。

(Cin AND (A XOR B)). These can be simplified from a truth table and implemented with basic gates.

Sum = A XOR B XOR Cin。Carry = (A AND B) OR (Cin AND (A XOR B))。这些表达式可以从真值表简化而来，并用基本门实现。

You may be shown a logic circuit diagram and asked to identify the function, or to draw the truth table, linking all three domains: truth table (mathematical logic), circuit symbols (electronics), and binary addition (computing).

考题可能会展示一个逻辑电路图，要求你识别其功能或绘制真值表，连接三个领域：真值表（数学逻辑）、电路符号（电子学）和二进制加法（计算）。

---

9. Artificial Intelligence & Biology: Simple Perceptron Model | 人工智能与生物学：简单感知器模型

The perceptron, inspired by biological neurons, takes several weighted inputs, sums them, and passes the result through an activation function to produce an output (e.g. 0 or 1). A CIE cross‑curricular question might ask you to compute the output for given inputs and weights, or to interpret how changing a weight mimics synaptic strengthening.

感知器受生物神经元启发，接收多个加权输入，将它们求和，然后通过激活函数得到输出（例如 0 或 1）。CIE 跨学科问题可能会要求你计算给定输入和权重的输出，或解释改变权重如何模拟突触强化。

Example: p function: output 1 if the weighted sum ≥ 0, else 0. Calculate the output for x₁=1, x₂=0.

示例：一个感知器有两个输入 x₁, x₂，权重 w₁=0.5, w₂=-0.3，偏置 b=0.1。它使用阶跃函数：如果加权和 ≥ 0 则输出 1，否则 0。计算 x₁=1, x₂=0 时的输出。

SUM = x₁×w₁ + x₂×w₂ + b = 1×0.5 + 0×(-0.3) + 0.1 = 0.6
Since 0.6 ≥ 0, output = 1.

This tiny computation illustrates the decision boundary concept; it links biology (neuron firing) with simple arithmetic and threshold logic. You don’t need to know advanced machine learning, just the process of weighted sum and thresholding.

这个小小的计算演示了决策边界概念；它将生物学（神经元放电）与简单的算术和阈值逻辑联系起来。你无需了解高级机器学习，只需掌握加权求和与阈值化的过程。

---

10. Project Management & Economics: Cost‑Benefit Analysis | 项目管理与经济学：成本收益分析

In the system life cycle, feasibility study includes economic analysis. A computing student may need to compare the costs of implementing a new IT system against the expected savings or revenue. This involves basic arithmetic and spreadsheet modelling – both are within CIE scope when linked to computer use.

在系统生命周期中，可行性研究包括经济分析。计算机学生可能需要比较实施新 IT 系统的成本与预期节省或收入。这涉及基本算术和电子表格建模——两者都属于 CIE 范围内，只要与计算机使用相关。

Example: A company plans to automate inventory management. The new system costs £5000 and will save £1200 per year in labour. It has a lifespan of 5 years. Calculate the net benefit and decide if it is feasible.

示例：一家公司计划自动化库存管理。新系统成本 £5000，每年节省 £1200 人工成本，使用寿命 5 年。计算净收益并判断是否可行。

Total savings = 5 × £1200 = £6000. Net benefit = £6000 – £5000 = £1000. The project is feasible because it yields a positive return over its lifespan.

总节省 = 5 × £1200 = £6000。净收益 = £6000 – £5000 = £1000。项目可行，因为在其寿命期内产生正收益。

This simple cost‑benefit analysis shows that computing solutions often require financial reasoning, blending business studies with technology.

这个简单的成本收益分析表明，计算机解决方案通常需要财务推理，将商业研究与技术融合起来。

---

11. Integrated Task: Weather Monitoring System | 综合任务：气象监测系统

CIE often concludes a paper with a multi‑part scenario that draws from several topics. Below is a comprehensive problem that combines sensors, data storage, networking, threshold logic, and pseudocode.

CIE 经常以一道多部分情景题结束试卷，涉及多个主题。下面是一道综合问题，结合了传感器、数据存储、网络、阈值逻辑和伪代码。

Scenario: A remote weather station records temperature (℃, 0‑50) every minute, storing it locally. If temperature exceeds 40℃ for three consecutive minutes, it sends an alert message over a radio link to a central server. The system uses an 8‑bit ADC with voltage range 0‑5 V for temperature sensing (mapped linearly).

情景：一个远程气象站每分钟记录一次温度（℃，0‑50），并存储在本地。如果温度连续三分钟超过 40℃，则通过无线电链路向中央服务器发送警报消息。该系统使用 8 位 ADC，电压范围 0‑5 V 用于温度传感（线性映射）。

Questions:
a) Calculate the temperature resolution of the ADC.
n a logic circuit or truth table that detects when three consecutive readings are above 40℃ u have three registers storing the last three values; output alert = 1 when condition met.
c) Write pseudocode for the monitoring loop that reads the sensor, updates the three‑reading history, and conditionally sends an alert.
d) If the radio link operates at 9600 bps and the alert message is 20 bytes, how long does transmission take?

问题：
a) 计算 ADC 的温度分辨率。
b) 设计一个逻辑电路或真值表，用于检测连续三个读数是否都高于 40℃。假设有三个寄存器存储最近三个值；当条件满足时输出 alert = 1。
c) 编写监控循环的伪代码：读取传感器，更新三个读数的历史记录，并根据条件发送警报。
d) 如果无线电链路速率为 9600 bps，警报消息为 20 字节，传输需要多长时间？

Solutions:
a) Levels = 2⁸ = 256. Temperature range = 50°C. Step = 50/256 ≈ 0.195°C.
s a binary threshold output where T=1 if >40°C. Alert = T1 AND T2 AND T3. You can draw a 3‑input AND gate.
c) Pseudocode:

WHILE TRUE
  read sensor → current_temp
  shift registers: R3 ← R2, R2 ← R1, R1 ← current_temp
  IF R1 > 40 AND R2 > 40 AND R3 > 40 THEN
    send "ALERT"
  ENDIF
  wait 60 seconds
ENDWHILE

d) 20 bytes = 160 bits. Transmission time = 160 / 9600 = 0.0167 s = 16.7 ms.

这道综合题要求你将 ADC 分辨率、顺序逻辑、编程和网络延迟计算结合起来，模拟跨学科解决问题的真实场景。

---

12. Exam Technique: Bridging Between Subjects | 考试技巧：学科之间的融会贯通

When tackling interdisciplinary questions, always identify the core computing concept first (e.g., binary, loops, logic gates) and then apply the other subject's knowledge as a filter or data source. Read the whole scenario carefully; underline the computing objectives and the values given from the other discipline. If a physics formula is provided, treat it as a function you need to implement in code or logic.

解决跨学科问题时，首先确定核心计算概念（如二进制、循环、逻辑门），然后将其他学科的知识作为过滤器或数据源来应用。仔细阅读整个情景；在计算目标和其他学科给出的数值下画线。如果提供了物理公式，就把它当作需要在代码或逻辑中实现的函数。

Practice by converting word problems into flowcharts: this forces you to express mathematical or physical rules as processing steps. Also, check your units – a common pitfall is mixing metres with kilometres, or seconds with milliseconds. Finally, when writing pseudocode, keep the logic language‑independent and focused on the algorithm, not on platform‑specific syntax.

通过将文字问题转换成流程图来练习：这会迫使你将数学或物理规则表达为处理步骤。另外，检查单位——常见的陷阱是混淆米和千米，或秒和毫秒。最后，在写伪代码时，保持逻辑独立于语言，专注于算法，而不是特定平台的语法。

Use these exercises to build confidence. The more you practise linking computing to other fields, the more natural it becomes to see the unifying patterns.

用这些练习建立信心。你越多练习将计算与其他领域联系起来，就越能自然地看到统一的模式。

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）