Year 12 CAIE Computer Science: Interdisciplinary Integrated Question Training | Year 12 CAIE 计算机：跨学科综合题型训练

📚 Year 12 CAIE Computer Science: Interdisciplinary Integrated Question Training | Year 12 CAIE 计算机：跨学科综合题型训练

In the CAIE AS and A Level Computer Science syllabus (9618), examiners increasingly design questions that fuse computational thinking with concepts from mathematics, physics, biology, economics and even linguistics. Such interdisciplinary items go beyond simple coding; they demand that you abstract a real‑world problem, model it using data structures, and evaluate solutions through the lens of multiple domains. This article presents a structured collection of hybrid exercises, each targeting a core topic of Year 12 while drawing on typical cross‑subject contexts. Work through them to sharpen your ability to recognise patterns, translate requirements into algorithms, and articulate trade‑offs under exam conditions.

在 CAIE AS 与 A Level 计算机科学（9618）考试中，命题人越来越多地将计算思维与数学、物理、生物、经济学甚至语言学等领域的概念融合在一起。这类跨学科题目远不止于简单的编程；它们要求你把现实世界的问题抽象出来，用数据结构建模，并从多个学科视角去评价解决方案。本文提供了一套结构化的混合练习，每一个练习都指向 Year 12 的核心主题，同时借助典型的跨学科情境。通过逐一攻克，你将能更敏锐地识别模式、将需求转化为算法，并在考试条件下清晰阐述各种权衡。

---

1. Boolean Logic Meets Digital Circuits | 布尔逻辑遇上数字电路

A traffic‑light controller for a crossroads receives three sensor inputs: A (car waiting on main road), B (car waiting on side road), and T (timer indicating minimum green period has elapsed). The green light for the main road, G, should be ON when (A AND T) OR (NOT B AND T). Draw the logic circuit using only NAND gates, and show how the same expression can be implemented with a programmable logic array (PLA) where the AND plane is pre‑configured. Explain why reducing gate count matters in embedded systems powered by batteries.

某十字路口的交通灯控制器接收三个传感器输入：A（主干道有车等待）、B（支路有车等待）和 T（计时器指示最短绿灯时间已过）。主干道绿灯 G 的开启条件为 (A AND T) OR (NOT B AND T)。请仅用与非门画出逻辑电路，并展示如何在一个与阵列已预先配置的可编程逻辑阵列（PLA）中实现相同的表达式。解释为什么在电池供电的嵌入式系统中减少门数很关键。

A PLA stores product terms in its AND plane; here you need three product terms: A·T, B’·T, and the OR of those two. With NANDs alone, remember De Morgan’s theorem to convert ORs into NANDs. This problem links Boolean algebra (a pure mathematics topic) to electronics and energy efficiency—exactly the style CAIE uses to test interdisciplinary reasoning.

PLA 在其与阵列中存储乘积项；此处你需要三个乘积项：A·T、B’·T 以及它们的或。仅用与非门实现时，请回忆德摩根律将或运算转换为与非。这道题把布尔代数（纯数学主题）与电子学和能效联系起来——这正是 CAIE 用来测试跨学科推理的题型风格。

---

2. Number Systems in Chemistry: pH and Fixed‑Point Binary | 化学中的数制：pH 与定点二进制

A digital pH meter stores values in an 8‑bit register using a fixed‑point representation: 4 bits for the integer part and 4 bits for the fractional part, with a bias of +7 to handle negative pH values. The probe outputs a millivolt signal that is linearly transformed to pH. Given a binary pattern 1010 1100, compute the actual pH. Describe how overflow could occur if the instrument is used to measure a highly alkaline solution (pH > 14) and suggest a fail‑safe mechanism in software.

一台数字 pH 计使用定点表示法将数值存储于 8 位寄存器中：4 位整数部分，4 位小数部分，并采用 +7 的偏移量来处理负 pH 值。探头输出毫伏信号，经线性变换后得到 pH。已知二进制模式为 1010 1100，请计算实际 pH 值。描述若该仪器用于测量强碱性溶液（pH 大于 14）时可能如何发生溢出，并从软件角度提出一种故障安全机制。

Separate the byte into integer (1010) and fraction (1100). Subtract the bias 7 from the integer value, giving −? + 0.75? Actually, 1010₂ = 10, minus 7 = 3; fraction 1100₂ = 12/16 = 0.75, so pH = 3.75. Overflow handling ties into exception handling structures covered in Chapter 4. This exercise blends binary arithmetic with environmental sensing, a common theme in the Internet of Things (IoT) units.

