Cross-Curricular Integrated Problem-Solving for Year 11 OCR Computer Science | Year 11 OCR 计算机科学跨学科综合题型训练

📚 Cross-Curricular Integrated Problem-Solving for Year 11 OCR Computer Science | Year 11 OCR 计算机科学跨学科综合题型训练

OCR’s J277 specification frequently blends computational thinking with real-world contexts drawn from mathematics, physics, biology, geography, and finance. This article provides a structured set of integrated problem-solving exercises that mirror the style of extended exam questions, helping you bridge theory and application across subjects. Each section targets a specific cross-curricular link, offering worked examples, key formulas, and strategic tips.

OCR J277 考试大纲经常将计算思维与来自数学、物理、生物、地理和金融的真实情境相结合。本文提供了一组结构化的综合题型训练，模拟考试中拓展题的风格，帮助你在各个学科之间架起理论与应用的桥梁。每个小节都针对一个特定的跨学科联系，提供示例、关键公式和解题策略。

1. Binary Arithmetic and Number Systems | 二进制算术与数制转换

Binary is the bedrock of all computing, yet its operations directly mirror mathematical principles like addition, subtraction, and place-value conversion. OCR questions often ask you to convert between decimal, binary, and hexadecimal, or to perform binary addition which links to integer overflow concepts.

二进制是所有计算的基础，但其运算直接反映了数学原理，如加法、减法和位值转换。OCR 试题经常要求你在十进制、二进制和十六进制之间进行转换，或者执行二进制加法，这又与整数溢出概念相关联。

Example: Convert the decimal number 2024 into an 8-bit binary number and then into hexadecimal. First, repeatedly divide by 2.
2024 ÷ 2 = 1012 remainder 0; 1012 ÷ 2 = 506 r0; 506 ÷ 2 = 253 r0; 253 ÷ 2 = 126 r1; 126 ÷ 2 = 63 r0; 63 ÷ 2 = 31 r1; 31 ÷ 2 = 15 r1; 15 ÷ 2 = 7 r1; 7 ÷ 2 = 3 r1; 3 ÷ 2 = 1 r1; 1 ÷ 2 = 0 r1. Reading remainders bottom-up gives 11111101000. For 8 bits, we take the lower 8 bits: 11101000? That would be incorrect because 2024 is too large for 8 bits. Thus an 8-bit representation would overflow; a 12-bit representation is 0111 1110 1000. In hex: 7E8.
This illustrates how bit-depth limits data range, linking to the mathematical concept of modulo arithmetic.

示例：将十进制数 2024 转换为 8 位二进制数，再转换为十六进制。首先，反复除以 2。
2024 ÷ 2 = 1012 余 0；1012 ÷ 2 = 506 余 0；506 ÷ 2 = 253 余 0；253 ÷ 2 = 126 余 1；126 ÷ 2 = 63 余 0；63 ÷ 2 = 31 余 1；31 ÷ 2 = 15 余 1；15 ÷ 2 = 7 余 1；7 ÷ 2 = 3 余 1；3 ÷ 2 = 1 余 1；1 ÷ 2 = 0 余 1。从下往上读取余数得到 11111101000。对于 8 位，这会发生溢出；12 位二进制是 0111 1110 1000，十六进制为 7E8。

Decimal to binary: Repeated division by 2; remainders form the bits (LSB to MSB).

十进制转二进制：反复除以 2，余数构成位值（从 LSB 到 MSB）。

Binary addition with two’s complement allows subtraction by adding a negative number. For instance, 7 + (-3) in 4-bit two’s complement: 7 = 0111, -3 = 1101 (invert 0011 → 1100, +1 = 1101). 0111 + 1101 = 1 0100, discard carry → 0100 = 4. This process connects to mathematics of negative numbers and modular arithmetic.

使用二进制补码的加法可以通过加上负数来实现减法。例如，7 + (-3) 在 4 位补码中：7 = 0111，-3 = 1101（对 0011 取反得 1100，加 1 得 1101）。0111 + 1101 = 1 0100，丢弃进位得到 0100 = 4。这个过程连接了负数的数学运算和模运算。

