📚 Year 10 AQA Computer Science: Cross-disciplinary Integrated Question Practice | Year 10 AQA 计算机：跨学科综合题型训练
Integrated questions in AQA GCSE Computer Science often blend computational thinking with mathematics, science and logical reasoning. This article provides targeted training on the most common cross-topic question types encountered in Year 10, helping you build confidence for both Paper 1 and Paper 2. Each section models a typical problem, shows how to unpack the cross-disciplinary demands, and offers practice tips with step-by-step English and Chinese explanations.
AQA GCSE 计算机科学中的综合题型常常将计算思维与数学、科学及逻辑推理结合在一起。本文针对 Year 10 阶段最常见的跨知识点题型进行专项训练，帮助你为 Paper 1 和 Paper 2 建立信心。每个小节都模拟一道典型题目，展示如何拆解其中的跨学科要求，并以中英双语逐步解析的方式提供练习提示。
1. Binary–Denary Conversion and Place Value | 二进制与十进制转换及位权
Binary numbers are the foundation of all computer data representation. A typical integrated question asks you to convert between denary and binary, or to work out how many bits are needed to represent a given range of values. This links directly to place value from Key Stage 3 mathematics.
二进制数是计算机中所有数据表示的基础。典型的综合题会要求你在十进制和二进制之间进行转换，或者计算出表示某个取值范围所需的最少位数。这直接与初中阶段的数学位权知识相关联。
For example: " s an integer from −20 °C to 80 °C. How many bits are needed to store the reading using two's complement?" (−20) + 1 = 101 values, then find the smallest n such that 2ⁿ ≥ 101 (n = 7, since 2⁷=128).
例题：'一个传感器测量温度，范围为 −20 °C 到 80 °C。如果使用二进制补码存储，需要多少位？' 此时你需要计算不同的取值个数：80 − (−20) + 1 = 101，然后找到最小的 n 使得 2ⁿ ≥ 101（n=7，因为 2⁷=128）。
re values like 0110.1100₂ = 6.75₁₀. The maths here is a direct application of place value.
你还需要掌握小数的转换：一个8位定点数，小数点后4位，例如 0110.1100₂ = 6.75₁₀。这里的数学运算就是位权的直接应用。
Practice tip: always draw a place value table with headings 2³ 2² 2¹ 2⁰ . 2⁻¹ 2⁻² 2⁻³ 2⁻⁴ and fill in the binary digits.
练习提示：始终画一张位权表，表头为 2³ 2² 2¹ 2⁰ . 2⁻¹ 2⁻² 2⁻³ 2⁻⁴，然后填入二进制数字。
2. Binary Addition and Overflow | 二进制加法与溢出
Binary addition follows the same column addition rules as denary arithmetic, but with only two digits. A crossover question might ask you to add two 8-bit unsigned integers and state whether overflow occurs, or to interpret the result in two's complement.
二进制加法与十进制加法使用相同的列相加规则，只不过只有两个数字。交叉题型可能要求你将两个 8 位无符号整数相加并说明是否发生溢出，或者以二进制补码的方式解释结果。
Example: 1010 1100₂ + 0111 1001₂. You add column by column, carrying 1 when the sum reaches 2. The result is 1 0010 0101₂, but since we are working in 8-bit registers, the leftmost carry-out indicates overflow if we are treating the numbers as unsigned. In two's complement, the interpretation changes and you must check the sign bits.
例题：1010 1100₂ + 0111 1001₂。逐位相加，当和为 2 时进位 1。结果是 1 0010 0101₂，但由于我们使用 8 位寄存器，如果把这两个数当作无符号数处理，最左边的进位表示溢出。如果使用二进制补码，则解释会改变，你需要检查符号位。
Maths link: modular arithmetic and the range of representable integers. For n bits, unsigned range is 0 to 2ⁿ−1; two's complement range is −2ⁿ⁻¹ to 2ⁿ⁻¹−1.
数学联系：模运算以及可表示整数的范围。n 位无符号数的范围是 0 到 2ⁿ−1；二进制补码的范围是 −2ⁿ⁻¹ 到 2ⁿ⁻¹−1。
Year 10 students often lose marks by forgetting to state the impact of overflow in a program, e.g., a byte that wraps from 255 to 0 causes a logic error.
Year 10 学生常因忘记说明溢出在程序中的影响而丢分，例如一个字节从 255 回绕到 0 会导致逻辑错误。
3. Bitmap Image File Size Calculations | 位图图像文件大小计算
Calculating image file size requires connecting the concept of colour depth (bits per pixel) and resolution (pixel dimensions) with unit conversions. This is a prime cross-disciplinary number where computer science meets applied arithmetic.
计算图像文件大小需要将色彩深度（每像素位数）和分辨率（像素尺寸）与单位换算联系起来。这是计算机科学与应用算术相遇的典型跨学科题型。
Formula: file size (bits) = width × height × colour depth. A common question: "A 400 × 300 pixel image uses 16-bit colour depth. Calculate the file size in kilobytes." Then divide by 8 to get bytes (240,000 B), then by 1024 to get approximately 234.375 KiB.
公式：文件大小（位）= 宽度 × 高度 × 色彩深度。常见题型：'一张 400 × 300 像素的图像使用 16 位色彩深度。计算文件大小，以千字节为单位。' 计算 400 × 300 × 16 = 1,920,000 位。然后除以 8 得到 240,000 字节，再除以 1024 得到约 234.375 KiB。
You must remember that the AQA specification expects you to use 1024 for kilobyte conversions in the context of file size, not 1000. Also be ready to work backwards: given the file size and colour depth, find the image dimensions.
需要注意，AQA 大纲期望你在文件大小换算中使用 1024 而非 1000。同时要能够逆向计算：给定文件大小和色彩深度，求图像尺寸。
Practice tip: write down the unit conversion chain carefully, and annotate each step with words and numbers.
练习提示：仔细写出单位换算链，并为每一步标记文字说明和数字。
4. Sound Sampling and File Size | 声音采样与文件大小
Sound file size calculations mirror the bitmap case but involve sample rate, bit depth, duration, and channels. This topic blends understanding of analogue-to-digital conversion with multiplicative reasoning.
声音文件大小的计算与位图类似，但涉及采样率、采样深度、时长和声道数。该主题将模数转换的理解与乘法推理结合在一起。
e size (bits) = sample rate (Hz) × bit depth × duration (s) × number of channels. Example: " o clip is sampled at 44.1 kHz with 16-bit depth. Calculate the raw file size in megabytes." = 42,336,000 bits. Convert: ÷8 → 5,292,000 B; ÷1024 → 5167.97 KiB; ÷1024 → about 5.05 MiB.
公式：文件大小（位）= 采样率 (Hz) × 采样深度 × 时长 (s) × 声道数。例题：'一段 30 秒的立体声音频以 44.1 kHz 采样，16 位深度。计算原始文件大小，以兆字节为单位。' 计算：44100 × 16 × 30 × 2 = 42,336,000 位。换算：÷8 → 5,292,000 字节；÷1024 → 5167.97 KiB；÷1024 → 约 5.05 MiB。
Integrated questions may ask you to compare the effect of doubling the sample rate or reducing bit depth, linking to data compression and quality. You must be able to reason proportionally: if sample rate doubles, file size doubles, assuming other factors unchanged.
综合题可能要求你比较采样率加倍或采样深度减半对文件大小的影响，并与数据压缩和音质建立联系。你需要能够进行比例推理：假设其他因素不变，采样率加倍会使文件大小加倍。
5. Logic Gates and Truth Tables | 逻辑门与真值表
Logic gates (AND, OR, NOT, XOR) are introduced as the building blocks of digital circuits. Exam questions often ask you to complete truth tables, draw circuit diagrams, or write Boolean expressions. This directly uses notation and truth values from KS3/KS4 mathematics.
逻辑门（与门、或门、非门、异或门）是数字电路的构建模块。试题常要求你完成真值表、画出电路图或写出布尔表达式。这直接使用了初高中阶段的数学符号和真值。
ND gate, whose output C goes into a NOT gate to produce Q. The Boolean expression is Q = NOT (A AND B), written as Q = ¬(A · B). The truth table combines all four input patterns and evaluates the final output.
对于给定的逻辑图，你需要标出中间输出并逐步构建真值表。例题：一个电路，输入 A 和 B 进入与门，其输出 C 再进入非门，最终输出 Q。布尔表达式为 Q = NOT (A AND B)，写作 Q = ¬(A · B)。真值表列出所有四种输入组合并计算最终输出。
Cross-disciplinary links: Boolean algebra is a mathematical system, and truth tables are essentially an application of if-then reasoning. Year 10 students should also be able to relate logic circuits to simple control systems (e.g., a fan that turns on when the temperature is high AND the window is closed).
跨学科关联：布尔代数是一种数学系统，真值表本质上是如果-那么推理的应用。Year 10 学生还应能够将逻辑电路与简单的控制系统联系起来（例如，当温度高并且窗户关着时风扇启动）。
6. Boolean Algebra Simplification | 布尔代数化简
Simplifying Boolean expressions reduces the number of gates needed, a practical design task. Questions may provide a sum-of-products expression and ask you to simplify it using Boolean laws, then draw the simplified circuit.
布尔表达式化简能够减少所需门电路的数量，这是一项实际的设计任务。题目可能给出一个与或式，要求你使用布尔定律进行化简，然后画出简化的电路。
Key laws: Identity (A · 1 = A), Null (A + 1 = 1), Idempotent (A + A = A), Complement (A · ¬A = 0), Distributive, and De Morgan’s laws. Example: Simplify (A · B) + (A · ¬B). Apply distributive: A · (B + ¬B) = A · 1 = A. The circuit reduces from four gates to just a wire.
关键定律：同一律 (A · 1 = A)、零一律 (A + 1 = 1)、幂等律 (A + A = A)、互补律 (A · ¬A = 0)、分配律和德摩根律。例题：化简 (A · B) + (A · ¬B)。应用分配律：A · (B + ¬B) = A · 1 = A。电路从四个门减少到仅一根导线。
This is pure algebraic manipulation, but the application is grounded in the physics of transistor circuits. Make sure you can write a truth table to verify your simplified expression.
这纯粹是代数操作，但其应用立足于晶体管电路的物理原理。务必能写出真值表来验证你的化简结果。
7. Algorithmic Thinking: Flowcharts and Pseudocode | 算法思维：流程图与伪代码
Algorithm questions require you to interpret a flowchart or write pseudocode for a given task. These tasks often have a mathematical core: finding the maximum of three numbers, checking if a number is prime, or calculating the nth term of a sequence.
算法题要求你解读流程图或为给定任务编写伪代码。这些任务通常有一个数学核心：找到三个数中的最大值、检查一个数是否为质数、或计算数列的第 n 项。
An integrated question might show a flowchart for Euclid’s algorithm to find the greatest common divisor (GCD) and ask you to trace it for inputs 48 and 18. The trace table combines variables, conditions, and outputs, linking directly to arithmetic operations and problem solving.
综合题可能展示欧几里得算法求最大公约数 (GCD) 的流程图，并要求你对输入 48 和 18 进行跟踪。跟踪表综合了变量、条件和输出，直接与算术运算和问题求解相联系。
Key pseudocode keywords: INPUT, OUTPUT, IF ... THEN ... ELSE ... ENDIF, WHILE ... DO ... ENDWHILE, FOR ... TO ... NEXT. You must use indentation clearly. AQA also allows a more visual representation using the AQA pseudocode guide.
关键伪代码关键字：INPUT, OUTPUT, IF ... THEN ... ELSE ... ENDIF, WHILE ... DO ... ENDWHILE, FOR ... TO ... NEXT。你必须使用清晰的缩进。AQA 也允许使用 AQA 伪代码指南中更具视觉化表达的表示法。
8. Linear Search vs Binary Search Comparison | 线性搜索与二分搜索对比
Searching algorithms provide a rich context for cross-disciplinary thinking. Linear search checks each item in turn; binary search works on sorted data by repeatedly dividing the search interval in half. Comparison questions often link to logarithmic thinking.
搜索算法为跨学科思维提供了丰富的语境。线性搜索逐个检查每一项；二分搜索应用于已排序数据，通过反复将搜索区间对半分来工作。对比题常常与对数思维相关联。
ar search takes at most n comparisons in the worst case, while binary search needs at most ⌈log₂(n)⌉ ar search may require 1,000,000 steps, but binary search requires at most 20 steps. This dramatic difference explains why sorted data and efficient algorithms matter.
对于大小为 n 的数据集，线性搜索在最坏情况下最多需要 n 次比较，而二分搜索最多需要 ⌈log₂(n)⌉ 次比较。当 n = 1,000,000 时，线性搜索可能需要 1,000,000 步，但二分搜索最多只需 20 步。这一巨大差异解释了为什么有序数据和高效算法如此重要。
When tracing binary search, you must keep track of the low, mid, and high indices. A common exam task is to complete a trace table for binary search on a specific array, showing the comparison at each step.
在跟踪二分搜索时，你必须记录 low、mid 和 high 指针。一个常见的考试任务是完善对特定数组进行二分搜索的跟踪表，展示每一步的比较过程。
9. Data Transmission and Transfer Time | 数据传输与传输时间
file size (bits) ÷ transfer rate (bps). This is a straightforward application of the speed–distance–time relationship in physics, as well as unit conversion.
传输时间的计算出现在网络速度与文件大小的语境中。公式为：时间 (s) = 文件大小（位）÷ 传输速率 (bps)。这是物理学中速度-距离-时间关系的直接应用，同时也是单位换算的应用。
Example: " tion with a download speed of 16 Mbps. Calculate the minimum transmission time in seconds." 1 Mbps = 1,000,000 bps for data transfer). Time = 16,777,216 ÷ 16,000,000 ≈ 1.05 seconds.
例题：'一个 2 MB 的文件通过下载速度为 16 Mbps 的连接进行传输。计算最短传输时间，以秒为单位。' 首先将 2 MB 转换为位：2 × 1024 × 1024 × 8 = 16,777,216 位。16 Mbps = 16,000,000 bps（AQA 在数据传输中使用 1 Mbps = 1,000,000 bps）。时间 = 16,777,216 ÷ 16,000,000 ≈ 1.05 秒。
Beware of the difference between file size units (typically powers of 2) and transmission speed units (powers of 10). The AQA exam will often specify which conversion to use, but it is best to remember the conventions.
注意文件大小单位（通常为 2 的幂）与传输速度单位（10 的幂）之间的区别。AQA 考试常会指定使用哪种换算方式，但最好记住这些惯例。
10. Run-Length Encoding and Compression Ratio | 行程长度编码与压缩比
Run-length encoding (RLE) is a lossless compression method that replaces repeated characters with a count and the character. Integrated questions can ask you to encode/decode a string and then calculate the compression ratio, blending logic with percentage calculations.
行程长度编码是一种无损压缩方法，它用一个计数和字符来替换重复的字符。综合题可能要求你对字符串进行编码/解码，然后计算压缩比，将逻辑与百分比计算融合在一起。
Example: Encode "AAABBBCCAA". The runs are AAA (3A), BBB (3B), CC (2C), AA (2A), giving the encoding "3A3B2C2A" ssuming 8-bit ASCII). New size = 8 × 8 = 64 bits. Compression ratio = (80 − 64) ÷ 80 × 100% = 20% reduction. Space savings are calculated as (1 − compressed/original) × 100%.
例题：编码 "AAABBBCCAA"。行程为 AAA (3A)、BBB (3B)、CC (2C)、AA (2A)，得到编码 "3A3B2C2A"。原始大小 = 10 × 8 = 80 位（假设 8 位 ASCII）。新大小 = 8 × 8 = 64 位。压缩比 = (80 − 64) ÷ 80 × 100% = 20% 减小。空间节省按 (1 − 压缩后/原始) × 100% 计算。
You should also be able to explain why RLE is effective for simple graphic images with large areas of solid colour, but less effective for photographs. This connects to the structure of bitmap images and the concept of entropy from information theory.
你还需要能够解释为什么 RLE 对有大面积纯色的简单图形有效，但对照片效果较差。这与位图图像的结构以及信息论中的熵概念相联系。
11. Subnetting and Bitwise Operations (Extension) | 子网划分与按位运算（拓展）
Although subnet masks are more commonly encountered at A Level, Year 10 students may see extension material involving ANDing IP addresses with subnet masks to find the network address. This is a direct application of bitwise AND and binary conversion.
虽然子网掩码更常见于 A Level，Year 10 学生可能会遇到拓展内容，其中涉及将 IP 地址与子网掩码进行按位与运算以得到网络地址。这是按位 AND 和二进制转换的直接应用。
1100100 AND 11111111.11111111.11111111.00000000 = 11000000.10101000.00000001.00000000, which is 192.168.1.0. This network address identifies the subnet.
给定 IP 地址 192.168.1.100 和掩码 255.255.255.0，将每个八位组转换为二进制并执行按位与：001.01100100 AND 11111111.11111111.11111111.00000000 = 11000000.10101000.00000001.00000000，即 192.168.1.0。该网络地址识别出子网。
Such problems strengthen your binary skills and show how computer science underpins modern networking. Even if not directly examined, the practice is valuable for Paper 2 problem-solving sections.
此类问题能够强化你的二进制技能，并展示计算机科学如何支撑现代网络。即使不直接考试，这些练习对 Paper 2 的解决问题部分也很有价值。
12. Putting It All Together: A Mixed Cross-Domain Question Walkthrough | 融会贯通：一道混合跨域题的演练
To consolidate, let's model a question that asks: " itmap with 24-bit colour. The image is compressed using RLE, and the compressed file is 450 KiB. The file is then transmitted over a 5 Mbps connection. In pseudocode, outline an algorithm that checks if the transmitted file has been received correctly by comparing a checksum." e task draws on image calculation, compression, transmission time, and algorithmic design.
为了巩固知识，让我们模拟一道题目：'一个图像传感器捕捉 1024 × 768 的位图，24 位色彩。图像使用 RLE 压缩，压缩后的文件为 450 KiB。然后通过 5 Mbps 连接进行传输。用伪代码概述一个算法，通过对比校验和来检查接收的文件是否正确。' 这一项任务综合了图像计算、压缩、传输时间和算法设计。
296 B ≈ 2304 KiB. Compressed size = 450 KiB, so compression ratio = (2304 − 450)/2304 ≈ 80% mod 256) and appends it. Receiver performs the same calculation and compares. If they match, output "File OK" etransmission. The pseudocode would use a WHILE loop reading bytes and accumulating a sum.
步骤 1：原始文件大小 = 1024 × 768 × 24 = 18,874,368 位 = 2,359,296 B ≈ 2304 KiB。压缩后大小 = 450 KiB，因此压缩比 = (2304 − 450)/2304 ≈ 80% 减小。步骤 2：传输时间 = (450 × 1024 × 8) ÷ 5,000,000 ≈ 0.74 秒。步骤 3：算法：发送方计算校验和（例如所有字节之和模 256）并附加之。接收方执行相同计算并进行比较。若匹配，则输出 "File OK"，否则请求重传。伪代码将使用 WHILE 循环读取字节并累加总和。
This walkthrough demonstrates how breaking a complex problem into manageable parts that each use a different disciplinary toolkit leads to a complete solution. Practice such multi-step problems regularly, and always show your conversions and reasoning clearly.
这个演练展示了如何将一个复杂问题分解为可管理的部分，每个部分使用不同的学科工具，最终形成完整的解决方案。请定期练习这类多步骤题目，并始终清晰地展示换算和推理过程。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图