📚 Interdisciplinary Comprehensive Question Training | 跨学科综合题型训练
Interdisciplinary questions in CAIE IGCSE Computer Science bridge computing concepts with real-world scenarios from physics, biology, economics, and beyond. This training article presents a curated set of high-quality, cross-curricular problems designed to sharpen your analytical skills, extend your understanding of the syllabus, and prepare you for the unconventional challenges that may appear in Paper 1 and Paper 2. Each section combines a subject-specific context with core computer science theory, followed by worked solutions and revision tips.
CAIE IGCSE 计算机科学中的跨学科题目将计算概念与物理、生物、经济学等现实情境相结合。这篇训练文章提供了一系列精心设计的高质量跨学科问题，旨在强化你的分析能力、拓展你对考纲的理解，并为你应对卷一和卷二中可能出现的非常规挑战做好准备。每个小节都将特定学科的背景与计算机科学核心理论相结合，随后给出详细解答与复习提示。
1. Binary Arithmetic and Physics Measurements | 二进制运算与物理测量
A thermometer uses an 8-bit analogue-to-digital converter (ADC) with a reference voltage of 3.3 V. The sensor outputs 1.85 V at a certain temperature. Calculate the binary representation of the digital reading and explain why an 8-bit ADC limits temperature resolution. How would increasing the bit depth to 12 bits improve precision?
一个温度计使用参考电压为 3.3 V 的 8 位模数转换器 (ADC)。在某一温度下传感器输出 1.85 V。计算数字读数的二进制表示，并解释为何 8 位 ADC 限制了温度分辨率。将位深增加到 12 位会如何提高精度？
The digital value is (Vin / Vref) × (2n – 1). For an 8-bit ADC with Vref = 3.3 V and Vin .3) × 255 ≈ 142.88, so 143 in decimal. The 8-bit binary equivalent is 100011112. The smallest detectable voltage change is 3.3 / 256 ≈ 0.0129 V, which directly restricts how finely temperature can be distinguished. A 12-bit ADC would have 4096 levels, reducing the step size to about 0.0008 V, allowing far finer temperature readings.
数字值为 (Vin / Vref) × (2n – 1)。8 位 ADC，Vref = 3.3 V，Vin = 1.85 V 时：数字值 = (1.85 / 3.3) × 255 ≈ 142.88，取整为十进制 143。其 8 位二进制表示为 100011112。最小可检测的电压变化为 3.3 / 256 ≈ 0.0129 V，这直接限制了可区分的温度精细度。12 位 ADC 有 4096 个等级，步长减小到约 0.0008 V，从而实现远更精细的温度读数。
2. Logic Gates and Engineering Control Systems | 逻辑门与工程控制系统
de switch is activated (Input C = 1). However, the override must not work if the guard is open. Construct the truth table for output S (start belt) and design the logic circuit using AND, OR, and NOT gates. Show how this could be implemented with NAND gates only.
某工厂传送带仅当安全门关闭（输入 A = 1）且启动按钮按下（输入 B = 1），或维护超控开关激活（输入 C = 1）时方可启动。但若安全门开启则超控无效。为输出 S（启动传送带）构建真值表，并用与、或、非门设计逻辑电路。展示如何仅用与非门实现。
B=1,C=0), (1,1,1), and (0,1,1) but note for (0,1,1) A=0 so NOT A=1 and C=1 gives 1, so (0,? st derive the AND and NOT equivalents from NAND, then build the circuit. This exercise links digital electronics to mechanical safety interlocks.
所需的布尔表达式为 S = (A AND B) OR (NOT A AND C)。真值表有八行；S 在以下输入时取 1：(1,1,0)，(1,1,1)，(0,0,1)，(0,1,1)。首先从与非门推导出与门和非门的等效电路，再构建完整逻辑。该练习将数字电子学与机械安全互锁装置联系起来。
3. Algorithms and DNA Sequence Analysis | 算法与 DNA 序列分析
Biologists search for a short DNA motif 'ATGCG' within a long sequence. Write pseudocode for a linear search algorithm that returns the index position of the first occurrence. Extend the algorithm to count all non-overlapping occurrences. Discuss how the use of data structures like arrays and the choice between linear and binary search affect efficiency when handling millions of base pairs.
生物学家在一段长序列中搜索短 DNA 模体 'ATGCG'。编写线性搜索算法的伪代码，返回首次出现的索引位置。扩展该算法以统计所有不重叠的出现次数。讨论在数百万碱基对数据处理中，数组等数据结构的使用以及线性搜索与二分搜索的选择如何影响效率。
Pseudocode can initialise a counter and loop through the main sequence, comparing substrings of length 5. For counting non-overlapping occurrences, when a match is found, the loop index advances by the motif length instead of 1. Because DNA sequences are not sorted, binary search cannot be applied directly; hash tables or indexed structures like suffix arrays are preferred in bioinformatics. This reinforces algorithmic design within a genetics context, a classic interdisciplinary topic.
伪代码可以初始化一个计数器，并循环遍历主序列，比较长度为 5 的子串。对于统计不重叠的出现，当找到匹配时，循环索引增加模体长度而非 1。由于 DNA 序列未经排序，无法直接应用二分搜索；生物信息学中首选哈希表或后缀数组等索引结构。这强化了遗传学背景下的算法设计，是一个经典的跨学科主题。
4. Databases and Social Science Surveys | 数据库与社会科学调查
y and stores responses in a relational database. Table STUDENT contains StudentID, YearGroup, House; table RESPONSE records StudentID, QuestionID, Score (1-5). Write an SQL query to find the average score for 'Feeling Safe' up, only for YearGroups 10 and 11. Explain how primary keys and foreign keys enforce integrity in this cross-curricular investigation.
某学校进行一项幸福感调查，并将回复存储在关系数据库中。STUDENT 表包含 StudentID、YearGroup、House；RESPONSE 表记录 StudentID、QuestionID、Score（1 至 5）。编写一条 SQL 查询，按年级统计 'Feeling Safe'（QuestionID = 12）的平均分，仅针对 10 和 11 年级。解释在该跨学科调查中主键和外键如何确保完整性。
The required SQL query:
ESPONSE ON STUDENT.StudentID = RESPONSE.StudentID WHERE QuestionID = 12 AND YearGroup IN ('Year10','Year11') GROUP BY YearGroup;
The primary key StudentID in STUDENT uniquely identifies each pupil; the foreign key StudentID in RESPONSE ensures every response is linked to an existing student, preventing orphan records. This scenario melds database theory with social research methodology, typical of IGCSE cross-topic questions.
所需的 SQL 查询为：
ESPONSE ON STUDENT.StudentID = RESPONSE.StudentID WHERE QuestionID = 12 AND YearGroup IN ('Year10','Year11') GROUP BY YearGroup;
STUDENT 表中的主键 StudentID 唯一标识每位学生；RESPONSE 表中的外键 StudentID 确保每条回复都链接到一个现有学生，防止孤立记录。这一情境将数据库理论与社会研究方法论融合，是 IGCSE 跨主题问题的典型。
5. Data Representation and Chemical Formulae | 数据表示与化学式
Chemical formulae like C6H12O6 can be stored as strings. Describe how a computer could validate if the formula contains only valid element symbols and correctly formatted subscripts. Design a check-digit system for a molecular formula database, using a weighted modulo-11 checksum. How would character encoding (ASCII vs Unicode) affect storage requirements for a database of 10 million compounds?
像 C6H12O6 这样的化学式可存储为字符串。描述计算机如何验证化学式是否仅包含有效的元素符号和正确格式的下标。为分子式数据库设计一个校验位系统，采用加权模 11 校验和。字符编码（ASCII 与 Unicode 比较）将如何影响一千万个化合物的数据库存储需求？
Validation algorithms parse the string, using a state machine to recognise uppercase letters followed by optional lowercase letters and optional numeric subscripts. A checksum can assign each character a numeric code, multiply by position weight, sum, then compute modulo 11; the remainder is appended as a check character. In ASCII, each character uses 7 bits (often stored as 1 byte); Unicode may use up to 4 bytes per character for extended symbols. Storing 10 million formulae of average length 20 characters in ASCII would need about 200 MB, while Unicode could quadruple this. This merges data representation with chemistry and computational efficiency.
验证算法解析字符串，使用状态机识别大写字母、可选的小写字母和可选的数字下标。校验和可为每个字符分配一个数字代码，乘以位置权重，求和，然后计算模 11；余数作为校验字符附加。在 ASCII 中，每个字符使用 7 位（通常存储为 1 字节）；Unicode 对于扩展符号可能每字符最多 4 字节。以 ASCII 存储一千万个平均长度为 20 个字符的化学式大约需要 200 MB，而 Unicode 可能使其翻四倍。这项内容将数据表示与化学和计算效率融合起来。
6. Programming and Mathematical Modelling | 编程与数学建模
Write a short program, in pseudocode or Python, that models the spread of a plant disease in a field. Each day, a healthy plant (state 0) adjacent to an infected plant (state 1) has a 30% chance of becoming infected. Represent the field as a 2D array. Determine the number of days until 90% of plants are infected. Explain how the use of random numbers introduces Monte Carlo simulation and why multiple runs are necessary. How does this relate to IGCSE Computer Science learning outcomes on arrays, iteration, and testing?
用伪代码或 Python 编写一个简短程序，模拟植物病害在田间的传播。每天，与受感染植物（状态 1）相邻的健康植物（状态 0）有 30% 的概率被感染。将田地表示为二维数组。确定达到 90% 植株受感染所需的天数。解释随机数的使用如何引入蒙特卡洛模拟，以及为何需要多次运行。这与 IGCSE 计算机科学中关于数组、迭代和测试的学习成果有何关联？
The core algorithm uses nested loops to scan the grid, applying infection rules to a temporary copy to avoid updating within the same day. A counter tracks days and continues while proportion infected < 0.9. Random probability is checked with a function like IF RANDOM() < 0.3. Because the process is stochastic, one run yields only a single timeline; averaging over many runs (Monte Carlo method) gives a reliable expected duration. This perfectly ties programming to statistical mathematics and reinforces debugging strategies.
核心算法使用嵌套循环扫描网格，将感染规则应用到一个临时副本上，避免在同一天内更新。计数器记录天数并持续直到感染比例小于 0.9。随机概率通过类似 IF RANDOM() < 0.3 的语句检查。由于过程是随机的，单次运行仅产生一条时间线；多次运行取平均值（蒙特卡洛方法）可给出可靠的预期持续时间。这完美地将编程与统计数学联系起来，并强化了调试策略。
7. Networks and Geographic Information Systems | 网络与地理信息系统
Internet routers direct data packets based on IP addresses. A simplified geographic routing model uses the first octet to identify a continent: 192 for Europe, 10 for Americas, 130 for Asia. Explain how a router uses a routing table to forward a packet destined for 130.25.67.89. If latency between continents is modelled as proportional to great-circle distance, compute the estimated latency increase when a packet from London (51.5° N, 0.1° W) is routed via Tokyo (35.7° N, 139.7° E) instead of directly from London to New York (40.7° N, 74.0° W).
互联网路由器根据 IP 地址定向数据包。一个简化的地理路由模型使用第一字节识别大洲：192 代表欧洲，10 代表美洲，130 代表亚洲。解释路由器如何使用路由表转发目标为 130.25.67.89 的数据包。若大洲之间的延迟与球面距离成正比，计算当从伦敦（51.5° N, 0.1° W）发往纽约（40.7° N, 74.0° W）的数据包被经由东京（35.7° N, 139.7° E）路由时，估算的延迟增加量。
Routing tables store prefix-to-interface mappings. Seeing destination 130.x.x.x, the router matches the entry for 130.0.0.0/8 and forwards through the interface connected to Asia. The direct London–New York great-circle distance is about 5,570 km. London–Tokyo is about 9,560 km, Tokyo–New York about 10,840 km, total 20,400 km. The indirect path is thus roughly 3.66 times longer, implying a proportional latency increase. This blends networking with practical geography and proportional reasoning.
路由表存储前缀到接口的映射。看到目标地址 130.x.x.x，路由器匹配 130.0.0.0/8 的条目，并通过连接亚洲的接口转发。伦敦到纽约的球面距离约为 5,570 km。伦敦到东京约 9,560 km，东京到纽约约 10,840 km，合计 20,400 km。因此，间接路径大约是其 3.66 倍长，意味着延迟按比例增加。这融合了网络知识与实用地理和比例推理。
8. System Life Cycle and Economic Cost-Benefit Analysis | 系统生命周期与经济学成本效益分析
A small business plans to replace its legacy stock-control system with a new cloud-based solution. The initial investment is £45,000 for development, data migration, and training. Annual savings from reduced waste and labour are estimated at £18,000. After 3 years, a major update costs £8,000. Compute the payback period and net present value (NPV) assuming a discount rate of 5%. Explain how feasibility study and requirements analysis stages in the system life cycle would have contributed to these estimates.
一家小型企业计划用新的云端解决方案替换旧的库存控制系统。初始投资为 45,000 英镑，用于开发、数据迁移和培训。每年因减少浪费和人工而节省的成本估计为 18,000 英镑。3 年后，一次重大更新需花费 8,000 英镑。计算投资回收期和净现值 (NPV)，假设折现率为 5%。解释系统生命周期中的可行性研究和需求分析阶段如何为这些估算提供依据。
nd;9,000; Year 3 +£9,000 (including -£8,000 update, so net flow +£10,000? 000). Thus payback occurs during Year 3. NPV = -45000 + 18000/1.05 + 18000/1.05² + 10000/1.05³ ≈ -£2,563 (unfavourable). The feasibility study evaluates economic viability; requirements analysis defines the scope that shapes cost and saving figures. This connects software engineering with basic financial mathematics.
累积净现金流：第 0 年 -45,000 英镑；第 1 年 -27,000 英镑；第 2 年 -9,000 英镑；第 3 年（含 8,000 英镑更新，净现金流 +10,000 英镑）累计为 -9,000 + 10,000 = 1,000 英镑。因此投资回收期发生在第 3 年内。NPV = -45000 + 18000/1.05 + 18000/1.05² + 10000/1.05³; ≈ -2,563 英镑（不利）。可行性研究评估经济可行性；需求分析界定范围，从而形成成本和节省数据。这联系了软件工程与基础金融数学。
9. Sensors, Actuators and Environmental Control | 传感器、执行器与环境控制
An automated greenhouse uses sensors for temperature, humidity, and soil moisture. Explain how the microprocessor reads these sensors and controls a heater, fan, and irrigation valve. Draw a block diagram showing the feedback loop. How does an interrupt from a rain sensor modify the control flow? This example integrates computer system architecture with biology and environmental science.
一个自动化温室使用温度、湿度和土壤水分传感器。解释微处理器如何读取这些传感器并控制加热器、风扇和灌溉阀。画出展示反馈回路的框图。雨量传感器的中断如何改变控制流程？该示例将计算机系统架构与生物学和环境科学相结合。
The microprocessor continuously cycles: read ADC values from sensors, compare against preset thresholds (e.g., temperature < 22°C), and send signals to actuators via output ports. The feedback loop includes sensor → processor → actuator → environment → sensor. When a rain sensor triggers an interrupt, the processor suspends the main loop, executes an interrupt service routine to close irrigation valves and possibly open vents, then resumes. This is a real-world embedded system that crosses into ecology.
微处理器持续循环：从 ADC 读取传感器数值，与预设阈值比较（例如温度 < 22°C），并通过输出端口发送信号至执行器。反馈回路为传感器 → 处理器 → 执行器 → 环境 → 传感器。当雨量传感器触发中断时，处理器暂停主循环，执行中断服务程序以关闭灌溉阀并可能打开通风口，然后恢复。这是一个横跨生态学的现实嵌入式系统。
10. Intelligent Tutoring and Natural Language Processing | 智能教学与自然语言处理
A simple AI tutor asks students a multiple-choice question and analyses their typed reasoning. Outline how keyword matching and sentiment analysis (using basic lexicon) could judge whether the reasoning is 'adequate' or 'needs review'. What are the limitations of this rule-based approach? Link your discussion to IGCSE topics: artificial intelligence, the differences between human and machine reasoning, and the role of heuristics.
一个简单的 AI 导师向学生提出一个多项选择题，并分析他们打字的推理过程。概述关键词匹配和情感分析（使用基础词典）如何判断推理是“充分”还是“需复习”。这种基于规则的方法有哪些局限性？将你的讨论与 IGCSE 主题联系起来：人工智能、人类与机器推理的差异以及启发式方法的作用。
The system tokenises the input, checks for a set of domain-specific keywords (e.g., 'photosynthesis', 'chlorophyll') and positive/negative cue words. If keyword hit count > threshold and no negation words are detected, the answer is labelled 'adequate'. This rule-based system lacks true understanding; it cannot handle subtle phrasing or novel reasoning. It exemplifies the limits of simple AI, contrasting with IGCSE coverage of expert systems and heuristic problem-solving.
系统将输入分词，检查一组领域特定的关键词（如“photosynthesis”、“chlorophyll”）和正面/负面提示词。若关键词命中计数大于阈值且未检测到否定词，答案即标记为“充分”。这种基于规则的系统缺乏真正的理解；它无法处理细微的措辞或新颖的推理。它展示了简单 AI 的局限，与 IGCSE 对专家系统和启发式问题解决的覆盖形成对照。
11. Ethical Hacking and Forensic Science | 伦理黑客与法证科学
In a digital forensics investigation, an examiner recovers a log file showing repeated failed login attempts followed by a successful access from an unusual IP. Using the cybersecurity principles of authentication, access rights, and audit trails, explain how the incident could be re-constructed. Which computer ethics issues arise from the examiner accessing private emails to trace the intruder? Refer to the Computer Misuse Act and data protection legislation.
在一次数字取证调查中，检查人员恢复了一个日志文件，显示反复的登录失败尝试，随后从一个异常 IP 成功访问。运用身份验证、访问权限和审计追踪等网络安全原则，解释如何重建该事件。检查人员为了追踪入侵者而访问私人电子邮件会引发哪些计算机伦理问题？请参照《计算机滥用法》和数据保护法规。
The audit trail (logs) records timestamps, usernames, and IPs. The sequence suggests a brute-force attack; the successful entry indicates compromised credentials. The examiner can correlate IP geolocation and session activity to map the intruder's actions. Ethically, accessing private emails may breach confidentiality unless a lawful warrant exists. The Computer Misuse Act criminalises unauthorised access, but investigators with permission are exempt; data protection laws require privacy safeguards even during investigations. This marries computer security with legal studies.
审计追踪（日志）记录了时间戳、用户名和 IP。该序列暗示暴力攻击；成功进入表明凭证已被泄露。检查人员可以将 IP 地理位置和会话活动关联起来，以描绘入侵者的行为。伦理上，除非有合法授权，否则访问私人电子邮件可能违反保密原则。《计算机滥用法》将未经授权的访问定为犯罪，但获许可的调查人员除外；数据保护法律要求即使在调查期间也要保护隐私。这结合了计算机安全与法律研究。
12. Flowcharts, Traffic Simulation and Urban Planning | 流程图、交通模拟与城市规划
A traffic light at a crossroads uses a sensor-based intelligent system. During off-peak hours, the lights stay green for the main road until a vehicle is detected on the side road. Draw a flowchart for this algorithm. How could a larger system simulate traffic flow over a city grid using a 2D matrix of occupancy? Discuss how this relates to modelling, abstraction, and the efficiency of algorithms, key components of the IGCSE Computational Thinking paper.
一个十字路口的交通灯使用基于传感器的智能系统。在非高峰时段，主路始终绿灯，直到检测到支路有车辆。为该算法绘制流程图。一个更大的系统如何利用占用矩阵的二维网格模拟城市路网的交通流？讨论这与建模、抽象以及算法效率的关联，这些是 IGCSE 计算思维试卷的关键组成部分。
The flowchart begins with 'Main road green', loops while 'No vehicle on side road?', then transitions to side-road green for a timed period before returning. A city simulation abstracts roads as edges and intersections as nodes, storing vehicle counts in a 2D array; each time step updates positions based on rules. Efficiency is critical: naive iteration over thousands of cells demands optimised data structures and parallel processing concepts. Abstraction removes irrelevant details, a core computational thinking skill tested in IGCSE.
流程图始于“主路绿灯”，循环检查“支路是否有车？”，若无车则保持；检测到车后转为支路绿灯一段时间再返回。城市模拟将道路抽象为边，路口为节点，将车辆数量存储在二维数组中；每个时步根据规则更新位置。效率至关重要：对数千个单元格的朴素迭代需要优化的数据结构及并行处理概念。抽象去除了无关细节，这是 IGCSE 测试的核心计算思维技能。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图