2. Boolean Logic and Electrical Circuits | 布尔逻辑与电路设计

Logic gates form the hardware foundation of a CPU, and their behavior is identical to the Boolean algebra studied in mathematics. In physics, simple electrical circuits with switches in series and parallel behave exactly like AND and OR gates, respectively. Exam questions may present a logic circuit that must be simplified or expressed as a truth table.

逻辑门构成了 CPU 的硬件基础，其行为与数学中的布尔代数完全一致。在物理学中，开关串联和并联的简单电路分别与 AND 门和 OR 门的行为完全相同。考试题可能会给出一个需要简化或表示为真值表的逻辑电路。

Consider a security system where an alarm A sounds if door D is open AND motion M is detected, OR if a panic button P is pressed. Boolean expression: A = (D AND M) OR P. The circuit uses an AND gate followed by an OR gate. In a series–parallel switch circuit: D and M switches in series, both in parallel with P. This mirrors physical wiring.

考虑一个安防系统：如果门 D 打开且检测到运动 M，或者按下了紧急按钮 P，则警报 A 响起。布尔表达式：A = (D AND M) OR P。该电路使用一个 AND 门和一个 OR 门。在串并联开关电路中：D 和 M 串联，再与 P 并联。这反映了物理接线。

D	M	P	A
0	0	0	0
1	1	0	1
0	0	1	1

Simplifying logic expressions using Boolean identities (e.g., De Morgan’s laws) directly supports mathematical reasoning. For instance, NOT(A AND B) = (NOT A) OR (NOT B) helps reduce gate count, linking to algebra and cost optimisation.

使用布尔恒等式（例如德摩根定律）简化逻辑表达式可直接支持数学推理。例如，NOT(A AND B) = (NOT A) OR (NOT B) 有助于减少门数量，这与代数和成本优化相关联。

3. Data Representation: Sound Sampling | 数据表示：声音采样

Digital audio is created by sampling an analogue sound wave at regular intervals – a direct application of physics (wave properties) and mathematics (discretisation). The key variables are sample rate (Hz), bit depth, and duration. The file size formula must be memorised and used in calculations involving units like kilo-, mega-, and gigabytes.

数字音频是通过对模拟声波进行等间隔采样而创建的——这是物理（波的性质）和数学（离散化）的直接应用。关键变量是采样率（Hz）、位深度和持续时间。必须牢记文件大小公式，并在涉及千字节、兆字节和吉字节的计算中使用。

File size (bits) = Sample rate (Hz) × Bit depth × Duration (s)

文件大小（位）= 采样率（Hz）× 位深度 × 持续时间（秒）

Example: A high-quality stereo song (two channels) is 3 minutes 30 seconds long, sampled at 44.1 kHz with 16-bit resolution. Calculate the uncompressed file size in megabytes.
Duration = (3×60)+30 = 210 s.
Bits = 44100 × 16 × 210 × 2 channels = 296,352,000 bits.
Bytes = 296,352,000 ÷ 8 = 37,044,000 bytes.
MB = 37,044,000 ÷ (1024²) ≈ 35.33 MB.
This demonstrates why higher sample rates (capturing higher frequencies per Nyquist theorem) increase storage demands, linking to both physics and data compression techniques.

示例：一首高品质立体声歌曲（两个声道）时长 3 分 30 秒，以 44.1 kHz、16 位分辨率采样。计算未压缩的文件大小（单位为兆字节）。
持续时间 = (3×60) + 30 = 210 秒。
位 = 44100 × 16 × 210 × 2 声道 = 296,352,000 位。
字节 = 296,352,000 ÷ 8 = 37,044,000 字节。
MB = 37,044,000 ÷ (1024²) ≈ 35.33 MB。
这表明为何更高的采样率（根据奈奎斯特定理捕捉更高频率）会增加存储需求，同时连接了物理和数据压缩技术。

4. Algorithms and Mathematical Sequences | 算法与数学数列

Many algorithms in GCSE Computer Science implement well-known mathematical sequences such as Fibonacci, factorials, or prime number sieves. Tracing these algorithms reinforces understanding of iteration, selection, and variable manipulation, while simultaneously testing algebraic thinking.

