📚 Year 10 OCR Computer Science: Interdisciplinary Exam-Style Questions Training | Year 10 OCR 计算机：跨学科综合题型训练
Computer science does not exist in a vacuum. The OCR GCSE specification (J277) frequently tests your ability to apply computational thinking in mathematical, scientific and real-world contexts. This article presents a curated set of interdisciplinary question types, blending programming, data representation, algorithms and hardware with subjects like maths, physics, biology and geography. Work through each section to strengthen both your subject knowledge and your cross-curricular problem-solving skills.
计算机科学不是孤立存在的。OCR GCSE 规范（J277）经常考查你在数学、科学和现实场景中运用计算思维的能力。这篇文章提供了一组精心设计的跨学科题型，将编程、数据表示、算法和硬件与数学、物理、生物和地理等学科融合在一起。逐一完成每个部分，可以同时巩固你的学科知识以及跨课程解决问题的能力。
1. Binary and Mathematical Puzzles | 二进制与数学谜题
Binary underpins all digital systems. OCR exam questions often ask you to convert between denary, binary and hexadecimal, but they also combine this with arithmetic sequences, powers of two and modular arithmetic. For example, you might need to find how many bits are required to represent a given range of values, or calculate the maximum value storable in a certain number of bits using the formula 2ⁿ − 1.
二进制是所有数字系统的基础。OCR 考试题目经常要求你在十进制、二进制和十六进制之间进行转换，但也常常将这些转换与等差数列、2 的幂以及模运算结合在一起。例如，你可能需要计算表示某个数值范围需要多少位，或者使用公式 2ⁿ − 1 计算特定位数能存储的最大值。
A classic cross-curricular task: " °C and 60 °C. How many bits are needed to store each reading as an unsigned binary integer?" an or equal to 161 is 256 = 2⁸, so 8 bits are needed. This blends measurement precision with binary logic.
一个经典的跨学科任务：“一位科学家以 0.5 °C 的精度测量 −20 °C 到 60 °C 之间的温度。如果用无符号二进制整数存储每个读数，需要多少位？”首先，计算不同取值的总数。范围是 80 度，步长 0.5，因此总数为 (80 / 0.5) + 1 = 161 个值。大于或等于 161 的最小 2 的幂是 256 = 2⁸，所以需要 8 位。这道题将测量精度与二进制逻辑结合在了一起。
l: 181 ÷ 16 = 11 remainder 5, so B5 in hex. This links binary, denary and hex in one flow.
将 1011 0101₂ 转换为十进制：128 + 32 + 16 + 4 + 1 = 181。然后将 181 用十六进制表示：181 ÷ 16 = 11 余 5，因此十六进制为 B5。这一流程将二进制、十进制和十六进制联系起来。
showing carries: result is 1010 0110₂. Check in denary: 108 + 58 = 166, correct. Overflow? With 8 bits, 166 fits; no overflow.
二进制加法：0110 1100₂ + 0011 1010₂。逐列相加并显示进位：结果为 1010 0110₂。用十进制验证：108 + 58 = 166，正确。是否溢出？使用 8 位时，166 在范围内，未发生溢出。
2. Boolean Logic and Digital Circuits | 布尔逻辑与数字电路
Boolean algebra is the mathematics of logic gates. In OCR exams, you will draw truth tables for AND, OR, NOT and XOR, and combine them into circuits. But Boolean logic also appears in search engine queries and condition checks in programming, tying into database filters and selection statements. For example, a physics experiment may require a warning LED to light if temperature exceeds 50 °C OR pressure drops below 1 atm. This would be represented as A OR B.
布尔代数是逻辑门的数学基础。在 OCR 考试中，你需要为 AND、OR、NOT 和 XOR 绘制真值表，并将它们组合成电路。但布尔逻辑也出现在搜索引擎查询以及编程中的条件检查中，与数据库筛选和选择语句紧密相关。例如，一个物理实验可能要求当温度超过 50 °C 或压力低于 1 个大气压时点亮警告 LED。这可以用 A OR B 来表示。
Consider a cross-disciplinary scenario: " that pressure is high AND temperature is low, or an emergency override switch is pressed." . The output is 1 when C=1, or when A=1 AND B=1 simultaneously. This exercises systematic truth table construction and real-world safety logic.
考虑一个跨学科场景：“只有当两个传感器一致显示压力高且温度低，或者按下紧急超驰开关时，化工过程才是安全的。”将其表示为逻辑表达式：(A AND B) OR C，其中 A = 高压，B = 低温，C = 超驰。画出三输入 (A,B,C) 的真值表。当 C=1 或者 A=1 且 B=1 时，输出为 1。这既锻炼了系统化真值表构建能力，也涉及实际的安全逻辑。
AND NOT B) = A. Such simplifications reduce gate count in circuits, saving cost and power.
使用布尔恒等式化简：NOT(NOT X)=X。(A AND B) OR (A AND NOT B) = A。这种化简可以减少电路中的门数量，从而节省成本和功耗。
T B) OR (NOT A AND B). When building a half-adder, XOR gives the sum bit, while AND gives the carry bit. This links logic to arithmetic circuits.
异或真值表：A XOR B = (A AND NOT B) OR (NOT A AND B)。在构建半加器时，XOR 给出和位，AND 给出进位位。这将逻辑与算术电路联系起来。
3. Data Representation and Measurement | 数据表示与测量
Understanding units of storage – bit, byte, kilobyte (KB), megabyte (MB), gigabyte (GB) – 0,000 bytes for storage devices). Interdisciplinary questions combine these with file sizes from science experiments or image resolutions.
理解存储单位——位、字节、千字节（KB）、兆字节（MB）、吉字节（GB）——至关重要。OCR 要求你使用 2 的幂（例如，内存中 1 KB = 1024 字节）和 10 的幂（对于存储设备，1 MB = 1,000,000 字节）在这些单位之间进行转换。跨学科题目将这些知识与科学实验中的文件大小或图像分辨率结合起来。
Example: " s with a colour depth of 24 bits. Calculate the file size of one uncompressed image in MB." 8 = 9,437,184 bytes. To MB (storage, using 10⁶): 9.44 MB (2 d.p.). If using mebibytes (2²⁰ bytes), roughly 9 MiB. This blends biology imaging with data representation.
例题：“一台显微镜捕获 2048 × 1536 像素的图像，色深为 24 位。计算一张未压缩图像的文件大小（MB）。”像素总数 = 2048 × 1536 = 3,145,728 像素。每个像素 24 位，总位数 = 3,145,728 × 24 = 75,497,472 位。转换为字节：除以 8 得 9,437,184 字节。转换为 MB（存储设备，常用 10⁶）：约为 9.44 MB（保留两位小数）。如果使用兆比字节（2²⁰ 字节），则为约 9 MiB。这道题将生物成像与数据表示结合。
6-bit, file size = 44,100 × 16 × 3.2 × 2 = 4,515,840 bits = 564,480 bytes ≈ 0.56 MB. Links physics of sound to storage.
声音文件大小 = 采样率 × 位深度 × 时长（秒）× 声道数。对于一段持续 3.2 秒、44.1 kHz、16 位的立体声鸟鸣录音，文件大小 = 44,100 × 16 × 3.2 × 2 = 4,515,840 位 = 564,480 字节 ≈ 0.56 MB。将声音的物理属性与存储联系起来。
4. Algorithms and Flowcharts in Science | 科学中的算法与流程图
Algorithms are step-by-step procedures, and OCR frequently tests your ability to trace and design algorithms using pseudocode or flowcharts. Cross-curricular examples often model scientific processes – like determining the end point of a titration, classifying a species using a dichotomous key, or iterating until a chemical reaction reaches a stable pH.
算法是分步骤的操作过程，OCR 经常考察你使用伪代码或流程图追踪和设计算法的能力。跨学科例子往往模拟科学过程——例如确定滴定终点、使用二叉检索表对物种进行分类，或者迭代直到化学反应达到稳定的 pH 值。
Consider this flowchart-based question: " The algorithm should stop when three consecutive readings are within 0.2 °C of each other." BS(previous1 - previous2) <= 0.2. If true, break; else shift values and repeat. This mimics a common control system for steady-state detection, blending physics experiment logic with algorithmic thinking.
考虑这个基于流程图的题目：“一个温度传感器每秒读取数值。当连续三个读数之间的差都在 0.2 °C 以内时，算法应停止。”这需要变量：previous1、previous2、current。循环内读取温度，然后检查条件：ABS(current - previous1) <= 0.2 且 ABS(previous1 - previous2) <= 0.2。如果为真则退出循环；否则移动数值并重复。这模拟了常见的稳态检测控制系统，将物理实验逻辑与算法思维相结合。
Linear search vs. binary search on a list of element atomic masses sorted in ascending order. Binary search would repeatedly divide the list, enhancing understanding of algorithmic efficiency in a chemistry context.
在一个按升序排列的元素原子质量列表上进行线性搜索与二分搜索。二分搜索会反复将列表对半分，在化学背景下加深对算法效率的理解。
m + (v[i+1]-v[i])/(t[i+1]-t[i]), output sum/(n-1). Emphasises iteration and floating-point division.
根据速度-时间数据集计算平均加速度的伪代码：sum = 0，for i = 0 to n-2，sum = sum + (v[i+1]-v[i])/(t[i+1]-t[i])，输出 sum/(n-1)。强调迭代和浮点除法。
5. Programming for Physics Simulations | 物理模拟编程
Programming in Python (or OCR's reference language) enables you to simulate simple physical systems. Exam questions might provide a code snippet modelling projectile motion, radioactive decay or cooling, and ask you to predict outputs, identify logic errors, or modify parameters. Variables, loops, conditionals and functions become tools for computational science.
使用 Python（或 OCR 参考语言）编程可以模拟简单的物理系统。考试题目可能提供一段模拟抛体运动、放射性衰变或冷却过程的代码，要求你预测输出、找出逻辑错误或修改参数。变量、循环、条件和函数成为了计算科学的工具。
ates new height: h = h * e, and increments a bounce counter. Determine the number of bounces before h falls below threshold. Running mentally (or via trace table): initial 10 → 7 → 4.9 → 3.43 → 2.401 → 1.6807 → 1.17649 → 0.823543 → 0.5764801 → 0.40353607 → 0.282475249 → 0.1977326743 → 0.138412872 → 0.0968890104 → 0.0678223073 → 0.0474756151 → 0.0332329306 → 0.0232630514 → 0.016284136 → 0.0113988952. Stop when 0.0113988952 > 0.01? Actually next height is 0.0113988952 * 0.7 = 0.00797922664 < 0.01, so this bounce counted? ht. So count each valid bounce. This builds mathematical reasoning and trace table skills.
例子：模拟弹跳球。一个球从高度 h = 10 米落下，恢复系数 e = 0.7。当 h > 0.01 时，程序计算新高度：h = h * e，并递增弹跳计数器。求出高度降至阈值以下前的弹跳次数。通过心算（或追踪表）：初始 4 → 0.0678223073 → 0.0474756151 → 0.0332329306 → 0.0232630514 → 0.016284136 → 0.0113988952。高度 0.0113988952 仍大于 0.01，故再弹跳一次：0.0113988952 × 0.7 = 0.00797922664 < 0.01，计数为第 20 次。这锻炼了数学推理和追踪表技能。
| Bounce | Height (m) |
|---|---|
| 0 | 10.0 |
| 1 | 7.0 |
| ... | ... |
| 20 | ~0.0080 |
A common pitfall is using integer division in Python where float division is needed. In physics calculations, always use / not //.
一个常见陷阱是在 Python 中需要浮点除法的地方使用了整数除法。在物理计算中，始终使用 / 而不是 //。
loop iteration represents one second, and the decay probability per atom is p = 1 − (0.5)1/5. This combines probability, exponential functions and loops.
模拟放射性衰变：初始原子数 N₀ = 1000，半衰期 = 5 秒。每次循环迭代代表一秒，每个原子的衰变概率为 p = 1 − (0.5)1/5。这结合了概率、指数函数和循环。
6. Encryption and History | 加密与历史
be asked to encode or decode a message using a given shift, and then discuss why modern encryption is more secure. For example, "Using a Caesar cipher with shift 7, encrypt the word VICTORY." ositions: V → C, I → P, etc. These tasks link to historical codes like the Enigma machine.
OCR 涵盖凯撒密码和基本的加密原理。历史上，加密在战争和外交中发挥了关键作用。你可能会被要求使用给定的偏移量对消息进行编码或解码，然后讨论现代加密为何更安全。例如，“使用偏移量为 7 的凯撒密码加密单词 VICTORY。”每个字母向前移动 7 位：V → C，I → P 等。这类任务与历史上的密码机（如 Enigma 机）相关联。
Decrypting: "GUVF VF FRPERG" with shift 13 (ROT13) yields "THIS IS SECRET". Write an algorithm in pseudocode to brute-force decrypt a Caesar cipher: for shift from 1 to 25, apply shift and print. The student then identifies the meaningful plaintext. This not only tests programming logic but also an understanding of language pattern recognition.
解密：使用偏移 13（ROT13）解密“GUVF VF FRPERG”得到“THIS IS SECRET”。用伪代码编写破解凯撒密码的算法：shift 从 1 到 25，应用偏移并打印结果。学生随后识别出有意义的明文。这不仅测试了编程逻辑，还涉及对语言模式识别的理解。
Why is a Caesar cipher weak? There are only 25 possible shifts, vulnerable to brute-force. Modern encryption uses public/private keys and large primes (RSA), linking to number theory in maths.
为什么凯撒密码很弱？它只有 25 种可能的偏移量，容易受到暴力破解。现代加密使用公钥/私钥和大质数（RSA），与数学中的数论相连接。
Computational thinking: frequency analysis of ciphertext letters to deduce shift, a technique used by codebreakers at Bletchley Park.
计算思维：对密文字母进行频率分析以推导偏移量，这是布莱切利园密码破译者使用的一种技术。
7. Networks and Geographical Data | 网络与地理数据
Networking concepts – LAN, WAN, topologies, IP addressing, DNS – can be applied to geographical scenarios. For instance, "A multinational company has offices in London, Tokyo and New York. Explain why they use a WAN and how packets are routed." This requires understanding of routers, packet switching and undersea cables. Calculations of transmission time (distance / speed of light in fibre) integrate physics with networking.
网络概念——局域网、广域网、拓扑结构、IP 寻址、域名系统——可以应用于地理场景。例如，“一家跨国公司在伦敦、东京和纽约设有办事处。解释他们为什么使用广域网以及数据包是如何路由的。”这需要理解路由器、分组交换和海底电缆。传输时间的计算（距离 / 光纤中的光速）将物理与网络结合起来。
Sample calculation: "A packet travels 8,000 km through optical fibre at 2×10⁸ m/s. What is the minimum latency?" typical geography and physics crossover, reinforcing unit conversions and formula recall.
计算示例：“一个数据包通过光纤传输 8000 公里，光速为 2×10⁸ m/s。最低延迟是多少？”距离以米为单位 = 8,000,000 m。时间 = 距离 / 速度 = 8×10⁶ / 2×10⁸ = 0.04 秒 = 40 毫秒。这是一个典型的地理和物理交叉题目，巩固了单位换算和公式记忆。
IP addressing: an IPv4 address like 192.168.1.10 can be split into network and host parts. Knowing the subnet mask 255.255.255.0, identify network address 192.168.1.0. This relates to binary AND operations.
IP 寻址：像 192.168.1.10 这样的 IPv4 地址可以分为网络部分和主机部分。已知子网掩码 255.255.255.0，确定网络地址为 192.168.1.0。这涉及二进制 AND 运算。
Star topology in a school network: draw and label switch, server, clients. Discuss impact of a cable break: only that node disconnects, showcasing fault tolerance.
学校网络中的星型拓扑：绘制并标注交换机、服务器和客户端。讨论电缆断裂的影响：只有该节点会断开连接，展示了容错能力。
8. Computational Thinking in Biology | 生物学中的计算思维
Algorithms can model biological processes. A standard OCR problem is using a binary search to identify a species in a dichotomous key. Given a list of organisms sorted by a feature (e.g. number of legs), a yes/no decision tree narrows the field. This exercise highlights abstraction, decomposition and pattern recognition.
算法可以模拟生物过程。OCR 的一个标准问题是使用二分搜索在二叉检索表中识别物种。给定一个按特征（例如腿的数量）排序的生物列表，通过是/否决策树来缩小范围。这个练习突出了抽象、分解和模式识别。
Another example: "A DNA sequence is stored as a string of A, T, C, G. Write pseudocode that counts the frequency of 'A' and calculates the GC content (percentage of G and C)." Iterate through the string, increment counters. This teaches string manipulation and bioinformatics fundamentals.
另一个例子：“一个 DNA 序列存储为 A、T、C、G 组成的字符串。编写伪代码，统计 ‘A’ 的出现频率，并计算 GC 含量（G 和 C 的百分比）。”遍历字符串，递增计数器。这教授了字符串处理以及生物信息学基础。
Modelling population growth: Nt+1 = r × Nt × (1 − Nt/K). Implement loop with conditional overflow check, linking biology logistic growth to iteration and rounding errors.
模拟种群增长：Nt+1 = r × Nt × (1 − Nt/K)。执行带有条件溢出检查的循环，将生物学的 Logistic 增长与迭代和舍入误差联系起来。
Sorting biological data: sort heights of plants by bubble sort, then find median – applying statistics and algorithm together.
对生物数据排序：使用冒泡排序对植物高度排序，然后求中位数——将统计学和算法一起应用。
9. Sound and Image Representation | 声音与图像表示
geography context, you might examine how satellite images use high colour depth for vegetation analysis (NDVI). A 16-bit colour depth allows 65,536 shades per band, compared to 256 in 8-bit. Calculate the raw file size for a 5000×5000 pixel 4-band satellite image at 16 bits per band: 5000×5000×4×16 = 1.6×10⁹ bits = 200 MB.
数字图像和声音表示为样本数组。OCR 探索采样率和分辨率对质量和文件大小的影响。在地理情境中，你可能需要分析卫星图像如何利用高色深进行植被分析（NDVI）。16 位色深每个波段可表示 65,536 级灰阶，而 8 位只有 256 级。计算一幅 5000×5000 像素、4 个波段、每波段 16 位的卫星图像原始文件大小：5000×5000×4×16 = 1.6×10⁹ 位 = 200 MB。
Sound sampling: Nyquist theorem states the sampling rate must be at least twice the highest frequency to faithfully reproduce audio. A bat call at 80 kHz requires a sampling rate of at least 160 kHz. Calculate file size for 1 second recording. This links biology and physics of sound to computer science.
声音采样：奈奎斯特定理指出采样率必须至少是最高频率的两倍才能忠实再现音频。频率为 80 kHz 的蝙蝠叫声要求采样率至少为 160 kHz。计算 1 秒录音的文件大小。这将声音的生物学和物理学与计算机科学联系起来。
Bitmap vs vector: compare storage of a simple shape (circle) in both formats. Vector stores mathematical description (centre, radius) – much smaller and scalable without pixelation. Useful in design and technology crossovers.
位图与矢量图：比较一个简单形状（圆形）在两种格式下的存储。矢量图存储数学描述（圆心、半径）——体积小得多，并且可以无像素化地缩放。在设计和技术交叉领域很有用。
Colour models: RGB additive vs CMYK subtractive. An OCR question may ask: why does a green filter appear green under white light? Because it absorbs red and blue.
颜色模型：RGB 加色模型与 CMYK 减色模型。OCR 题目可能会问：为什么绿色滤镜在白光下呈现绿色？因为它吸收了红光和蓝光。
10. Ethics, Environment and Cross-Curricular Debate | 道德、环境与跨学科辩论
OCR Paper 1 and Paper 2 both feature ethical and environmental impact questions. You might be asked to discuss the digital divide, e-waste, or energy consumption of data centres. These questions naturally integrate geography (resource distribution), citizenship (equity) and science (carbon footprint). A typical 6-mark question: "Discuss the impact of cloud storage on the environment." You need to consider positive (reduced individual hardware, efficient scaling) and negative (massive electricity use, cooling, rare earth mining) effects.
OCR 试卷 1 和试卷 2 都包含道德和环境影响问题。你可能会被要求讨论数字鸿沟、电子废弃物或数据中心的能源消耗。这些问题天然地融合了地理（资源分布）、公民教育（公平）和科学（碳足迹）。一个典型的 6 分题：“讨论云存储对环境的影响。”你需要考虑积极影响（减少个人硬件、高效扩展）和消极影响（巨大的电力消耗、冷却、稀土开采）。
Structure answers with arguments for and against, supported by concrete facts. "Data centres emit 0.3% of global CO₂, but cloud computing can reduce overall emissions by enabling telecommuting and dematerialisation." Use terms like 'lifecycle analysis' to impress the examiner. This is a perfect example of a synoptic question that rewards cross-curricular knowledge.
用支持与反对的论点来组织答案，并用具体事实佐证。“数据中心排放了全球 0.3% 的二氧化碳，但云计算可以通过支持远程办公和非物质化来减少总体排放。”使用“生命周期分析”等术语会给考官留下深刻印象。这是一个典型的综合性问题，奖励跨学科知识。
Artificial intelligence and bias: training data sets that lack diversity can lead to biased algorithms, linking social justice and computing ethics.
人工智能与偏见：缺乏多样性的训练数据集可能导致算法存在偏见，将社会正义与计算伦理联系起来。
Copyright and creativity: Creative Commons licenses for music, linking to arts and law. Know the difference between attribution and non-commercial clauses.
版权与创意：适用于音乐的创作共用许可，与艺术和法律相连接。了解署名条款和非商业性条款的区别。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图