将字节拆分为整数部分（1010）和小数部分（1100）。整数 1010₂ = 10，减去偏移 7 得 3；小数 1100₂ = 12/16 = 0.75，故 pH = 3.75。溢出处理则关联到第 4 章的异常处理结构。这个练习将二进制算术与环境传感结合起来，正是物联网单元中常见的主题。

---

3. Graph Traversal for a Railway Network | 铁路网络中的图遍历

A low‑cost airline wants to model its short‑haul routes as an undirected graph where vertices are airports and edges represent direct flights operated at least once a day. Using the adjacency list below, perform a breadth‑first traversal starting from vertex LHR, then explain why BFS naturally finds the minimum number of flights (hops) between two cities. Critique the use of DFS in a booking engine that needs to suggest the route with the fewest stops.

一家廉航公司希望将其短途航线建模为无向图：顶点表示机场，边表示每天至少运营一班的直飞航班。根据以下邻接表，从顶点 LHR 出发进行广度优先遍历，然后解释为什么 BFS 能够自然地找到两座城市之间的最少飞行次数（跳数）。评价在需要推荐最少经停站路线的订票引擎中使用 DFS 的缺陷。

LHR: CDG, AMS, FRA
CDG: LHR, FCO, BCN
AMS: LHR, BER
FRA: LHR, MUC
FCO: CDG
BCN: CDG
BER: AMS
MUC: FRA

BFS explores nodes level by level, guaranteeing the shortest path in an unweighted graph. DFS could find a longer route first, wasting computation. The exam often asks you to relate graph algorithms to real‑world networks, blending geography with computer science. Be ready to write pseudocode for BFS using a queue, and to compare its time complexity O(V+E) with that of Dijkstra’s algorithm for weighted graphs.

BFS 逐层遍历节点，能在无权图中保证找到最短路径。DFS 可能先发现一条更长的路线，造成计算浪费。考试中经常要求你将图算法与现实世界网络联系起来，融合地理与计算机科学。准备好用队列写出 BFS 伪代码，并将其时间复杂度 O(V+E) 与加权图迪杰斯特拉算法进行比较。

---

4. Encryption and Genetics: XOR‑based Cipher of DNA Sequences | 加密与遗传学：DNA 序列的异或加密

Bioinformaticians sometimes encrypt patient genetic data before storing it in the cloud. A simplified scheme represents the four nucleotides as two‑bit codes: A = 00, C = 01, G = 10, T = 11. A string of nucleotides is converted into a binary stream and XORed with a repeating 8‑bit key ‘10110010’. For the sequence ‘CATG’, generate the ciphertext. Discuss the vulnerability of a repeating‑key XOR cipher and propose how a one‑time pad could be used if the key material were truly random and as long as the genome.

生物信息学家有时会在将患者遗传数据存入云之前对其加密。一种简化方案将四种核苷酸表示为 2 位二进制码：A=00、C=01、G=10、T=11。一个核苷酸串被转换成比特流，并与一个重复的 8 位密钥“10110010”进行异或运算。针对序列“CATG”，生成密文。讨论重复密钥异或加密的脆弱性，并说明如果密钥材料真随机且长度与基因组一致，应如何使用一次性密码本。

Binary for CATG: C=01, A=00, T=11, G=10 → 0100 1110. Pad repeated key: 1011 0010 1011 0010. XOR gives cipher bits. This fuses binary operations with biology and data ethics. CAIE may ask you to trace XOR encryption steps on paper, highlighting the importance of bitwise manipulation in Chapter 1 and security in Chapter 9.

CATG 的二进制码：C=01, A=00, T=11, G=10 → 0100 1110。重复密钥：1011 0010 1011 0010。异或得到密文比特。这一过程将二进制运算与生物学及数据伦理融合。CAIE 可能会让你在纸上追踪异或加密步骤，突显第 1 章位操作和第 9 章安全性的重要性。

---

5. Recursion in Finance: Compound Interest with Amortization | 金融中的递归：带分期偿还的复利