GCSE 计算机科学中的许多算法实现了众所周知的数学数列，如斐波那契数列、阶乘或素数筛法。追踪这些算法可以加强对迭代、选择和变量操作的理解，同时测试代数思维。

Consider generating the first n Fibonacci numbers using a loop. Pseudocode:
a ← 0, b ← 1 OUTPUT a, b FOR i ← 3 TO n c ← a + b OUTPUT c a ← b b ← c ENDFOR
Tracing for n=5 yields 0, 1, 1, 2, 3. This directly relates to the recurrence relation Fₙ = Fₙ₋₁ + Fₙ₋₂ studied in mathematics.

考虑使用循环生成前 n 个斐波那契数。伪代码：
a ← 0, b ← 1 输出 a, b FOR i ← 3 TO n c ← a + b 输出 c a ← b b ← c ENDFOR
对 n=5 进行追踪得到 0, 1, 1, 2, 3。这直接关联到数学中学习的递推关系 Fₙ = Fₙ₋₁ + Fₙ₋₂。

Another cross-curricular spot is prime number detection. The Sieve of Eratosthenes is an efficient algorithm that links array processing with number theory. Writing a Python version uses a list of Boolean values, reinforcing one-dimensional array concepts.

另一个跨学科要点是素数检测。埃拉托斯特尼筛法是一种高效的算法，将数组处理与数论联系起来。编写 Python 版本时使用布尔值列表，强化了一维数组的概念。

5. Networks: Submarine Cables and Latency | 网络：海底光缆与延迟

Global networks rely on physical infrastructure, especially submarine fibre-optic cables. Geography and physics combine when calculating latency: the time for a signal to travel a distance through an optical medium. The speed of light in fibre is roughly 2×10⁸ m/s. Exam questions may ask you to compute latency for a given cable length.

全球网络依赖于物理基础设施，尤其是海底光缆。在计算延迟（信号在光介质中传播一定距离所需的时间）时，地理和物理相结合。光在光纤中的速度大约为 2×10⁸ m/s。考试题可能会要求计算给定光缆长度的延迟。

Latency (s) = Distance (m) ÷ Speed of signal in medium (m/s)

延迟（秒）= 距离（米）÷ 介质中的信号速度（米/秒）

Example: The SEA-ME-WE 3 cable connects London to Singapore, about 15,000 km. Calculate the minimum one-way propagation delay.
15,000 km = 15,000,000 m.
Latency = 15,000,000 m ÷ 2×10⁸ m/s = 0.075 s = 75 ms.
This latency affects real-time applications like online gaming and VoIP, tying in network protocols (TCP/UDP) and the need for data centres near users (edge computing).

示例：SEA-ME-WE 3 光缆连接伦敦和新加坡，长约 15,000 公里。计算最小单向传播延迟。
15,000 km = 15,000,000 m。
延迟 = 15,000,000 m ÷ 2×10⁸ m/s = 0.075 s = 75 ms。
这一延迟影响了在线游戏和 VoIP 等实时应用，关联到网络协议（TCP/UDP）以及需要靠近用户的数据中心（边缘计算）。

Geography also matters for redundancy: if a cable is cut, traffic must reroute via longer paths, increasing latency. This teaches network topology resilience and the social impact of internet outages.

地理因素对冗余也很重要：如果一条光缆被切断，流量必须经由更长的路径重新路由，从而增加延迟。这说明了网络拓扑的弹性以及互联网中断的社会影响。

6. Computer Systems in Weather Forecasting | 天气预报中的计算机系统

Weather prediction relies on supercomputers running complex simulation models that divide the atmosphere into a 3D grid. This is a powerful blend of geography (atmospheric science), physics (fluid dynamics, thermodynamics), and mathematics (numerical methods, differential equations). The role of computer science is in parallel processing, data handling, and visualisation.

天气预报依赖于运行复杂模拟模型的超级计算机，这些模型将大气划分为三维网格。这是地理（大气科学）、物理（流体力学、热力学）和数学（数值方法、微分方程）的强大结合。计算机科学的作用在于并行处理、数据处理和可视化。

