📚 Year 11 Eduqas Computer Science: Cross-curricular Integrated Question Practice | 跨学科综合题型训练
Computer science is not an isolated subject. Its concepts and skills extend across mathematics, sciences, geography, arts, and even ethics. In the Eduqas GCSE Computer Science exam, you will encounter integrated questions that require you to apply computational thinking to real-world, cross-curricular contexts. This article presents a series of practice problems that blend computer science with other disciplines, helping you strengthen both your subject knowledge and your ability to think beyond the textbook.
计算机科学不是一门孤立的学科。它的概念和技能延伸到数学、自然科学、地理、艺术甚至伦理等领域。在 Eduqas 的 GCSE 计算机科学考试中，你会遇到需要将计算思维应用于真实世界跨学科情境的综合题目。本文提供了一系列将计算机科学与其他学科结合的练习题，帮助你巩固学科知识，同时锻炼超越课本的思维能力。
1. Mathematics: Number Sequences and Pseudocode | 数学：数列与伪代码
hm to determine if the nth term is even or odd. Use a trace table for n = 6 to check your logic. Finally, can you spot a pattern? Investigate whether every third term in the Fibonacci sequence is always even.
问题：用伪代码编写一个算法，输出斐波那契数列的前 n 项，其中 n 由用户输入。然后扩展算法，判断第 n 项是奇数还是偶数。使用 n = 6 的跟踪表检查逻辑。最后，你能发现一个规律吗？探究斐波那契数列中每隔两项是否为偶数。
rm in an array or simply print it. To check evenness, use the modulo operator MOD. A number is even if number MOD 2 = 0. Tracing n = 6: terms are 1, 1, 2, 3, 5, 8; the 6th term is 8, which is even. The pattern emerges because odd + odd = even, odd + even = odd, and even + odd = odd, repeating every three steps.
解题思路：首先将前两项初始化为 1 和 1。使用循环将前两项相加生成下一项。将每一项存储在数组中或直接打印。判断奇偶性使用取模运算符 MOD。若 number MOD 2 = 0，则为偶数。跟踪 n = 6：项为 1, 1, 2, 3, 5, 8；第 6 项为 8，是偶数。规律源于奇数 + 奇数 = 偶数，奇数 + 偶数 = 奇数，偶数 + 奇数 = 奇数，每三步重复一次。
Pseudocode snippet:
伪代码片段：
OUTPUT "Enter n:"
INPUT n
a ← 1
b ← 1
FOR i ← 1 TO n
IF i = 1 OR i = 2 THEN
OUTPUT a
ELSE
c ← a + b
OUTPUT c
a ← b
b ← c
ENDIF
ENDFOR
IF b MOD 2 = 0 THEN
OUTPUT "Even"
ELSE
OUTPUT "Odd"
ENDIFThis exercise links sequences from mathematics with algorithmic design, iteration, and selection — core components of the Eduqas programming paper.
这个练习将数学中的数列与算法设计、迭代和选择结合起来——这些都是Eduqas编程试卷的核心组成部分。
2. Physics: Binary Data Logging and Sensor Accuracy | 物理：二进制数据记录与传感器精度
Problem: A temperature sensor in a physics lab records readings as 8‑bit unsigned binary integers. The sensor range is 0°C to 100°C, and the reading value 0 represents 0°C, while 255 represents 100°C. Calculate the resolution of the sensor in °C per bit. If the actual temperature is 23.6°C, what binary value will the sensor most likely transmit? What is the quantisation error?
问题：物理实验室中一个温度传感器以 8 位无符号二进制整数记录读数。传感器量程为 0°C 到 100°C，数值 0 代表 0°C，255 代表 100°C。计算该传感器每比特的分辨率（°C/bit）。如果实际温度为 23.6°C，传感器最可能发送的二进制值是多少？量化误差有多大？
d integer level n = round(23.6 / 0.392) ≈ round(60.2) = 60. The binary representation of 60 is 00111100 in 8‑ l temperature and the temperature represented by level 60: 60 × 0.392°C ≈ 23.53°C; error = |23.6 − 23.53| onverting analogue measurements to digital data, an important concept in computer systems.
分辨率：100°C 范围被分成 256 个等级（0 到 255）。因此分辨率 = 100°C / 255 ≈ 每步 0.392°C。要表示 23.6°C，需要整数等级 n = round(23.6 / 0.392) ≈ round(60.2) = 60。60 的 8 位二进制表示为 00111100。量化误差是实际温度与等级 60 所代表温度之间的差值：60 × 0.392°C ≈ 23.53°C；误差 = |23.6 − 23.53| = 0.07°C。这体现了将模拟测量转换为数字数据时不可避免的精度损失，是计算机系统中的一个重要概念。
3. Geography: Sorting World City Populations | 地理：世界城市人口排序
Problem: You are given a dataset containing the names and populations of eight megacities. Using the bubble sort algorithm, write a pseudocode or program to sort the cities in descending order of population. Then, discuss the efficiency of bubble sort for larger datasets and suggest an alternative algorithm that would be more suitable for 100,000 cities.
问题：给定一个包含八座超大城市名称和人口的数据集。使用冒泡排序算法，编写伪代码或程序将城市按人口降序排列。然后，讨论冒泡排序对更大数据集的效率，并推荐一种更适合处理 10 万座城市数据的算法。
Solution: Store the data in two parallel arrays: names[8] and populations[8]. Implement bubble sort by repeatedly swapping adjacent elements if populations[j] < populations[j+1] (for descending order). After each pass, the smallest element bubbles to the end. For 8 items, the maximum number of passes is 7. Pseudocode would involve nested loops with a swap flag to optimise early termination.
解答：将数据存储在两个平行数组中：names[8] 和 populations[8]。实现冒泡排序：若 populations[j] < populations[j+1]（降序），则反复交换相邻元素。每趟排序后，最小的元素会“冒泡”到末尾。对于 8 个项目，最多需要 7 趟。伪代码会涉及嵌套循环并使用交换标志以优化提前终止。
Efficiency analysis: Bubble sort has O(n²) time complexity. For 100,000 cities, the number of comparisons would be approximately 5 billion — impractical. A more efficient algorithm is merge sort or quick sort, both with average time complexity O(n log n). This integrates computational thinking with geographical data, emphasising the importance of algorithm selection in real applications.
效率分析：冒泡排序的时间复杂度为 O(n²)。对于 10 万座城市，比较次数将接近 50 亿次，不切实际。更高效的算法是归并排序或快速排序，两者的平均时间复杂度均为 O(n log n)。这一练习将计算思维与地理数据相结合，强调了实际应用中算法选择的重要性。
4. Biology: Simulating Predator-Prey Dynamics | 生物：模拟捕食者-猎物动态
Problem: A simplified ecosystem contains foxes (predators) and rabbits (prey). Each year, the rabbit population doubles, but each fox eats 20 rabbits. The fox population increases by 1 for every 50 rabbits eaten, but decreases by 1 per year due to other factors. Given initial populations of 100 rabbits and 5 foxes, write a program in pseudocode to simulate the population changes over 10 years. Output the populations each year and identify any patterns.
问题：一个简化的生态系统中包含狐狸（捕食者）和兔子（猎物）。每年，兔子数量翻倍，但每只狐狸吃掉 20 只兔子。每吃掉 50 只兔子，狐狸数量增加 1，但每年因其他因素减少 1 只。给定初始数量：兔子 100 只，狐狸 5 只，用伪代码编写程序模拟 10 年的种群变化。输出每年的种群数量并识别任何模式。
(the actual rabbits consumed). New foxes = F + int(eaten / 50) − 1. Ensure populations don' modelling, a key aspect of computer science used in biology and environmental science. You'll observe oscillations typical of the Lotka‑Volterra model.
建模步骤：使用变量 R 和 F。每次迭代（每年）：新兔子数 = (R * 2) − (F * 20)；如果新兔子数小于 0，则设为 0。然后计算实际被吃掉的兔子数 = R * 2 − 新兔子数。新狐狸数 = F + int(被吃数 / 50) − 1。确保数量非负。循环 10 年。该模拟引入了计算建模，是计算机科学在生物学和环境科学中的一个关键应用。你将观察到类似 Lotka‑Volterra 模型的振荡现象。
5. Chemistry: Molar Mass Calculator Using Dictionaries | 化学：使用字典的摩尔质量计算器
e atomic masses of common elements: H=1.008, C=12.011, O=15.999, N=14.007, etc. The program must parse the formula, handling capital letters, optional lowercase letters, and numbers. Assume coefficients are only single digits (1–9) for simplicity. Discuss how you would extend the algorithm to handle multi‑digit numbers.
问题：设计一个程序，计算用户输入的化学式的摩尔质量，例如 H2O 或 C6H12O6。使用字典存储常见元素的原子量：H=1.008，C=12.011，O=15.999，N=14.007 等。程序必须解析化学式，能处理大写字母、可选的小写字母和数字。为简化起见，假设系数仅为个位数字（1–9）。讨论如何扩展算法以处理多位数字。
Parsing strategy: Iterate through the string. When an uppercase letter is found, that's a new element; if followed by a lowercase, combine to get the full symbol. Then check the next characters for a digit subscript. Multiply the atomic mass by the subscript (or 1 if none) and add to a running total. This exercise links string manipulation and data structures (dictionaries) with chemical calculations, a common cross‑curricular task. For multi‑digit numbers, continue reading digits until a non‑digit character appears, building the integer value.
解析策略：遍历字符串。找到大写字母时，即为一个新元素；若后跟小写字母，则组合得到完整符号。然后检查后续字符是否为数字下标。将原子量乘以该下标（若无则乘以 1）并累加到总和中。这个练习将字符串操作和数据结构（字典）与化学计算联系起来，是一种常见的跨学科任务。对于多位数字，可继续读取数字字符直到遇见非数字字符，从而构建整数值。
6. Business: Normalising a Database for a Small Shop | 商业：小型商店数据库的规范化
Problem: A corner shop keeps sales records in a single flat file: OrderID, CustomerName, CustomerPhone, ProductName, ProductPrice, Quantity, Date. Identify the data redundancy and update anomalies. Then redesign the data into 3rd normal form, specifying the primary keys and foreign keys for each table. Explain why normalisation is important for data integrity and efficient storage.
问题：一家街角小店用单一的平面文件保存销售记录：订单号、客户姓名、客户电话、商品名称、商品价格、数量、日期。找出数据冗余和更新异常现象。然后将数据重新设计为第三范式，为每个表指定主键和外键。解释规范化对数据完整性和存储效率的重要性。
Solution: Redundancy arises because customer details are repeated for every order, and product prices are repeated for each sale. If a customer's phone number changes, multiple rows must be updated — update anomaly. Three tables needed: Customers (CustomerID PK, Name, Phone); Products (ProductID PK, ProductName, Price); Orders (OrderID PK, CustomerID FK, ProductID FK, Quantity, Date). This splits the data logically. Normalisation reduces duplicates and ensures consistency, a key concept in database design covered in Eduqas.
解决方案：冗余源于每条订单都重复存储客户详细信息，且商品价格在每次销售中都重复。若客户更换电话号码，需更新多行，造成更新异常。需要三个表：Customers（CustomerID 主键，姓名，电话）；Products（ProductID 主键，商品名，价格）；Orders（OrderID 主键，CustomerID 外键，ProductID 外键，数量，日期）。这实现了数据的逻辑分离。规范化减少了重复并确保一致性，是 Eduqas 课程中数据库设计的关键概念。
7. Linguistics: Caesar Cipher and Frequency Analysis | 语言学：凯撒密码与频率分析
Problem: In cryptography, a Caesar cipher shifts each letter by a fixed number of positions. Write a program that decrypts a given ciphertext without knowing the shift, using frequency analysis: the most frequent letter in English is typically 'E'. Assume the input contains only uppercase letters and spaces. Your program should output the most likely plaintext. Discuss limitations of this approach for short texts.
问题：在密码学中，凯撒密码将每个字母移动固定位数。编写程序，在不知偏移量的情况下，利用频率分析解密密文：英语中最常见的字母通常是 'E'。假定输入只包含大写字母和空格。程序应输出最可能的明文。讨论该方法对短文本的局限性。
he ciphertext (ignore spaces). Find the letter with the highest count. Assume this maps to 'E'. Calculate shift = (ord(most_frequent_letter) − ord('E' everse shift to all letters to produce the plaintext. If the most frequent letter is, say, 'J', shift = (74 − 69) mod 26 = 5, meaning a 5‑ tatistical patterns are unreliable, and brute force (25 possible shifts) might be more practical.
算法：统计密文中每个字母的频率（忽略空格）。找出出现次数最多的字母。假定它对应 'E'。计算偏移量 = (most_frequent_letter 的 ASCII 码 − 'E' 的 ASCII 码) mod 26。然后对所有字母实施反向偏移以生成明文。若最常见字母为 'J'，偏移 = (74 − 69) mod 26 = 5，代表向后移动 5 位。此技术将计算机科学与语言学和历史（密码分析）相联系。然而，对于非常短的文本，统计模式不可靠，暴力遍历 25 种偏移更实际。
8. Environmental Science: Analysing Rain Gauge Data with Arrays | 环境科学：用数组分析雨量计数据
alculates: the total rainfall, the average rainfall, the highest and lowest daily rainfall, and the number of dry days (rainfall = 0). Also, output the days when rainfall exceeded the average. Use pseudocode with appropriate iteration and selection.
问题：某气象站记录了一个月（30天）的日降雨量（单位：毫米）。编写算法将数据读入一维数组，然后计算：总降雨量、平均降雨量、日最高和最低降雨量、以及无雨天（降雨量 = 0）的天数。同时，输出降雨量超过平均值的所有日期。使用伪代码并包含恰当的迭代和选择结构。
ax and min to the first element, then iterate to update if a value is higher or lower. Count dry days with a counter increment. Finally, a second loop prints each day index+1 if rainfall[index] > average. This reinforces 1D array algorithms and integrates with environmental data analysis, showing how computers support scientific monitoring and climate studies.
数组处理：填充数组后，使用 FOR 循环累加所有元素。计算平均值 = 总降雨量 / 30。将最大值和最小值初始化为第一个元素，然后迭代，若数值更高或更低则更新。用计数器统计无雨天。最后，第二个循环检查若 rainfall[index] > 平均值，则打印第 index+1 天。这强化了一维数组算法，并与环境数据分析相结合，展示了计算机如何支持科学监测和气候研究。
9. Ethics, Law and Computing: GDPR Compliance for a Health App | 伦理、法律与计算机：健康应用的 GDPR 合规
Problem: A startup develops a health app that collects users' heart rate, sleep patterns, and location data. Under the General Data Protection Regulation (GDPR), identify at least three principles that the company must follow. Explain how these principles influence the app's database design and user interface. Discuss the potential consequences of a data breach.
问题：一家初创公司开发了一款健康应用，收集用户的心率、睡眠模式和位置数据。根据《通用数据保护条例》（GDPR），指出该公司必须遵守的至少三项原则。解释这些原则如何影响应用的数据库设计和用户界面。讨论数据泄露的潜在后果。
Key principles: Data minimisation — only collect data that is necessary; purpose limitation — use data only for the stated purposes; storage limitation — retain data no longer than needed; integrity and confidentiality — ensure appropriate security measures. In database design, this means storing only essential fields, encrypting sensitive personal data, and implementing access controls. The UI must provide clear consent forms and easy option to withdraw consent or delete data. A breach could lead to heavy fines, reputational damage, and loss of user trust. This topic connects computer systems and ethical/legal considerations directly from the Eduqas specification.
关键原则：数据最小化——只收集必要数据；目的限制——数据仅用于声明目的；存储限制——数据保存时间不得超过必要期限；完整性和保密性——采取适当的安全措施。在数据库设计中，意味着只存储必要字段，加密敏感个人数据并实施访问控制。用户界面必须提供清晰的同意书以及轻松撤回同意或删除数据的选项。数据泄露可能导致巨额罚款、声誉损害和用户信任丧失。该主题将计算机系统与 Eudqas 考纲中的伦理和法律考量直接联系起来。
10. Art and Design: Generating Fractal Tree Patterns with Recursion | 艺术与设计：用递归生成分形树图案
Problem: A digital artist wants to draw a recursive fractal tree using a turtle graphics library. The trunk length is given, and at each end, two branches grow at 30° left and right, each 0.7 times the length of the parent branch. The recursion stops when the branch length becomes less than 2 units. Write a recursive algorithm in pseudocode or describe the recursion. Show the call stack for an initial trunk length of 100, just for the first two levels.
问题：一位数字艺术家希望使用海龟图形库绘制递归分形树。给定树干长度，在每个末端，两个分支分别向左和向右 30° 生长，长度为父分支的 0.7 倍。当分支长度小于 2 个单位时递归停止。用伪代码编写递归算法或描述递归过程。针对初始树干长度为 100 的情况，展示前两级的调用栈。
Recursive procedure: define tree(length). If length < 2, return. Draw forward by length. Turn left 30°, call tree(length * 0.7). Turn right 60°, call tree(length * 0.7). Turn left 30° to return to original heading, then move backward by length. The call stack: tree(100) draws trunk, calls tree(70) left; tree(70) draws branch, calls tree(49) left and right at that level, etc. Recursion is a powerful problem‑solving technique in computer science, and its visual output here links programming with artistic design.
递归过程：定义 tree(length)。若 length < 2，返回。向前移动 length 距离。左转 30°，调用 tree(length * 0.7)。右转 60°，调用 tree(length * 0.7)。左转 30° 恢复原方向，然后后退 length。调用栈：tree(100) 绘制树干，调用 tree(70) 左；tree(70) 绘制分支，在其层级调用 tree(49) 左和右，依此类推。递归是计算机科学中一种强大的问题解决技术，其可视化输出将编程与艺术设计联系起来。
11. Music Technology: Digital Sound and File Size Calculation | 音乐技术：数字音频与文件大小计算
Problem: A musician records a 3‑minute stereo audio clip. The sampling rate is 44.1 kHz, and each sample is stored as a 16‑bit value. Calculate the raw file size in megabytes (MB). Then, if a compressed format reduces the size by 85%, what is the new file size? Explain the trade‑off between file size and sound quality using knowledge of sampling theory.
问题：一位音乐家录制了一段 3 分钟立体声音频。采样率为 44.1 kHz，每个样本存储为 16 位数值。计算原始文件大小（以兆字节 MB 计）。如果采用一种压缩格式将文件体积减少 85%，新文件大小是多少？运用采样理论知识解释文件大小与音质之间的权衡。
total bits = 1,411,200 × 180 = 254,016,000 bits. Convert to bytes: divide by 8 = 31,752,000 bytes. In megabytes (divide by 1024²), that's approximately 30.28 MB. After 85% discarded. Higher sampling rates and bit depths capture more detail but increase file size — a direct connection between computer data representation and music.
计算：每秒总样本数 = 44100 样本 × 2 通道 = 88200 样本。比特率 = 88200 × 16 = 1,411,200 bps。3 分钟（180 秒）总位数 = 1,411,200 × 180 = 254,016,000 位。转换为字节：除以 8 得到 31,752,000 字节。以兆字节计（除以 1024²），约为 30.28 MB。压缩 85% 后，大小 = 30.28 × 0.15 ≈ 4.54 MB。压缩可能损失音频保真度，因为部分频率被丢弃。更高的采样率和位深度可捕获更多细节，但增大文件体积——这直接建立了计算机数据表示与音乐之间的联系。
12. Sports Science: Simulating a Penalty Shootout | 体育科学：模拟点球大战
Problem: In football, a penalty shootout is modelled as a best‑of‑5 series with sudden death if tied. Write a program that simulates a shootout between two teams, A and B, where each penalty has a 75% chance of scoring. Use a random number generator to decide each kick. Output the result after 5 rounds and then, if needed, continue sudden death. Discuss how altering the success probability affects the outcome distribution.
问题：在足球运动中，点球大战可建模为五轮制，平局后进入突然死亡。编写程序模拟 A、B 两队的点球大战，每次点球得分概率为 75%。使用随机数生成器决定每次射门。输出五轮后的结果，若需加赛则继续突然死亡。讨论改变成功概率如何影响结果分布。
Pseudocode: Set scoreA, scoreB = 0. For round 1 to 5: generate random(0– sses. Output final scores. Use a loop. This task applies random number generation and simulation, topics within computational thinking. Modifying probability to, say, 90% chance of tie after 5 rounds, showing how computer models help analyse sports strategies.
伪代码：设 scoreA, scoreB = 0。对于第 1 到第 5 轮：生成随机数 0–1，若 <0.75 则 A 队得分；B 队同理。五轮后若得分持平，反复交替踢球，直到一队得分而另一队未得分。输出最终比分。使用循环。该任务运用随机数生成和模拟，属于计算思维范畴。将概率改为 90% 会大幅增加五轮后平局的概率，表明计算机模型能帮助分析体育策略。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图