📚 Year 12 Edexcel Computer Science: Cross-Curricular Integrated Question Practice | A-Level Edexcel 计算机：跨学科综合题型训练
In Year 12 Edexcel Computer Science, assessment questions increasingly require you to draw on knowledge from Mathematics, Physics, Business, Geography, Psychology and other fields. These cross-curricular integrated questions challenge you to apply computational thinking in realistic, multi-disciplinary scenarios. This revision guide provides structured topic links, worked examples and exam-ready strategies to build your confidence and accuracy.
在Year 12 Edexcel计算机科学中，考题越来越多地要求你运用来自数学、物理、商业、地理、心理学等学科的知识。这些跨学科综合题型考验你在真实、多学科的场景中运用计算思维的能力。本复习指南提供结构化的学科联系、例题讲解和应试策略，帮助你增强信心、提升准确率。
1. What Are Cross-Curricular Integrated Questions? | 什么是跨学科综合题型？
Cross-curricular questions embed computer science concepts inside contexts borrowed from other subjects. You might analyse probability in error detection, apply Boolean algebra to a car safety circuit, write SQL for a business inventory, or evaluate ethical dilemmas framed by law. Edexcel designs such items to reflect how computing operates in the wider world.
跨学科综合题将计算机科学的概念嵌入到其他学科的背景中。你可能要分析错误检测中的概率问题、将布尔代数应用于汽车安全电路、为商业库存编写SQL查询，或者评估由法律框架界定的伦理困境。Edexcel设计这类题目是为了反映计算在现实世界中的运作方式。
2. Mathematics: Binary, Probability and Error Detection | 数学：二进制、概率与错误检测
t ASCII character gets an eighth parity bit. If the probability of any single bit flipping during transmission is p = 0.002, an undetected error occurs only when an even number of bits flip, because even parity would still appear correct.
AS课程主题2.2涉及数据完整性和奇偶校验。将此与数学统计相结合：考虑一个偶校验系统，每个7位ASCII字符附加第8位校验位。如果传输中任一比特发生翻转的概率为p = 0.002，那么只有在偶数个比特翻转时才会发生未检测到的错误，因为偶校验看起来仍然正确。
etected) = C(8,2)p² (1−p)⁶ + C(8,4)p⁴ (1−p)⁴ + C(8,6)p⁶ (1−p)² + C(8,8)p⁸. Plugging in p = 0.002 yields a very small number, highlighting the strength and limitation of simple parity.
在8位数据块中恰好k比特翻转的概率服从二项分布。对于未检测到的错误，k = 2, 4, 6, 8。其总和为P(未检出) = C(8,2)p² (1−p)⁶ + C(8,4)p⁴ (1−p)⁴ + C(8,6)p⁶ (1−p)² + C(8,8)p⁸。代入p = 0.002可得到一个极小的数值，这突显了简单奇偶校验的强度和局限。
P(undetected) = Σ (k∈{2,4,6,8}) ⁸Cₖ × (0.002)ᵏ × (0.998)⁸⁻ᵏ ≈ 1.1 × 10⁻⁵
This calculation reinforces your understanding of data integrity and shows why checksums or cyclic redundancy checks are needed in noisy channels.
这一计算加深了你对数据完整性理解，并说明了为何在噪声信道中需要校验和或循环冗余校验。
3. Physics Meets Logic Gates: Car Seatbelt Warning System | 物理与逻辑门：汽车安全带警报系统
on (1 = on, 0 = off), B = seatbelt sensor (1 = fastened, 0 = unfastened). The required output Y = A AND (NOT B). This is a cross-over with circuit design.
物理和电子学常使用布尔逻辑。汽车蜂鸣器需在点火开启且安全带未系时鸣响。设输入A = 点火（1=开，0=关），B = 安全带传感器（1=系好，0=未系）。所需输出Y = A AND (NOT B)。这是与电路设计的交叉。
The truth table maps the physical states to logic:
真值表将物理状态映射为逻辑：
| A (Ignition) | B (Seatbelt) | Y (Buzzer) |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
You can implement this with one AND gate and one NOT gate. Such questions test your ability to translate a real-life requirement into a logic circuit, directly linking to Topic 3.3: Boolean logic.
你可以用一个与门和一个非门实现此功能。这类题目考察你将现实需求转化为逻辑电路的能力，这直接联系到课程主题3.3：布尔逻辑。
4. Business and Databases: Inventory SQL Querying | 商业与数据库：库存SQL查询
Business studies overlap with Topic 4.2 (relational databases) when you manage stock levels. Given tables Product(ProdID, Name, Stock) and Orders(OrderID, ProdID, Qty), write an SQL query to list product names where current stock is below 15 and total ordered quantity exceeds 50. This mirrors a real inventory control problem.
商业研究与你管理库存水平时的主题4.2（关系数据库）有重叠。给定表Product(ProdID, Name, Stock) 和 Orders(OrderID, ProdID, Qty)，写出一条SQL查询，列出当前库存低于15且总订购数量超过50的产品名称。这反映了一个真实的库存控制问题。
A possible query structure:
一个可能的查询结构：
SELECT Name FROM Product WHERE Stock < 15 AND ProdID IN (SELECT ProdID FROM Orders GROUP BY ProdID HAVING SUM(Qty) > 50);
The nested SELECT groups orders by product, sums quantities, and filters those with sum > 50. The outer SELECT then ensures stock < 15. Understanding such queries prepares you for data manipulation and interpretation in commercial contexts.
嵌套的SELECT按产品对订单分组，对数量求和，并筛选出总和大于50的产品。外层的SELECT再确保库存小于15。理解这类查询能让你准备好应对商业环境中的数据操作与解释。
5. Law and Ethics: Data Protection in Social Media | 法律与伦理：社交媒体中的数据保护
Topic 5 (Issues and impact) demands awareness of the UK Data Protection Act 2018 (DPA) and GDPR. A social media platform must obtain explicit consent before processing user photos for facial recognition. If a question asks you to discuss the legal and ethical aspects, you need to cite lawfulness, fairness, transparency, purpose limitation and data minimisation.
主题5（问题与影响）要求了解《2018年英国数据保护法》(DPA) 和 GDPR。社交媒体平台在处理用户照片用于面部识别前必须获得明确同意。如果题目要求你讨论法律和伦理方面，你需要引用合法性、公平性、透明度、目的限制和数据最小化原则。
An exam answer could structure arguments around: (1) consent must be freely given, specific, informed and unambiguous; (2) biometric data is special category data requiring stronger protection; (3) users have rights to access, rectification and erasure. Linking these to computing shows deep cross-curricular understanding.
考试答案可以围绕以下几点构建论证：（1）同意必须自由给出、具体、知情且明确；（2）生物特征是特殊类别数据，需更强保护；（3）用户拥有访问、更正和删除的权利。将这些与计算联系起来展示了深入的跨学科理解。
6. Biology-Inspired Algorithms: Sorting and Natural Selection | 仿生算法：排序与自然选择
Biological processes inspire algorithms. Insertion sort resembles the way a biologist might order specimens by gradually inserting each new item into an already sorted sequence. More abstractly, genetic algorithms mimic evolution, but at AS, you can connect sorting behaviour to efficiency in biological data sets, such as arranging gene sequences.
生物学过程启发了算法。插入排序类似于生物学家将每个新标本逐步插入已排序序列的排序方式。更抽象地，遗传算法模拟进化，但在AS阶段，你可以将排序行为与生物数据集的效率联系起来，例如整理基因序列。
If given a partially sorted list of DNA fragment lengths, insertion sort runs in near O(n) time. A question might ask you to justify which sorting algorithm suits biological data best, rewarding knowledge of algorithm complexity (Topic 1) and science context.
如果给定一份已部分排序的DNA片段长度列表，插入排序的运行时间接近O(n)。题目可能要求你说明哪种排序算法最适合生物数据，这同时考察算法复杂度知识（主题1）和科学背景。
7. Geography and Networks: Undersea Fibre Optic Latency | 地理与网络：海底光纤延迟
Atlantic carries data between London and New York. The great-circle distance is about 5600 km. Light travels in fibre at roughly 2 × 10⁸ m s⁻¹. The minimum latency due to propagation is distance / speed.
网络性能（主题4）涉及自然地理。横跨大西洋的海底光纤电缆在伦敦和纽约之间传输数据。大圆距离约为5600公里。光在光纤中的传播速度约为2×10⁸ 米/秒。由传播导致的最低延迟为距离/速度。
Propagation delay = 5600 × 10³ m ÷ (2 × 10⁸ m s⁻¹) = 0.028 s = 28 ms
Adding switching delays might raise this to 60–70 ms. Such calculations blend physics, geography and networking, illustrating why distance matters for cloud server placement and user experience.
加上交换延迟可能使总延迟升至60-70毫秒。这类计算融合了物理、地理和网络，说明了距离对云服务器部署和用户体验的重要性。
8. Economics: Algorithmic Complexity and Cost Analysis | 经济学：算法复杂度与成本分析
hinking links algorithm efficiency to financial cost. Suppose a cloud database query costs £ On a dataset of n = 10⁶ records, an O(n²) algorithm makes roughly 10¹² operations, costing £80 000. An O(n log₂ n) algorithm with n log₂ n ≈ 2 × 10⁷ operations costs only about £1.60. The choice of algorithm has dramatic economic impact.
经济学思维将算法效率与财务成本联系起来。假设一个云数据库查询每次基本操作花费0.00008英镑。对于n = 10⁶条记录的数据集，一个O(n²)算法大约需要10¹²次操作，成本为80,000英镑。而一个O(n log₂ n)算法，当n log₂ n ≈ 2×10⁷次操作时，成本仅为约1.60英镑。算法的选择具有巨大的经济影响。
An integrated question may present a business scenario and ask you to estimate operational expenditure, combining algorithmic reasoning with economic evaluation. Always consider best, average and worst case complexities.
一道综合题可能给出商业情景，要求你估算运营成本，将算法推理与经济评估结合起来。始终要考虑最佳、平均和最坏情况的复杂度。
9. Psychology: Human–Computer Interaction Design | 心理学：人机交互设计
When designing user interfaces for elderly adults, psychological principles become paramount. Reduce cognitive load by limiting choices per screen. Use high contrast and large fonts to accommodate visual decline. Provide clear feedback for every action, as mental models of older users may differ from those of younger digital natives.
为老年人设计用户界面时，心理学原则变得至关重要。通过限制每屏的选择数量来降低认知负荷。使用高对比度和大字体以适应视力下降。为每一次操作提供清晰的反馈，因为年长用户的心理模型可能与年轻数字原住民不同。
An exam question might give an app screen and ask you to critique it using HCI heuristics. Link your points to psychology: short-term memory (fewer than 7 chunks), attention span and comfort with skeuomorphic elements. This bridges Topic 5.2 (user interface design) and cognitive psychology.
考试题目可能给出一个应用界面，要求你运用人机交互启发原则进行评析。将你的观点与心理学联系起来：短期记忆（少于7个组块）、注意力时长以及对拟物元素的接受度。这连接了主题5.2（用户界面设计）和认知心理学。
10. Walkthrough: A Multi-Disciplinary Library System Problem | 综合题演练：多学科图书馆系统题目
Scenario: A school library wants a computerised borrowing system. Each book has a barcode encoding a binary pattern; borrower data is held in a database; the exit gate sounds an alarm if a book is not checked out. Sub-question (a) The barcode uses 10 bits for the book ID. How many unique books can be represented? (b) Write an SQL statement to count books still on loan after 14 days. (c) c: Alarm = (Sensor detects book) AND (NOT checkout flag). Draw the logic gate arrangement. (d) Discuss two ethical issues in storing pupil borrowing histories.
情景：一所学校图书馆希望构建计算机化借阅系统。每本书带有编码为二进制图案的条形码；借阅者数据存放在数据库中；若书本未办理借出手续，出口闸门会发出警报。子问题(a) 条形码使用10位作为图书ID，可表示多少本独一无二的图书？(b) 写出一条SQL语句，统计借出超过14天仍未归还的图书数量。(c) 闸门逻辑：警报 = (传感器检测到书) AND (NOT 借出标记)。画出逻辑门安排。(d) 讨论存储学生借阅历史的两个伦理问题。
(a) 2¹⁰ = 1024 unique IDs. (b) SELECT COUNT(*) FROM Loans WHERE DateDue < DATE 'now' AND Returned = FALSE; (c) One AND gate, one NOT gate, as in Section 3. (d) Possible issues: data retention period must be defined; pupil reading habits are sensitive and could be misused for profiling; consent or legitimate basis required under DPA. This integrated walkthrough rehearses the exact style of Edexcel's extended questions.
(a) 2¹⁰ = 1024个唯一ID。(b) SELECT COUNT(*) FROM Loans WHERE DateDue < DATE 'now' AND Returned = FALSE; (c) 一个与门、一个非门，如第3节。(d) 可能的问题：必须明确数据保留期限；学生阅读习惯是敏感信息，可能被滥用于用户画像；根据DPA需要同意或合法基础。这一综合演练再现了Edexcel拓展题的风格。
11. Exam Techniques for Tackling Integrated Questions | 应对综合题的考试技巧
When faced with a cross-curricular stem, underline the computer science topic and the linking subject. Break the problem into sub-t
Published by TutorHao | Year 12 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图