The computing challenge: a global model with a 10 km grid resolution produces billions of data points per time step. To complete a forecast within a few hours, the workload is split across thousands of CPU cores – an illustration of distributed computing. In the classroom, a simplified exercise might involve writing an algorithm to calculate the average of a massive 2D array quickly through parallel sections.

计算挑战：一个分辨率为 10 km 网格的全球模型在每个时间步长产生数十亿个数据点。为了在几个小时内完成预报，工作负载被分配给数千个 CPU 核心——这是分布式计算的一个例证。在课堂上，一个简化的练习可能涉及编写算法，通过并行段快速计算大规模二维数组的平均值。

Data representation also appears: sensors on satellites and weather stations capture analogue data (temperature, pressure) which is digitised using ADC. The sampling frequency must be high enough to capture rapid changes, linking back to sound sampling principles.

数据表示也出现了：卫星和气象站上的传感器捕捉模拟数据（温度、气压），这些数据通过 ADC 进行数字化。采样频率必须足够高以捕捉快速变化，这又与声音采样原理相关联。

7. Computational Thinking in Biology: DNA Sequencing | 计算思维在生物学：DNA测序

Bioinformatics applies string searching and pattern matching algorithms to analyse DNA sequences, which are long strings of bases A, T, C, G. This is a natural link between biology and computing. OCR questions might ask you to design an algorithm to find a specific gene sequence within a larger genome string.

生物信息学应用字符串搜索和模式匹配算法来分析 DNA 序列，即由碱基 A、T、C、G 组成的长串。这是生物学和计算机科学之间的自然联系。OCR 问题可能会要求你设计一个算法，在更大的基因组字符串中找到一个特定的基因序列。

Example task: Write a program that takes a DNA string and a short pattern, and counts how many times the pattern appears. This is a basic pattern matching problem. A simple solution uses a sliding window: for i from 0 to length(DNA)-length(pattern), compare substring. More advanced thinking introduces efficiency (O(n×m) vs KMP algorithm concepts), linking to algorithmic complexity studied in mathematics.

示例任务：编写一个程序，接收一个 DNA 字符串和一个短片段模式，并计算该模式出现的次数。这是一个基本的模式匹配问题。一个简单的解决方案使用滑动窗口：对于 i 从 0 到 length(DNA)-length(pattern)，比较子串。更高级的思维引入了效率（O(n×m) 与 KMP 算法概念），关联到数学中学习的算法复杂度。

Another angle: DNA uses a quaternary (base-4) number system, analogous to binary or decimal. Representing A=00, T=01, C=10, G=11 allows a byte to store four bases, linking data compression with biology.

另一个角度：DNA 使用四进制（基数为 4）的数字系统，类似于二进制或十进制。用 A=00、T=01、C=10、G=11 表示，一个字节可以存储四个碱基，将数据压缩与生物学联系起来。

8. Ethics and Environmental Impact of Computing | 计算机的伦理与环境影响

Every technology has an ethical and environmental footprint. Manufacturing devices uses rare-earth metals and produces e-waste; data centres consume vast amounts of electricity and water for cooling. These topics test your ability to evaluate the societal impact, often referencing geography (resource extraction locations) and environmental science (carbon footprints).

每项技术都有其伦理和环境足迹。制造设备会使用稀土金属并产生电子垃圾；数据中心消耗大量电力和冷却用水。这些主题测试你评估社会影响的能力，经常参考地理（资源开采地）和环境科学（碳足迹）。

A common exam scenario: discuss the environmental advantages and disadvantages of moving from on-premise servers to cloud computing. Positive: shared resources reduce per-user energy; negative: massive data centres in certain regions strain local water supplies. This requires balanced arguments using specific technical vocabulary.

一个常见的考试场景：讨论从本地服务器迁移到云计算的环境优势和劣势。积极面：共享资源降低了每用户能耗；消极面：某些地区的大型数据中心给当地供水带来压力。这需要使用具体的技术词汇进行平衡论证。

Ethical dilemmas include algorithmic bias, the digital divide, and surveillance. A cross-curricular approach might involve analysing a case study from a geography textbook about a mining town and connecting it to the supply chain of smartphones, then proposing computational solutions like longer software support to reduce e-waste.