A savings account offers 5% annual interest, compounded monthly. A customer deposits £2000 at the start and withdraws £100 at the end of each month. Write a recursive function balance(n) that returns the amount left after n months. Show the first three calls for n = 0, 1, 2. Modify the base case to prevent the balance from dropping below zero. Explain how stack overflow could occur if the recursion depth equals the number of months in a 50‑year mortgage, and how this can be mitigated with tail recursion or iteration.

一个储蓄账户提供年利率 5%、按月复利。客户初始存入 2000 英镑，并在每月末支取 100 英镑。写一个递归函数 balance(n) 返回 n 个月后的剩余金额。展示 n = 0、1、2 时的前三次调用。修改基础情况以防止余额降至零以下。解释若抵押贷款期限为 50 年、递归深度等于月数时，可能发生栈溢出，以及如何通过尾递归或迭代缓解。

Define balance(0) = 2000; for n>0, balance(n) = (balance(n-1) – 100) * (1 + 0.05/12). This interdisciplinary task sits at the boundary of mathematics and computer science, reinforcing recurrence relations from the pure maths syllabus. The exam expects you to trace recursive calls and identify when iteration is preferable.

定义 balance(0)=2000；对于 n>0，balance(n) = (balance(n-1) – 100) × (1 + 0.05/12)。这个跨学科任务处于数学与计算机科学的交汇点，强化了纯数学教学大纲中的递推关系。考试希望你追踪递归调用，并识别何时更适合使用迭代。

---

6. Assembly Language and Physics Simulation | 汇编语言与物理模拟

An embedded system in a smart tennis racket measures the ball’s speed using a piezoelectric sensor. The 4‑bit CPU’s instruction set has only LDA, ADD, SUB, STA, JNZ and HLT. The speed value is stored at address 0x1F. Write an assembly routine that increments the speed by 5 m/s three times (simulating three successive hits) and then halts. Explain how the fetch‑decode‑execute cycle would process your program, and relate register width (4‑bit) to the maximum measurable speed before overflow.

智能网球拍中的嵌入式系统利用压电传感器测量球速。该 4 位 CPU 的指令集仅有 LDA、ADD、SUB、STA、JNZ 和 HLT。速度值存于地址 0x1F。写一段汇编程序，将速度增加 5 m/s 共三次（模拟连续三次击球），然后停机。解释取指‑解码‑执行周期如何运行你的程序，并将寄存器宽度（4 位）与溢出前可测量的最大速度联系起来。

Use a counter at 0x2E initialized to 3, loop: LDA speed; ADD #5; STA speed; LDA counter; SUB #1; STA counter; JNZ loop; HLT. This ties directly to Chapter 2 (processor fundamentals) and the notion of physical limits imposed by binary word length—a concept borrowed from measurement physics.

使用地址 0x2E 处的计数器初始化为 3，循环：LDA speed；ADD #5；STA speed；LDA counter；SUB #1；STA counter；JNZ loop；HLT。这直接关联第 2 章（处理器基础）以及由二进制字长带来的物理极限概念——这一概念源自测量物理学。

---

7. Databases for Population Ecology | 种群生态学的数据库

Ecologists track sightings of a rare butterfly species in a national park. They store records in a relational database with two tables: SPECIES (sp_id, common_name, sci_name, IUCN_status) and SIGHTINGS (sight_id, sp_id, date, location, temp_celsius). Write SQL queries to (a) list all sightings of ‘Endangered’ butterflies in 2023 with a temperature above 28 °C; (b) count the number of unique locations where each species has been observed. Discuss the importance of normalisation to third normal form (3NF) when integrating weather station data from a third table WEATHER_Daily.

生态学家追踪国家公园内一种稀有蝴蝶的目击记录。他们将数据存储在一个关系数据库中，包含两个表：SPECIES（sp_id、common_name、sci_name、IUCN_status）和 SIGHTINGS（sight_id、sp_id、date、location、temp_celsius）。编写 SQL 查询以（a）列出 2023 年温度高于 28 °C 的所有“濒危”蝴蝶目击记录；（b）统计每种蝴蝶被观测到的独特地点数量。讨论在整合来自第三个表 WEATHER_Daily 的气象站数据时，规范化至第三范式（3NF）的重要性。

This scenario merges database design (Chapter 8) with conservation biology. The SQL queries require JOIN and GROUP BY, while the normalisation discussion addresses data redundancy—a principle equally valued in experimental science, where reducing measurement duplication is vital.

