📚 Interdisciplinary Integrated Question Practice for Year 7 OCR Computer Science | Year 7 OCR 计算机：跨学科综合题型训练
In the Year 7 OCR Computer Science curriculum, computing is not an isolated subject – it weaves together skills from mathematics, science, design, and even the humanities. This article provides a set of interdisciplinary integrated questions designed to sharpen your computational thinking while making clear connections to other subjects. Each section introduces a topic, explains how computer science links with another discipline, and offers practice questions with guided answers. By working through these examples, you will see how algorithms, binary, data representation, and logic can solve real-world problems across the curriculum.
在Year 7 OCR计算机科学课程中，计算机并不是一门孤立的学科——它融合了数学、科学、设计甚至人文学科的技能。本文提供了一套跨学科综合题型训练，旨在锻炼你的计算思维，同时清楚地展示计算机与其他学科的联系。每个部分都会介绍一个主题，解释计算机科学如何与另一门学科相结合，并提供练习题和引导性答案。通过练习这些题目，你将看到算法、二进制、数据表示和逻辑如何解决课程中的实际问题。
1. Algorithmic Thinking and Mathematics: Solving Arithmetic with Flowcharts | 算法思维与数学：用流程图解决算术问题
Algorithms are step-by-step instructions, much like equations in mathematics. In this section, you will combine flowchart design with arithmetic sequences to solve pattern problems. A common type of question asks you to draw a flowchart that calculates the nth term of a sequence, such as 3, 6, 9, 12… This requires using a loop and a counter, concepts that directly mirror algebraic reasoning.
算法就像一步步的指令，类似于数学中的方程。本节将结合流程图设计与算术序列来解决模式问题。常见题型是绘制一个流程图，计算数列的第n项，例如3, 6, 9, 12……这需要使用循环和计数器，这些概念直接对应代数推理。
Practice Question: Create a flowchart for an algorithm that asks the user to input a number n, and then outputs the nth triangular number. (Triangular numbers: 1, 3, 6, 10, 15… where the nth term is given by n(n+1)/2).
练习题：创建一个算法流程图，要求用户输入数字n，然后输出第n个三角形数。（三角形数：1, 3, 6, 10, 15……第n项公式为n(n+1)/2）。
Guided Solution: The flowchart should start with an input symbol for n. Then use a process box to set a variable sum = 0. Next, use a loop with a counter i from 1 to n. Inside the loop, add i to sum. After the loop, output sum. If you are confident with the formula, you can also use a single process box: sum = n*(n+1)/2. Both approaches are correct, but the loop version demonstrates algorithmic thinking more clearly.
引导性解答：流程图应以输入符号接收n开始。然后使用处理框将变量sum设为0。接着使用循环，计数器i从1到n。在循环内，将i加到sum上。循环结束后，输出sum。如果对公式有信心，也可以只用一个处理框：sum = n*(n+1)/2。两种方法都正确，但循环版本更清晰地展示了算法思维。
2. Binary and Number Systems: Bridging Mathematics and Computing | 二进制与数字系统：连接数学与计算
Understanding binary is not just about converting numbers; it also reveals the mathematical beauty of place value systems. Base-2 (binary) and base-10 (denary) are linked through powers of two, just as our decimal system uses powers of ten. A typical interdisciplinary question might ask you to add two binary numbers and then check your answer by converting to denary – reinforcing both computing and mental arithmetic skills.
理解二进制不仅仅是转换数字，它还揭示了位值系统的数学之美。基数为2（二进制）和基数为10（十进制）通过2的幂相关联，就像我们的十进制系统使用10的幂一样。一道典型的跨学科题目可能要求你将两个二进制数相加，然后通过转换为十进制来检查答案——这既强化了计算技能，也巩固了心算能力。
Practice Question: Add the binary numbers 1011₂ and 110₂. Show your working in binary, then convert all numbers (including the sum) to denary to verify. Explain why binary addition follows a similar ‘carry’ rule as decimal addition.
练习题：将二进制数1011₂和110₂相加。展示二进制运算过程，然后将所有数（包括和）转换为十进制进行验证。解释为什么二进制加法遵循与十进制加法类似的“进位”规则。
Guided Solution: 1011₂ (11 in denary) + 0110₂ (6 in denary) = 10001₂ (17 in denary). In binary, 1+0=1, 1+1=0 carry 1, and 1+1+1=1 carry 1. This happens because in base‑2, the maximum digit is 1; just as in base‑10, the maximum digit is 9, so we carry when we reach the base value.
引导性解答：1011₂（十进制11）+ 0110₂（十进制6）= 10001₂（十进制17）。在二进制中，1+0=1，1+1=0进1，1+1+1=1进1。这是因为二进制中最大数字是1，就像十进制中最大数字是9，所以当达到基数值时就需要进位。
3. Data Representation and Science: Sensor Data Logging | 数据表示与科学：传感器数据记录
In science experiments, you often collect measurements like temperature, light levels, or pH. Computer systems use sensors to capture this analogue data and convert it into digital signals via an ADC (Analogue-to-Digital Converter). An interdisciplinary question could ask you to design a data logging system for a greenhouse, selecting appropriate sensors, explaining sampling rate, and interpreting a graph of the collected data.
在科学实验中，你经常需要收集温度、光照强度或pH值等测量数据。计算机系统使用传感器捕获这些模拟数据，并通过模数转换器（ADC）将其转换为数字信号。一道跨学科题目可能要求你为温室设计一个数据记录系统，选择合适的传感器，解释采样率，并解读收集到的数据图表。
Practice Question: A greenhouse manager wants to keep tomato plants between 18°C and 26°C. Data is collected every 5 minutes and stored in a CSV file. Explain what ‘sampling rate’ means. If the temperature sensor has a resolution of 0.5°C, how many distinct digital values are needed to cover the range from 0°C to 40°C? Suggest a suitable number of bits for the ADC.
练习题：一位温室管理员希望将番茄植株的温度保持在18°C到26°C之间。每5分钟收集一次数据并保存在CSV文件中。解释“采样率”的含义。如果温度传感器的分辨率为0.5°C，覆盖0°C到40°C的范围需要多少个不同的数字值？建议ADC的合适位数。
Guided Solution: Sampling rate is how often data is recorded; here, every 5 minutes. The range 0–40°C in steps of 0.5°C gives (40/0.5)+1 = 81 distinct values. To represent 81 values, you need at least 7 bits because 2⁶=64 (not enough) and 2⁷=128 (enough). Therefore, a 7‑bit ADC would work.
引导性解答：采样率是指数据被记录的频率；此处为每5分钟一次。0–40°C的范围，步长为0.5°C，共有(40/0.5)+1 = 81个不同的值。要表示81个值，至少需要7位，因为2⁶=64（不够），2⁷=128（足够）。因此，一个7位的ADC就可以胜任。
4. Logic Gates and Physics: Circuit Design for a Security System | 逻辑门与物理：安全系统电路设计
Logic gates are the building blocks of digital circuits, and they behave according to Boolean algebra – a mathematical system. In physics, simple circuits using switches demonstrate the same AND/OR logic. An integrated problem might ask you to design a home alarm system that triggers when a door is opened AND a motion sensor is activated, but ONLY if the system is armed. This requires combining two AND gates and one NOT gate, linking electronics with logical reasoning.
逻辑门是数字电路的构建模块，它们遵循布尔代数——一种数学系统。在物理中，简单的开关电路展示了相同的与/或逻辑。一个综合问题可能要求你设计一个家庭警报系统：当门被打开且运动传感器被激活时触发，但前提是系统处于布防状态。这需要组合两个与门和一个非门，将电子学与逻辑推理结合起来。
Practice Question: Inputs: Door (D), Motion (M), Arm (A). Output Alarm (Z) = (D AND M) AND A. Draw the logic circuit using standard symbols. Complete the truth table for all 8 combinations. If the system also required a panic button (P) that triggers the alarm regardless of other inputs, how would you modify the circuit?
练习题：输入：门（D），运动（M），布防（A）。输出警报（Z）= (D AND M) AND A。使用标准符号绘制逻辑电路。完成所有8种组合的真值表。如果系统还需要一个紧急按钮（P），无论其他输入如何都触发警报，你将如何修改电路？
Guided Solution: The circuit consists of two AND gates: first AND for D and M; its output and A go into a second AND. Truth table shows Z=1 only when D=1, M=1, A=1. To add panic button P, you introduce an OR gate: Z = ((D AND M) AND A) OR P. The new truth table will show Z=1 whenever P=1, or when D=M=A=1.
引导性解答：电路由两个与门组成：第一个与门处理D和M；其输出与A进入第二个与门。真值表显示只有当D=1、M=1、A=1时Z=1。要添加紧急按钮P，引入一个或门：Z = ((D AND M) AND A) OR P。新的真值表将在P=1或D=M=A=1时显示Z=1。
5. Programming and Geometry: Drawing Regular Polygons with Turtle Graphics | 编程与几何：用海龟绘图绘制正多边形
Turtle graphics in Python (or similar block-based environments) allow you to explore geometry through code. The total external angle of any polygon is 360°, so a regular n‑sided polygon requires a turn of 360°/n at each vertex. This directly applies mathematics to a programming challenge. An interdisciplinary question may ask you to write a procedure that draws a regular polygon of any number of sides, given length and number of sides as inputs.
Python中的海龟绘图（或类似的块编程环境）让你可以通过代码探索几何图形。任何多边形的外角总和为360°，因此正n边形的每个顶点需要转向360°/n。这直接将数学应用于编程挑战。一道跨学科题目可能要求你编写一个过程，给定边长和边数作为输入，绘制任意边数的正多边形。
Practice Question: Write a Python function polygon(sides, length) that uses a for loop to draw a regular polygon. Explain what happens if the number of sides is 360 and the length is very small – what shape does it approximate? How does this connect to the mathematical constant π?
练习题：编写一个Python函数polygon(sides, length)，使用for循环绘制正多边形。解释如果边数是360且边长非常小会发生什么——它近似成什么形状？这与数学常数π有何联系？
Guided Solution: The code: for _ in range(sides): t.forward(length); t.right(360/sides). When sides=360 and length is tiny, the polygon approximates a circle. The circumference of that circle ≈ sides × length, and 2πr ≈ 360 × length, so π can be approximated if radius is known. This shows how iteration can model continuous shapes.
引导性解答：代码：for _ in range(sides): t.forward(length); t.right(360/sides)。当sides=360且length很小时，多边形近似为圆。该圆的周长 ≈ sides × length，而2πr ≈ 360 × length，因此如果半径已知，可以近似π。这表明迭代可以模拟连续形状。
6. Encryption and History: Caesar Cipher in Rome | 加密与历史：古罗马的凯撒密码
The Caesar cipher is a substitution cipher where each letter is shifted by a fixed number of places. This simple encryption method was used by Julius Caesar to send secret military messages. Linking computer science with history, students can examine why the cipher was effective in times when very few people could read, and why it is extremely weak today. An interdisciplinary task might involve coding a Caesar cipher encoder/decoder and analysing its vulnerability to brute‑force attacks.
凯撒密码是一种替换密码，每个字母按固定位数移位。这种简单的加密方法曾被尤利乌斯·凯撒用于发送秘密军事情报。将计算机科学与历史联系起来，学生可以探讨为什么在识字率极低的时代这种密码有效，以及为什么它在今天极其脆弱。一项跨学科任务可能涉及编码凯撒密码的加密器和解密器，并分析其对暴力破解的脆弱性。
Practice Question: Write a pseudocode algorithm that takes a plaintext message and a shift key and outputs the ciphertext. Then describe how an attacker could break the cipher without knowing the key. What historical circumstances made the Caesar cipher secure enough for Roman military communication?
练习题：编写一个伪代码算法，输入明文消息和偏移密钥，输出密文。然后描述攻击者如何在不知道密钥的情况下破解该密码。什么样的历史环境使得凯撒密码对于罗马军事通信足够安全？
Guided Solution: Pseudocode: for each character in plaintext: if letter, shift by key modulo 26, append to ciphertext. To break: try all 25 possible shifts until a meaningful message appears (brute force). Historically, most soldiers and the general population were illiterate; intercepted messages appeared as nonsense, and the very concept of systematic decryption was not widespread, so the cipher was effective.
引导性解答：伪代码：对于明文中的每个字符：如果是字母，按密钥模26移位，附加到密文。破解方法：尝试所有25种可能的偏移，直到出现有意义的消息（暴力破解）。历史上，大多数士兵和普通民众不识字；被截获的消息看起来像胡言乱语，而且系统化解密的概念并不普及，因此该密码是有效的。
7. Databases and Geography: Querying World City Data | 数据库与地理：查询世界城市数据
Databases are excellent tools for organising structured information, such as countries and their capital cities, populations, and continents. A challenging integrated question might provide a flat‑file database table and ask you to write queries to extract specific geographical insights – e.g. “Which African capitals have a population over 5 million?” This activity blends SQL‑like logic with geographical knowledge and data analysis.
数据库是组织结构化信息的绝佳工具，例如国家及其首都、人口和所在洲。一道有挑战性的综合题可能提供一个平面文件数据库表，要求你编写查询以提取特定的地理信息——例如，“哪些非洲首都人口超过500万？”这项活动将类似SQL的逻辑与地理知识和数据分析相结合。
Practice Question: Given the table CITIES(City, Country, Continent, Population), write a query (in pseudocode or simple SQL) to list all Asian cities with a population greater than 10 million, sorted by population descending. Extend the question: if the database only stores country and city populations, how would you calculate the percentage of the country’s population living in the capital? Which data privacy concerns might arise?
练习题：给定表CITIES(城市, 国家, 洲, 人口)，编写一个查询（用伪代码或简单SQL），列出所有人口超过1000万的亚洲城市，按人口降序排列。扩展问题：如果数据库只存储国家和城市人口，如何计算居住在该国首都的人口百分比？可能会引发哪些数据隐私问题？
Guided Solution: Query: SELECT City FROM CITIES WHERE Continent=’Asia’ AND Population>10000000 ORDER BY Population DESC. To find percentage: (Capital_population / Country_population)*100. Data privacy concerns: population data might be outdated or reveal sensitive patterns about migration, requiring care when publishing such information.
引导性解答：查询：SELECT City FROM CITIES WHERE Continent=’Asia’ AND Population>10000000 ORDER BY Population DESC。计算百分比：(首都人口 / 国家人口)*100。数据隐私问题：人口数据可能过时或揭示有关人口迁移的敏感模式，发布此类信息时需要谨慎。
8. Artificial Intelligence and Biology: Simulating a Simple Neural Network | 人工智能与生物：模拟简单的神经网络
Artificial neural networks are inspired by biological brains. Even a simple perceptron can be understood using basic mathematics and logic. A suitable Year 7 question could involve a single artificial neuron that classifies animals as ‘mammal’ or ‘not mammal’ based on features like ‘has fur’ and ‘gives milk’. The input features are combined with weights and compared to a threshold – essentially a weighted sum, similar to the algebraic expression y = w1x1 + w2x2.
人工神经网络受生物大脑的启发。即使是一个简单的感知器也可以用基础数学和逻辑来理解。一个适合Year 7的题目可能涉及一个简单的人工神经元，根据“有毛”和“产奶”等特征将动物分类为“哺乳动物”或“非哺乳动物”。输入特征与权重结合并与阈值比较——本质上是一个加权和，类似于代数表达式 y = w1x1 + w2x2。
Practice Question: Design a perceptron for the AND logic function. Set weights w1=1, w2=1 and threshold=1.5. Create a table showing all four input combinations and the output. Explain why this is a ‘binary classifier’. In biology, what is the equivalent of a neuron’s threshold?
练习题：为与逻辑函数设计一个感知器。设置权重w1=1, w2=1，阈值=1.5。创建一个表格，显示所有四种输入组合和输出。解释为什么这是一个“二分类器”。在生物学中，神经元的阈值相当于什么？
Guided Solution: The weighted sum: w1*x1 + w2*x2. For (0,0): sum=0 < 1.5 → output 0; (1,0): 1 < 1.5 → 0; (0,1): 1 < 1.5 → 0; (1,1): 2 >= 1.5 → 1. This correctly models AND. It is a binary classifier because it separates inputs into two groups. Biologically, the threshold corresponds to the membrane potential at which a neuron fires an action potential.
引导性解答：加权和：w1*x1 + w2*x2。对于(0,0)：和=0 < 1.5 → 输出0；(1,0)：1 < 1.5 → 0；(0,1)：1 < 1.5 → 0；(1,1)：2 >= 1.5 → 1。这正确模拟了与逻辑。它是一个二分类器，因为它将输入分为两组。生物学上，阈值对应于神经元产生动作电位的膜电位水平。
9. Networks and the Internet: Geographical Latency and Distance Calculation | 网络与互联网：地理延迟与距离计算
When you request a webpage, data travels through fibre‑optic cables under the ocean or via satellites. The time taken (latency) depends on distance and the speed of light in the medium. This provides an opportunity to integrate geography, physics, and computer networks. Students can be given a map of undersea cables and asked to estimate the time for a data packet to travel from London to New York, using the formula time = distance / speed (where speed in fibre is about 2×10⁸ m/s).
当你请求一个网页时，数据通过海底光纤电缆或卫星传输。所需时间（延迟）取决于距离和介质中的光速。这为整合地理、物理和计算机网络提供了机会。可以给学生一张海底电缆地图，让他们估算一个数据包从伦敦到纽约所需的时间，使用公式时间 = 距离 / 速度（光纤中的速度约为2×10⁸米/秒）。
Practice Question: The distance from London to New York along a transatlantic cable is approximately 5,600 km. How long (in milliseconds) does it take for a signal to travel this distance, assuming speed 200,000 km/s? If a satellite link goes up 35,000 km to a geostationary satellite and back, what is the two‑way delay? Discuss why satellite internet often feels slower than fibre.
练习题：伦敦到纽约的跨大西洋电缆距离约为5600公里。假设速度为200,000公里/秒，信号传播这段距离需要多少毫秒？如果卫星链路需要向上传输35,000公里到一颗地球静止卫星再返回地球，双向延迟是多少？讨论为什么卫星互联网通常感觉比光纤慢。
Guided Solution: Cable delay: time = 5600 km / 200,000 km/s = 0.028 s = 28 ms. Satellite two‑way: total distance = 2 × 35,000 km = 70,000 km; time = 70,000 / 300,000 ≈ 0.233 s = 233 ms (using speed of light in vacuum). Even without processing delay, satellite latency is much higher, making real‑time applications like gaming laggy.
引导性解答：电缆延迟：时间 = 5600 km / 200,000 km/s = 0.028 s = 28 ms。卫星双向延迟：总距离 = 2 × 35,000 km = 70,000 km；时间 = 70,000 / 300,000 ≈ 0.233 s = 233 ms（使用真空中光速）。即使没有处理延迟，卫星延迟也高得多，导致游戏等实时应用出现卡顿。
10. Computational Thinking and Art: Generating Fractal Trees | 计算思维与艺术：生成分形树
Fractals are complex patterns that are self‑similar across different scales. They appear in nature (trees, coastlines) and art. Using recursion – a powerful programming concept – you can draw fractal trees with simple code. This shows how decomposition and pattern recognition (key computational thinking skills) can create beautiful, intricate designs, linking computing with art and biology.
分形是在不同尺度上自相似的复杂图案。它们出现在自然（树木、海岸线）和艺术中。使用递归——一种强大的编程概念——你可以用简单的代码绘制分形树。这表明分解和模式识别（计算思维的关键技能）可以创造出美丽而复杂的设计，将计算与艺术和生物学联系起来。
Practice Question: A simple fractal tree can be drawn using a recursive function: draw branch of length L; if L>5, turn left 30°, draw branch of length 0.7*L; turn right 60°, draw branch of length 0.7*L; return to original position. Trace the first two levels of recursion. Explain why the base case (L<=5) is necessary. How does this resemble natural tree growth?
练习题：一个简单的分形树可以用递归函数绘制：绘制长度为L的树枝；如果L>5，左转30°，绘制长度为0.7*L的树枝；右转60°，绘制长度为0.7*L的树枝；返回原位。追踪递归的前两层。解释为什么基案（L<=5）是必要的。这与自然树木的生长有何相似之处？
Guided Solution: First call: draw vertical trunk (L=100). Since 100>5, left 30°, draw branch L=70. From there, left30° again draws L=49; right60° draws another L=49. Then back at trunk, right60° draws a branch L=70 with similar sub‑branches. The base case prevents infinite recursion and matches how real tree branches stop dividing after reaching a certain thinness. Decomposition splits the drawing into smaller, similar parts.
引导性解答：第一次调用：绘制垂直树干（L=100）。因为100>5，左转30°，绘制L=70的树枝。从那里，再次左转30°绘制L=49的树枝；右转60°绘制另一个L=49的树枝。然后回到树干，右转60°绘制一条L=70的树枝，带有类似的子枝。基案防止无限递归，并匹配真实树木树枝达到一定纤细程度后停止分叉的情况。分解将绘制任务拆分成更小的相似部分。
11. Comprehensive Integrated Practice: Smart City Case Study | 综合实践：智慧城市案例研究
To bring everything together, consider a ‘Smart City’ scenario. You are asked to design a system that monitors air quality, controls traffic lights, and provides public Wi‑Fi. This integrates sensor data collecting (Science), database storage (Computing), algorithm design for traffic flow (Mathematics), and network infrastructure (Networking). A full‑mark answer requires linking all four areas seamlessly.
为了将所有内容结合起来，考虑一个“智慧城市”场景。要求你设计一个系统，监测空气质量、控制交通灯并提供公共Wi‑Fi。这整合了传感器数据采集（科学）、数据库存储（计算）、交通流算法设计（数学）和网络基础设施（网络）。高分答案需要无缝连接所有四个领域。
Practice Question: Propose a block diagram for a smart traffic light system that changes timing based on vehicle count from induction loop sensors. Explain how binary is used to store the count, how a simple algorithm can decide green‑light duration (e.g., if count>10, extend by 10 seconds), and how mesh networks could communicate between lights. Justify the use of cloud computing vs. local processing.
练习题：为一个基于感应线圈传感器检测车辆数量的智能交通灯系统提出一个框图。解释如何使用二进制存储计数，一个简单的算法如何决定绿灯时长（例如，如果count>10，延长10秒），以及网状网络如何在交通灯之间通信。论证使用云计算与本地处理的理由。
Guided Solution: Block diagram: sensor → ADC → binary data (e.g., 8‑bit counter: up to 255 vehicles) → microcontroller running algorithm → traffic light actuator. Algorithm: if count>10 duration=base+10 else duration=base. Communication: each light as a node in a mesh network shares data to coordinate intersections. Cloud processing could analyse city‑wide patterns but introduces latency; local processing ensures real‑time response. This case study exemplifies true interdisciplinary integration.
引导性解答：框图：传感器 → ADC → 二进制数据（例如，8位计数器：最多255辆车）→ 运行算法的微控制器 → 交通灯执行器。算法：如果count>10，时长=基准+10，否则时长=基准。通信：每个交通灯作为网状网络的一个节点共享数据以协调路口。云处理可以分析全市模式但会引入延迟；本地处理确保实时响应。本案例研究体现了真正的跨学科整合。
12. Conclusion and Further Practice | 总结与进一步练习
These integrated questions demonstrate that computer science is a powerful lens through which we can understand and improve the world, linking logical reasoning, data, and algorithms with every other subject. To excel in your Year 7 OCR assessment, practice creating your own cross‑curricular problems. Try combining computing with music (e.g., programming a melody), with PE (analysing fitness data), or with history (simulating population growth). The more you connect, the deeper your understanding becomes.
这些综合问题表明，计算机科学是一个强大的透镜，通过它我们可以理解和改善世界，将逻辑推理、数据和算法与其他每一门学科联系起来。为了在Year 7 OCR评估中取得优异成绩，请尝试创建你自己的跨学科问题。尝试将计算与音乐（例如，编程一段旋律）、体育（分析健身数据）或历史（模拟人口增长）相结合。你联系得越多，你的理解就越深刻。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导