伦理困境包括算法偏见、数字鸿沟和监控。一种跨学科方法可能涉及分析一本地理教科书中关于一个矿业小镇的案例研究，并将其与智能手机的供应链联系起来，然后提出计算解决方案，例如延长软件支持以减少电子垃圾。

9. Cybersecurity and Financial Systems | 网络安全与金融系统

Online banking and e-commerce rely heavily on encryption, authentication, and secure protocols. This area links computing with economics and business studies. You may be asked to explain how asymmetric encryption (public/private keys) secures a transaction or how hashing protects passwords.

网上银行和电子商务严重依赖加密、身份验证和安全协议。该领域将计算机科学与经济学和商业研究联系起来。你可能会被要求解释非对称加密（公钥/私钥）如何保护交易，或者哈希如何保护密码。

Example: When Alice sends money to Bob via a banking app, the transaction details are encrypted with Bob’s public key. Only Bob’s private key can decrypt it. The mathematics of exponentiation modulo a large prime underpins RSA, though at GCSE you describe the process rather than compute the keys. This shows the importance of prime numbers in real-world security.

示例：当爱丽丝通过银行应用向鲍勃汇款时，交易详情用鲍勃的公钥加密。只有鲍勃的私钥才能解密。大素数模幂运算的数学原理支撑着 RSA，尽管在 GCSE 阶段你只需描述过程而不必计算密钥。这表明了素数在现实世界安全中的重要性。

Financial fraud detection uses machine learning algorithms, but in GCSE context, we focus on authentication methods (passwords, biometrics, two-factor authentication) and their strengths/weaknesses, linking to business risk management.

金融欺诈检测使用机器学习算法，但在 GCSE 背景下，我们侧重于身份验证方法（密码、生物识别、双因素身份验证）及其优缺点，这与商业风险管理相关。

10. Programming Projects with Physics Simulations | 物理模拟编程项目

Creating a simple physics simulation, such as projectile motion or a bouncing ball, is an excellent cross-curricular programming task. It requires applying equations of motion (SUVAT) within a game loop, updating object positions based on velocity and gravity.

创建一个简单的物理模拟，如抛体运动或弹跳球，是一个出色的跨学科编程任务。它需要在游戏循环中应用运动方程（SUVAT），根据速度和重力更新对象位置。

Consider a ball launched from ground level at an angle θ with initial velocity v. The horizontal and vertical components are vₓ = v cos θ, vᵧ = v sin θ. In each frame (time step Δt), the new position: x ← x + vₓ × Δt, y ← y + vᵧ × Δt, and vᵧ ← vᵧ – g × Δt. This loops until y ≤ 0 (ground impact). Coding this in Python or Scratch exercises your use of variables, math libraries, and loops, while explicitly testing your understanding of vector components from physics.

考虑一个球以初速度 v、角度 θ 从地面发射。水平和垂直分量为 vₓ = v cos θ，vᵧ = v sin θ。在每一帧（时间步长 Δt）中，新位置：x ← x + vₓ × Δt，y ← y + vᵧ × Δt，且 vᵧ ← vᵧ – g × Δt。该循环持续到 y ≤ 0（撞击地面）。用 Python 或 Scratch 编写此程序可以锻炼你对变量、数学库和循环的使用，同时明确测试你对物理中矢量分量的理解。

Extending the simulation to include air resistance (drag force proportional to speed) introduces more complex differential equations, but at Year 11 a simplified model like v = v × 0.99 each frame is acceptable. This kind of numerical integration directly mirrors the approach used in professional physics engines, linking algorithmic thinking with applied mathematics.

将模拟扩展到包括空气阻力（阻力与速度成正比）会引入更复杂的微分方程，但在 Year 11 阶段，每帧使用 v = v × 0.99 这样的简化模型是可以接受的。这种数值积分方法直接反映了专业物理引擎中使用的方法，将算法思维与应用数学联系起来。

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

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

Cross-Curricular Integrated Problem-Solving for Year 11 OCR Computer Science | Year 11 OCR 计算机科学跨学科综合题型训练