这个场景将数据库设计（第 8 章）与保护生物学融合。SQL 查询需要 JOIN 和 GROUP BY，而规范化讨论则针对数据冗余——这一原则在实验科学中同样受重视，因为减少测量重复至关重要。

---

8. Abstract Data Types for a Dictionary Search | 字典查询的抽象数据类型

A linguistics research team needs a data structure to quickly check whether a word exists in the Oxford English Dictionary (approx. 600 000 entries). Evaluate the use of a binary search tree (BST) versus a hash table. Write pseudocode to insert words into a BST, ensuring duplicates are skipped. Analyse the worst‑case time complexity of searching a misspelled ‘Shakespearean’ word in a highly unbalanced BST, and explain how a hash table with a suitable hash function can achieve O(1) average complexity, drawing on probability concepts of uniform distribution.

一个语言学研究团队需要一种数据结构来快速检查一个单词是否存在于《牛津英语词典》（约 600 000 词条）中。评价二叉搜索树（BST）与哈希表的使用。写伪代码将单词插入 BST，确保跳过重复词。分析在一个高度不平衡的 BST 中搜索拼错的“莎士比亚式”单词的最坏情况时间复杂度，并解释一个具有合适哈希函数的哈希表如何借助均匀分布的概率概念实现 O(1) 平均复杂度。

BST lookup is O(log n) if balanced, O(n) if degenerate; hash tables rely on probability to distribute keys uniformly across buckets. This problem leverages mathematical statistics within a computer science context, a recurring motif in Paper 3, where you are asked to select ADTs based on real‑world constraints.

BST 的查找若平衡则为 O(log n)，若退化为 O(n)；哈希表依靠概率将键均匀分布到桶中。这个问题借助了数理统计，是 Papers 3 中反复出现的主题，要求你根据现实约束选择 ADT。

---

9. Networking and Weather Monitoring | 网络与气象监测

A remote weather station transmits packets to a server every 10 minutes via a satellite link with high latency (600 ms RTT) and 2% packet loss. The data payload is only 24 bytes, yet the TCP header is 20 bytes and the IP header is 20 bytes. Calculate the protocol overhead percentage and suggest why a cut‑through switch might be preferred over a store‑and‑forward switch in the satellite’s onboard network. Explain how the sliding window protocol (Go‑Back‑N) behaves when an acknowledgement is lost, and relate this to the physical limitations of radio propagation.

一个远程气象站每 10 分钟通过一条高延迟（600 ms 往返时间）和 2% 丢包率的卫星链路向服务器发送数据包。数据载荷仅 24 字节，但 TCP 头 20 字节，IP 头 20 字节。计算协议开销百分比，并说明为什么在卫星的机载网络中可能优先使用直通交换而非存储转发交换。解释当确认丢失时滑动窗口协议（回退 N）的行为，并将其与无线电传播的物理限制联系起来。

Overhead = (20+20)/(20+20+24) × 100% ≈ 62.5%. Cut‑through switching reduces latency by forwarding frames as soon as the destination MAC is read, crucial for time‑sensitive satellite commands. This blends networking with space physics and electronics.

开销 = (20+20)/(20+20+24) × 100% ≈ 62.5%。直通交换一读取到目标 MAC 地址就转发帧，从而减少延迟，这对时间敏感的卫星指令至关重要。这融合了网络、空间物理和电子学。

---

10. Systems Software for a Language Translator | 语言翻译器的系统软件

A compiler for a new programming language ‘EcoScript’ is being designed to generate bytecode for a virtual machine that runs on low‑power IoT devices. The team debates between a single‑pass and a multi‑pass compilation strategy. Outline the stages of lexical analysis, syntax analysis, and code generation, and explain how semantic checks for type compatibility (e.g., adding a string to an integer) can be integrated. Use a BNF grammar to define a simple assignment statement and demonstrate how a parse tree is constructed for x = y + 5 if x is a float and y is an integer. Relate this to the learning of foreign languages: just as a human translator must resolve ambiguity, the compiler must reject ill‑formed source code.

一种名为“EcoScript”的新编程语言的编译器正在设计中，它将为运行于低功耗物联网设备的虚拟机生成字节码。开发团队在单遍与多遍编译策略之间进行辩论。概述词法分析、语法分析和代码生成等阶段，并解释如何集成类型兼容性（例如将字符串与整数相加）的语义检查。使用 BNF 文法定义简单的赋值语句，并展示在 x 为浮点数、y 为整数时，如何为 x = y + 5 构建解析树。将此与外语学习相关联：正如人类翻译必须消解歧义，编译器也必须拒绝形式不正确的源代码。

