📚 KS3 CIE Computer Science: Interdisciplinary Problem-Solving Practice | KS3 CIE 计算机：跨学科综合题型训练
This article presents a collection of interdisciplinary exercises that connect computer science concepts from the KS3 CIE curriculum with other subjects such as mathematics, physics, biology, geography and art. Each section provides a scenario or question that requires you to apply computational thinking beyond pure coding, helping you see how computing tools and principles solve real-world problems. Working through these examples will strengthen your ability to analyse data, design algorithms and evaluate solutions in a broader context.
本文提供一系列跨学科练习题，将 KS3 CIE 计算机课程中的概念与数学、物理、生物、地理和艺术等其他学科联系起来。每个小节都设置了一个场景或问题，要求你在纯编程之外运用计算思维，帮助你理解计算工具和原理如何解决实际问题。通过这些例子，你将提升在更广泛的背景下分析数据、设计算法和评估方案的能力。
1. Binary Arithmetic in Mathematics | 数学中的二进制算术运算
ion method you learned for denary, remembering that 1 + 1 = 10₂ and 1 + 1 + 1 = 11₂. Then verify your result by converting all numbers to base‑ es place value understanding and highlights why computers use binary for arithmetic logic.
一道数学小挑战：用二进制加法计算 1011₂（十一）加 110₂（六），不要先将它们转换成十进制。你可以使用在十进制中学过的竖式加法，但要记住 1 + 1 = 10₂，1 + 1 + 1 = 11₂。然后把所有数字转换成十进制来验证结果。这个练习可以加深你对位值的理解，并展示计算机为何使用二进制进行算术逻辑运算。
1011₂ + 110₂ = 10001₂ (17₁₀)
2. Logic Gates Meet Electrical Circuits | 逻辑门遇见电路
Consider a simple circuit with a battery, a switch A, a switch B and a lamp. If the lamp only turns on when both switches are pressed (series connection), this behaves like an AND gate. If the lamp lights up when at least one switch is pressed (parallel connection), it behaves like an OR gate. Draw the truth tables for both arrangements. Now think about a staircase lighting system: a lamp that can be toggled from either the top or the bottom switch. Which logic gate does this resemble? (Hint: XOR.)
考虑一个简单的电路：电池、开关 A、开关 B 和灯泡。如果灯泡仅在两个开关都按下时才亮（串联），这就像一个与门；如果至少按下其中一个开关灯泡就亮（并联），就像一个或门。请画出这两种情况的真值表。再想想楼梯照明系统：可以在楼上或楼下任一开关切换灯泡状态。这类似于哪种逻辑门？（提示：异或门）
| A | B | Series (AND) | Parallel (OR) |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 |
3. Data Units and Measurement in Science | 科学中的数据单位与测量
pression. Also, express this size in kibibytes (KiB) using the binary definition where 1 KiB = 1024 bytes. This combines knowledge of resolution, colour depth and unit conversion, which is a typical data handling skill in biology and physics experiments.
一台数码显微镜拍摄了一张 2048 × 1536 像素、色彩深度为 24 位的图像。计算未压缩时的文件大小，以兆字节（MB）为单位。再用二进制定义（1 KiB = 1024 字节）将结果表示为千比字节（KiB）。这综合了分辨率、色彩深度和单位换算的知识，是生物和物理实验中常见的数据处理技能。
Total bits = 2048 × 1536 × 24 = 75,497,472 bits
Bytes = 75,497,472 ÷ 8 = 9,437,184 B
MB ≈ 9.44 MB; KiB ≈ 9,216 KiB
4. Algorithmic Patterns in Number Sequences | 数列中的算法模式
A mathematician asks you to generate the first 10 terms of the Fibonacci sequence using a computer program, but you must write the algorithm in pseudocode first. Then modify the algorithm to stop when the term exceeds 100. This task links iterative loops and conditional statements with one of the most famous patterns in nature, appearing in pinecones, sunflowers and shells. It also touches on efficiency: can you improve the algorithm to avoid recalculating previous terms?
一位数学家请你用计算机程序生成斐波那契数列的前 10 项，但你必须先用伪代码写出算法。然后修改算法，使它在项的值超过 100 时停止。这个任务将循环、条件语句与自然界中最著名的规律之一联系起来，斐波那契数列出现在松果、向日葵和贝壳中。它还涉及效率问题：你能否改进算法，避免重复计算前面的项？
Pseudocode: a ← 0, b ← 1, output a, output b; repeat c ← a+b, output c, a ← b, b ← c until c > 100
5. Cryptography and Prime Numbers in History | 密码学与历史上的质数
numbers so large that cracking the code would take billions of years. Explain why the difficulty of factorising a large semiprime (product of two primes) into its original primes makes RSA encryption secure. Write down the steps needed to encrypt the letter 'A' RSA example with primes p=3, q=11. This merges number theory, history and digital safety.
在二战期间，破解恩尼格玛密码依赖数学上的弱点与计算机器。今天，互联网安全使用的质数如此之大，以至于破解密码需要数十亿年。解释为何将一个大半质数（两个质数的乘积）分解回原始质数的困难性使得 RSA 加密非常安全。写出使用一个极简化的 RSA 示例（质数 p=3, q=11）加密字母“A”（ASCII 65）的步骤。这融合了数论、历史与数字安全知识。
n = p×q = 33, φ(n)=20; choose e=7 (coprime to 20); d=3 (since 7×3 mod 20 = 1).
Ciphertext = 65⁷ mod 33 = 26
6. Pixel Art and Coordinate Geometry | 像素艺术与坐标几何
a heart on a grid. Each cell can be black or white. Write down the binary run-length encoding for row 3 if the pixels (from left to right) are: white, white, black, black, black, black, white, white. Then design a simple algorithm that uses nested loops to draw a 45° diagonal line from the top‑ s connects image representation with Cartesian coordinates and basic programming structures.
你想在一个 8×8 的网格上创建一个心形像素图标，每个单元格可以是黑色或白色。如果第 3 行从左到右的像素是：白、白、黑、黑、黑、黑、白、白，请写出它的二进制游程编码。然后设计一个简单的算法，使用嵌套循环在任意正方形画布上从左上角绘制一条 45° 对角线。这连接了图像表示与笛卡尔坐标及基本编程结构。
Row 3 RLE: 2 white, 4 black, 2 white (in binary: 010 100 010 if using 3-bit counters)
7. Simulation in Geography: Population Growth | 地理中的模拟：人口增长
A geographer wants to model how a population changes over 20 years. The model uses a simple rule: each year, the population grows by a fixed birth rate and decreases by a fixed death rate. Create a spreadsheet that shows the population at the end of each year, starting from an initial value of 10,000 with a birth rate of 5% and a death rate of 2%. Explain how absolute and relative cell references help when you copy the formula downwards. Why is a computer simulation useful here, given that actual human systems are far more complex?
一位地理学家想模拟人口在 20 年中的变化。模型使用一个简单规则：每年人口按固定的出生率增长，并按固定的死亡率减少。创建一个电子表格，显示每年年底的人口数，初始人口为 10,000，出生率 5%，死亡率 2%。解释在向下复制公式时绝对引用和相对引用是如何起作用的。考虑到真实人类社会系统复杂得多，这里的计算机模拟为什么还是有用的？
Formula: = previous_year * (1 + $B$1 - $B$2) where B1=birth rate, B2=death rate
8. Sound Sampling and Music Technology | 声音采样与音乐技术
When you record music in a studio, the audio is digitised by measuring the sound wave amplitude thousands of times per second. The standard CD sample rate is 44.1 kHz, which is more than double the highest frequency humans can hear (approx. 20 kHz). Use the Nyquist theorem to explain why 44.1 kHz is chosen. Then, calculate the bit rate (in kilobits per second) for a mono track with a 16‑bit sample resolution. How many megabytes are needed for a 3‑minute song?
当你在录音棚录制音乐时，音频通过每秒数千次测量声波振幅来数字化。标准 CD 采样率是 44.1 kHz，这是人类能听到的最高频率（约 20 kHz）的两倍多。用奈奎斯特定理解释为什么选择 44.1 kHz。然后计算单声道、16 位采样精度的比特率（千位/秒）。一首 3 分钟的歌曲需要多少兆字节？
Nyquist theorem: sample rate ≥ 2 × max frequency. Bit rate = 44,100 × 16 = 705.6 kbps.
3 min = 180 s, bits = 127,008,000; MB ≈ 15.14 MB (uncompressed)
9. Network Topologies and Urban Planning | 网络拓扑与城市规划
The layout of roads in a new town is being designed. A grid street plan resembles a mesh topology, while a main avenue with side streets looks more like a star topology. Compare the advantages and disadvantages of these two network topologies in terms of fault tolerance, cost and data collisions. Then describe how a router acts like a central traffic controller in a star network, directing packets efficiently. This parallel between computer networks and physical transport systems helps reinforce abstract networking concepts.
一座新城镇的道路布局正在设计中。方格网状的街道类似于网状拓扑，而带有分支道路的主干道更像星型拓扑。比较这两种网络拓扑在容错能力、成本和数据冲突方面的优缺点。然后描述路由器如何像星型网络中的中央交通控制器一样高效地引导数据包。计算机网络与实体交通系统之间的这种类比，有助于巩固抽象的网络概念。
- Mesh: every node connected, high redundancy but expensive.
- Star: central hub, single point of failure but cheaper and simple to manage.
- 网状：每个节点相连，冗余性高但成本高。
- 星型：中央集线器，单点故障但成本低且易于管理。
10. Error Detection in Everyday Barcodes | 条形码中的错误检测与日常生活
duct at a supermarket, the barcode contains a check digit to catch misread items. The ISBN‑13 book code uses a weighted modulo 10 check digit. For the ISBN 978‑0‑136‑17356‑?, calculate the missing check digit using the rule: sum (odd‑positioned digits) + 3 × sum (even‑ practical data validation, showing that maths is embedded in the technology we use daily.
每次你在超市扫描商品时，条形码中都包含一个校验位，以便捕捉读取错误。ISBN‑13 书号使用加权模 10 校验位。对于 ISBN 978‑0‑136‑17356‑?，用如下规则计算缺失的校验位：奇数位数字之和加上 3 乘以偶数位数字之和，结果必须是 10 的倍数。这种技术将模运算与实际数据验证结合在一起，展示了数学嵌入在我们日常使用的技术中。
9+8+1+6+7+5 = 36, (7+0+3+1+3+6)×3 = 60, total=96, check digit=4 (to make 100)
11. Flowcharts and Cooking Recipes | 流程图与烹饪食谱
A cake recipe states: mix flour, sugar and eggs; if the mixture is too dry, add milk one tablespoon at a time until smooth; then pour into a tin and bake for 25 minutes at 180 °C. Draw a flowchart that represents this process. Ensure you use correct symbols: oval for start/stop, rectangle for processes, diamond for decisions. This demonstrates that algorithmic thinking applies not only to code but also to any sequence of instructions with conditions and repetition.
一个蛋糕食谱上写：把面粉、糖和鸡蛋混合；如果面糊太干，就一次加一汤匙牛奶直到顺滑；然后倒入烤模，在 180 °C 下烤 25 分钟。画出表示这个过程的流程图，确保使用正确的符号：开始/结束用椭圆，处理用矩形，判断用菱形。这表明算法思维不仅适用于代码，也适用于任何带有条件和重复的指令序列。
12. Boolean Logic in Everyday Search | 日常搜索中的布尔逻辑
Imagine you are researching sharks and rays for a biology project. Write a search query using Boolean operators AND, OR and NOT to find pages that contain both 'shark' and 'cartilage', but exclude pages focused only on 'stingray'. Also, explain how search engines use inverted indexes to speed up these queries. This final task ties together logic, language precision and database fundamentals, all of which are essential for efficient research in the digital age.
设想你正在为一个生物课题研究鲨鱼和鳐鱼。请利用布尔运算符 AND、OR 和 NOT 写一个搜索查询，以查找同时包含“shark”和“cartilage”，但排除只关注“stingray”的页面。然后解释搜索引擎如何使用倒排索引来加速这类查询。这最后一个任务将逻辑、语言精确性和数据库基础知识结合在一起，这些都是在数字时代进行高效研究所必需的。
Query: ("shark" AND "cartilage") NOT "stingray"
Published by TutorHao | KS3 CIE Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图