📚 Interdisciplinary Integrated Question Practice for Year 9 CIE Computer Science | Year 9 CIE计算机：跨学科综合题型训练
In Cambridge IGCSE™ Computer Science, real‑world problems often demand more than pure programming skills – they require you to combine computing concepts with knowledge from mathematics, science, geography, economics and even music. The following set of interdisciplinary exercises mirrors the style of CIE papers where questions weave together data representation, algorithms, system analysis and practical applications. Each section targets a specific subject crossover and provides a concrete problem, worked example and extension task that will sharpen your ability to think across disciplines.
在剑桥 IGCSE™ 计算机科学中，真实世界的问题往往不只考察纯粹的编程技能——它们要求你将计算机概念与数学、科学、地理、经济甚至音乐等学科知识结合起来。以下这组跨学科练习模拟了 CIE 试卷的风格，题目将数据表示、算法、系统分析与实际应用交织在一起。每一节都针对一个特定的学科交叉点，提供具体问题、解析示例和拓展任务，帮助你锻炼跨学科思维。
1. Mathematics: Binary Arithmetic & Number Systems | 数学：二进制运算与数制转换
Computer science relies heavily on binary mathematics, which links directly with the number systems taught in mathematics. You will often need to convert between decimal (base‑10) and binary (base‑2), perform binary addition, and understand how binary patterns represent data such as characters in ASCII.
计算机科学高度依赖二进制数学，这与数学课程中的数制直接关联。你经常需要在十进制（基数为 10）和二进制（基数为 2）之间转换，进行二进制加法，并理解二进制模式如何表示数据，例如 ASCII 字符。
Example question: A temperature sensor sends readings as 8‑bit unsigned binary integers. Convert the decimal reading 97 into binary and then state the ASCII character represented if the binary value is interpreted as an ASCII code.
例题：温度传感器发送的读数是 8 位无符号二进制整数。将十进制读数 97 转换为二进制，并说明如果将该二进制值当作 ASCII 编码解释，它表示什么字符。
, 3 ÷ 2 = 1 r 1, 1 ÷ 2 = 0 r 1. Reading remainders from bottom to top gives 1100001₂. In 8‑ 1₂. Looking up the ASCII table, 01100001₂ (decimal 97) corresponds to the lowercase letter 'a'.
解答：对 97 反复除以 2 取余数：97 ÷ 2 = 48 余 1，48 ÷ 2 = 24 余 0，24 ÷ 2 = 12 余 0，12 ÷ 2 = 6 余 0，6 ÷ 2 = 3 余 0，3 ÷ 2 = 1 余 1，1 ÷ 2 = 0 余 1。从下往上读取余数得到 1100001₂。写成 8 位是 01100001₂。查阅 ASCII 表，01100001₂（十进制 97）对应小写字母 'a'。
Practice task: Write pseudocode that takes a list of decimal sensor values (0–255), converts each to an 8‑bit binary string and prints the corresponding ASCII symbol. This exercise reinforces base conversion, string manipulation and the connection between numbers and text.
练习任务：编写伪代码，输入一组十进制传感器值（0–255），将每个值转换为 8 位二进制字符串并输出对应的 ASCII 符号。这道练习能巩固进制转换、字符串处理以及数字与文字之间的联系。
2. Physics: Simulating Motion with Algorithms | 物理：用算法模拟运动
Algorithms can model physical phenomena such as motion under constant velocity. This interdisciplinary problem links the computing concept of iteration with the physics equation s = v × t, where s is distance travelled, v is velocity and t is time elapsed.
算法可以模拟匀速运动等物理现象。这个跨学科问题将计算机的迭代概念与物理公式 s = v × t（s 为移动距离，v 为速度，t 为经过时间）联系起来。
Example: A robot moves at a constant speed of 0.5 m/s. Write a program to update its position every 0.2 seconds for 2 seconds and output the final distance from the start.
例题：一个机器人以 0.5 m/s 的恒定速度移动。编写程序每 0.2 秒更新一次位置，持续 2 秒，最后输出离出发点的距离。
Pseudocode solution: time <- 0; position <- 0; WHILE time < 2 DO position <- position + 0.5 * 0.2; time <- time + 0.2; ENDWHILE; PRINT position. This loop calculates the distance increment for each 0.2 s step and accumulates it, giving a final position of 0.5 m.
伪代码解法：time ← 0; position ← 0; WHILE time < 2 DO position ← position + 0.5 × 0.2; time ← time + 0.2; ENDWHILE; PRINT position。循环每次计算 0.2 秒移动的距离并累加，最终位置为 0.5 m。
the physics equation v = u + a×t, and use a list to store the positions for later plotting — a perfect integration of iteration, arithmetic and physics.
拓展：修改算法，在每个时间步长中增加速度以模拟加速运动。结合物理公式 v = u + a×t，并用列表存储位置以便日后绘图——这是迭代、算术与物理的完美结合。
3. Biology: DNA Sequence Pattern Matching | 生物：DNA序列模式匹配
Bioinformatics uses algorithms to analyse genetic data. A DNA strand can be represented as a string of characters (A, T, C, G). Searching for a specific pattern within a DNA sequence is a direct application of string handling and searching algorithms studied in computer science.
生物信息学使用算法分析基因数据。一条 DNA 链可以表示为字符串（字符 A、T、C、G）。在 DNA 序列中搜索特定模式是计算机科学中字符串处理与搜索算法的直接应用。
Example: Given the DNA string "ATGCCTAGCTAGCATG", write a program to find the first occurrence of the pattern "TAG". Output the starting index, or a message if not found.
例题：给定 DNA 字符串 "ATGCCTAGCTAGCATG"，编写程序找到模式 "TAG" 第一次出现的位置。输出起始索引，如果未找到则提示相应信息。
Solution approach: Use a linear search loop that slides a window of length 3 across the string, comparing the substring with "TAG". Alternatively, many languages offer built‑in functions such as find(). In the given strand, "TAG" first appears at index 5 (0‑based).
解法思路：使用线性搜索循环，在字符串上滑动长度为 3 的窗口，将子串与 "TAG" 比较。也可以使用许多语言内置的 find() 函数。在给定的链中，"TAG" 首次出现在索引 5（从 0 开始计数）。
Practice: Extend the task to count all occurrences of a given codon (e.g. "GCT") using a loop and a counter variable. This exercise deepens understanding of string slices, loops and pattern recognition — skills that are as vital in biology as they are in algorithm design.
练习：扩展任务，使用循环和计数器变量统计某个密码子（例如 "GCT"）在序列中出现的总次数。这个练习能加深对字符串切片、循环和模式识别的理解，这些技能在生物学和算法设计中同样关键。
4. Chemistry: Molecular Mass Calculator with Arrays | 化学：用数组计算相对分子质量
Chemists frequently compute the relative molecular mass (Mᵣ) of a compound. This can be automated using arrays (or lists) to store atomic masses and atom counts, linking chemistry with structured data handling.
化学家经常需要计算化合物的相对分子质量（Mᵣ）。用数组（或列表）存储原子量和原子个数可以实现自动计算，将化学与结构化数据处理联系在一起。
ive molecular mass of sulfuric acid, H₂SO₄. Relative atomic masses: H = 1, S = 32, O = 16.
例题：计算硫酸 H₂SO₄ 的相对分子质量。已知相对原子质量：H = 1，S = 32，O = 16。
Algorithm: Initialise total_mass ← ised by storing elements and their counts in parallel arrays, then iterating through them.
算法：初始化 total_mass ← 0。累加质量：2 × 1（氢） + 1 × 32（硫） + 4 × 16（氧）。总和 = 2 + 32 + 64 = 98。这可以通过将元素及其原子个数存入平行数组，然后遍历数组来实现泛化。
Pseudocode: elements <- ['H','S','O' i <- 0 TO LENGTH(elements)-1 DO total <- total + counts[i] × masses[i]; PRINT total. This structure is reusable for any compound.
伪代码：elements ← ['H','S','O']; counts ← [2,1,4]; masses ← [1,32,16]; total ← 0; FOR i ← 0 TO LENGTH(elements)-1 DO total ← total + counts[i] × masses[i]; PRINT total。这个结构对于任何化合物都可重复使用。
5. Geography: Analysing Climate Data | 地理：分析气候数据
Meteorological stations record monthly average temperatures. Processing such datasets involves statistical calculations that computer algorithms handle efficiently — a cross‑over between geography and data science.
气象站记录月平均气温。处理这类数据集涉及统计计算，计算机算法可以高效地完成——这是地理与数据科学的交叉领域。
Example: A list temps = [3.5, 4.2, 7.0, 10.1, 13.6, 16.8, 18.9, 18.2, 15.0, 11.3, 7.2, 4.8] holds monthly mean temperatures (°C) from January to December. Calculate the annual average, the highest temperature and the month when it occurred.
例题：列表 temps = [3.5, 4.2, 7.0, 10.1, 13.6, 16.8, 18.9, 18.2, 15.0, 11.3, 7.2, 4.8] 存储了 1 月到 12 月的月平均气温（°C）。计算全年平均气温、最高气温及其出现的月份。
Solution: Use a loop to sum the values, then divide by 12. To find the maximum, keep track of the highest value and its index. The average is 11.2°C (rounded); the maximum is 18.9°C in July (index 6, corresponding to month 7).
解答：使用循环累加所有值，再除以 12。查找最大值时，记录最高值和它的索引。平均气温为 11.2°C（四舍五入）；最高气温为 18.9°C，出现在 7 月（索引 6，对应月份 7）。
Extension: Write an algorithm to count how many months had temperatures above the annual average. This combines conditionals inside a loop and mirrors real‑life climate analysis performed by geographers.
拓展：编写算法统计有多少个月份的气温高于年平均气温。这需要在循环内加入条件判断，与地理学家进行的实际气候分析方式一致。
6. Music: Digital Sound Representation | 音乐：数字音频表示
Recording music digitally involves sampling an analogue wave. The file size of an uncompressed audio clip depends on the sampling rate, bit depth and duration. This is a perfect illustration of how computer science quantifies artistic content.
数字录音的过程是对模拟声波进行采样。未压缩的音频片段文件大小取决于采样率、位深度和时长。这是计算机科学量化艺术内容的绝佳例证。
Question: Calculate the file size in kilobytes for a 3‑minute stereo recording with a sampling rate of 44.1 kHz and 16‑bit depth.
题目：计算一段 3 分钟立体声录音的文件大小（单位千字节），已知采样率为 44.1 kHz，位深度为 16 位。
File size formula (uncompressed):
File size (bits) = Sampling rate (Hz) × Bit depth × Duration (s) × Number of channels
文件大小公式（未压缩）：
文件大小（比特）= 采样率（Hz）× 位深度 × 时长（秒）× 声道数
016000 ÷ 8 ÷ 1024 ≈ 30993 KB (about 30.3 MB). This shows the enormous data demands of high‑quality audio.
计算：44100 × 16 × (3 × 60) × 2 = 44100 × 16 × 180 × 2 = 254016000 比特。换算成千字节：254016000 ÷ 8 ÷ 1024 ≈ 30993 KB（约 30.3 MB）。这体现了高质量音频巨大的数据需求。
7. Economics: Simple Spreadsheet Models | 经济学：简单电子表格模型
In business and economics, spreadsheets are used to build financial models. Understanding cell references, formulas and built‑in functions bridges computer science and economic decision‑making.
在商业和经济学中，电子表格被用来构建财务模型。理解单元格引用、公式和内置函数，是计算机科学与经济决策之间的桥梁。
Scenario: A school tuck shop sells snacks. Construct a spreadsheet that predicts profit. Column A lists the snack name; column B the cost price per item; column C the selling price; column D the quantity sold. Column E should calculate the profit per item, and cell E10 should display the total profit.
场景：学校小卖部出售零食。构建一个预测利润的电子表格。A 列列出零食名称；B 列为单位成本；C 列为售价；D 列为销售数量。E 列应计算每种零食的利润，单元格 E10 应显示总利润。
is simple model introduces relative and absolute referencing, basic arithmetic operations and the SUM function — all core ICT skills that support economic analysis.
模型：E2 公式为 =(C2-B2)*D2，向下填充。E10 公式为 =SUM(E2:E9)。这个简单模型引入了相对引用与绝对引用、基本算术运算和 SUM 函数——这些都是支持经济分析的核心信息通信技术技能。
8. Art & Design: Image Data and Pixels | 艺术设计：图像数据与像素
Digital images are composed of pixels, each storing colour information. The relationship between image resolution, colour depth and file size links art, design and computing fundamentals.
数字图像由像素构成，每个像素存储颜色信息。图像分辨率、颜色深度与文件大小之间的关系，将艺术、设计和计算基础联系在一起。
ixels and a colour depth of 24 bits per pixel. Calculate the file size of the uncompressed image in megabytes.
任务：某学生创作了一幅数字绘画，分辨率为 1280 × 720 像素，颜色深度为 24 位每像素。计算未压缩图像的文件大小（单位兆字节）。
4 = 2700 KB. Megabytes = 2700 ÷ 1024 ≈ 2.64 MB. This demonstrates why higher resolution leads to larger files.
计算：总像素数 = 1280 × 720 = 921600。总比特数 = 921600 × 24 = 22118400 比特。字节数 = 22118400 ÷ 8 = 2764800 字节。千字节 = 2764800 ÷ 1024 = 2700 KB。兆字节 = 2700 ÷ 1024 ≈ 2.64 MB。这说明为什么分辨率越高，文件越大。
9. History: Simple Cipher and Cryptography | 历史：简单密码与加密
Cryptography has been used throughout history to protect messages. The Caesar cipher, a basic substitution cipher, is an excellent example of how modulo arithmetic and ASCII manipulation can be applied in programming.
密码学在历史上一直被用于保护信息。凯撒密码是一种基本的替换密码，它完美展示了模运算和 ASCII 码操作如何在编程中应用。
Question: Using a shift of 3, encrypt the plaintext word "HELLO". Assume only uppercase letters are used. Each letter should be shifted forward by
Published by TutorHao | Year 9 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图