Define grammar: <assignment> ::= <identifier> ‘= ‘ <expression> ; <expression> ::= <term> | <term> ‘+’ <term> ; <term> ::= <identifier> | <integer> . The parse tree will show a type mismatch node if y is int but the result is expected as float, triggering a promotion rule. This interdisciplinary lens compares automated compilers to human cognitive linguistics.

定义文法：<assignment> ::= <identifier> ‘=’ <expression> ；<expression> ::= <term> | <term> ‘+’ <term> ；<term> ::= <identifier> | <integer>。解析树将显示一个类型不匹配节点（若 y 为整数但期望结果为浮点数），触发提升规则。这一跨学科视角将自动编译器与人类认知语言学进行比较。

---

11. Ethics and Algorithmic Bias in Healthcare | 医疗保健中的伦理与算法偏见

A machine‑learning model trained on historical patient data is used to prioritise organ transplant waiting lists. The dataset inadvertently contains socio‑economic proxies; the model assigns lower priority to individuals from certain postcodes, even after adjusting for medical urgency. Discuss the ethical issue of bias amplification, referencing the ACM Code of Ethics. Propose two technical measures—such as stratified sampling and fairness metrics during validation—that software engineers could adopt. Relate this to the legal requirement of non‑discrimination in the UK Equality Act 2010.

一个基于历史患者数据训练的机器学习模型被用于为器官移植等待列表排序。数据集无意中纳入了社会经济替代变量；即便在调整了医疗紧急程度后，模型仍给来自特定邮政编码的个人分配更低的优先级。请讨论偏见放大这一伦理问题，并引用 ACM 道德准则。提出软件工程师可以采纳的两项技术措施——例如分层抽样和验证过程中的公平性度量。将此与英国《2010 年平等法》中的非歧视法律要求联系起来。

This question combines computer ethics (Chapter 1.5/9) with legal studies and medicine, a hallmark of Paper 2 and Paper 3 extended‑response items. You must show awareness that algorithms are not neutral; they inherit and scale human biases. CAIE expects a balanced argument acknowledging both technical constraints and societal responsibility.

这道题结合了计算机伦理（第 1.5/9 章）、法律研究和医学，正是 Paper 2 与 Paper 3 长答题的标志。你必须表明认识到算法并非中立；它们会继承并放大人类的偏见。CAIE 期望你给出平衡的论述，同时承认技术限制与社会责任。

---

12. Project Management: The Cross‑Functional AI Team | 项目管理：跨职能人工智能团队

You are the lead developer of a startup building a wildlife‑disease prediction system that uses satellite imagery and ground‑based sensor data. Your team includes a biologist, a data scientist, and a hardware engineer. Apply the Agile Scrum framework: define the product backlog with three user stories (epics), plan a sprint of two weeks, and describe the daily stand‑up meeting structure. Explain how a Gantt chart would represent interdependencies between the biologist’s field‑data collection and the data scientist’s model training. Discuss how prototyping (a throw‑away prototype) reduces the risk of misinterpreting the disease transmission model.

你是一家初创公司的首席开发人员，正在构建一个利用卫星图像和地面传感器数据的野生动物疾病预测系统。你的团队包括一位生物学家、一位数据科学家和一位硬件工程师。应用敏捷 Scrum 框架：定义包含三个用户故事（史诗）的产品待办列表，规划一个为期两周的冲刺，并描述每日站会的结构。解释甘特图如何展示生物学家实地数据收集与数据科学家模型训练之间的相互依赖关系。讨论原型开发（丢弃式原型）如何降低误解疾病传播模型的风险。

This capstone exercise simulates a holistic interdisciplinary project. It touches Chapter 7 (software project management), but also forces you to consider domain‑specific constraints from ecology and statistics. The exam often asks for a critical comparison of project management methodologies, and here you can argue why Scrum’s iterative nature works well when requirements are uncertain, as in scientific computing.

这个顶点练习模拟了一个整体跨学科项目。它触及第 7 章（软件项目管理），但同时也迫使你考虑来自生态学和统计学的领域特定约束。考试经常要求对项目管理方法进行批判性比较，而在这里你可以论证为何在需求不确定时（如科学计算）Scrum 的迭代特性效果良好。

---

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

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