Interdisciplinary Integrated Question Practice for Year 12 AQA Computer Science | Year 12 AQA 计算机：跨学科综合题型训练

📚 Interdisciplinary Integrated Question Practice for Year 12 AQA Computer Science | Year 12 AQA 计算机：跨学科综合题型训练

This article offers a set of interdisciplinary exam-style questions designed for Year 12 AQA Computer Science students. Each section draws connections between computing and areas such as electronics, physics, mathematics, business, and biology. By working through these worked examples, you will strengthen your ability to apply computational thinking across subject boundaries – a skill highly valued in the AQA specification.

本文为 Year 12 AQA 计算机科学学生提供一系列跨学科考题训练。每个小节将计算机科学与电子学、物理学、数学、商学以及生物学等领域联系起来。通过演练这些带有详细解析的例题，你将增强跨学科应用计算思维的能力，这正是 AQA 考试大纲所强调的核心素养。

1. Binary Arithmetic and Boolean Logic in Circuit Design | 电路设计中的二进制算术与布尔逻辑

Digital circuits are the physical embodiment of Boolean algebra. A half-adder, which adds two single-bit binary numbers, is a perfect example of how logic gates implement binary arithmetic. Below is a typical AQA-style integrated question.

数字电路是布尔代数的物理体现。能对两个单比特二进制数求和的半加器，就是逻辑门实现二进制算术的绝佳范例。以下是一个典型的 AQA 式综合题。

Example question: A half-adder has two inputs, A and B, and produces a Sum (S) and a Carry (C). Derive the Boolean expressions for S and C using only basic gates (AND, OR, NOT). Then draw the circuit diagram and explain how it can be combined to form a full adder.

例题：一个半加器有两个输入 A 和 B，产生和（S）与进位（C）。仅使用基本门（与、或、非）推导 S 和 C 的布尔表达式，然后画出电路图，并说明如何将其组合成全加器。

C=0; A=0, B=1 → S=1, C=0; A=1, B=0 → S=1, C=0; A=1, B=1 → S=0, C=1. From the table, S = (¬A ∧ B) ∨ (A ∧ ¬B) which simplifies to A XOR B. C = A ∧ B.

解题步骤：首先建立真值表：A=0, B=0 时 S=0, C=0；A=0, B=1 时 S=1, C=0；A=1, B=0 时 S=1, C=0；A=1, B=1 时 S=0, C=1。根据真值表，S = (¬A ∧ B) ∨ (A ∧ ¬B)，可简化为 A XOR B；C = A ∧ B。

Using XOR gate constructed from basic gates: S = (A ∧ ¬B) ∨ (¬A ∧ d carry; the second half-adder adds the partial sum with a carry-in to generate the final sum, and an OR gate combines the two carry outputs.

异或门可用基本门构成：S = (A ∧ ¬B) ∨ (¬A ∧ B)。进位 C 仅需一个与门。将两个半加器级联即可构成全加器：第一个半加器对 A 和 B 求和，产生部分和与进位；第二个半加器将部分和与进位输入相加得到最终和，再用一个或门将两个进位输出合并。

2. Floating Point Representation and Measurement Error | 浮点数表示与测量误差

In physics experiments, sensor readings are often stored as floating-point numbers. Understanding the IEEE-style representation used in AQA helps to quantify measurement errors introduced by limited precision.

在物理实验中，传感器读数常以浮点数存储。理解 AQA 课程中所用的类 IEEE 表示法，有助于量化因有限精度而引入的测量误差。

Example: A 12-bit binary floating-point format uses 1 sign bit, 5 exponent bits with a bias of 15, and a 6-bit mantissa with the leading bit assumed 1 (normalised). The bit pattern 0 10001 101100 represents a reading from a pressure sensor. Convert this to decimal and find the absolute error if the true pressure is 27.5 Pa.

例题：一个 12 位二进制浮点格式使用 1 位符号位、5 位阶码（偏移量 15）和 6 位尾数（已规格化，隐含前导 1）。二进制位串 0 10001 101100 表示某个压力传感器的读数。将其转换为十进制，并求当真实压强为 27.5 Pa 时的绝对误差。

+ 1/2 + 1/8 + 1/16 = 1.6875. Value = +1.6875 × 2² = 1.6875 × 4 = 6.75 Pa. Absolute error = |27.5 - 6.75| epresent numbers in that range; the sensor must scale its output or use a larger exponent.

符号位为 0（正数）。阶码 10001₂ = 17，减去偏移量 15 得 2。尾数位 101100，隐含前导 1，即 1.101100₂ = 1 + 1/2 + 1/8 + 1/16 = 1.6875。真值 = +1.6875 × 2² = 6.75 Pa。绝对误差 = |27.5 - 6.75| = 20.75 Pa。如此巨大的误差表明该格式无法表示该量程内的数值；传感器必须缩放输出或使用更大的阶码。

3. Graph Algorithms and Urban Traffic Planning | 图算法与城市交通规划

Dijkstra's shortest path algorithm, a core topic in the AQA data structures section, finds direct application in geographic information systems (GIS) for route optimisation. Integrating mathematics and geography makes this a classic interdisciplinary problem.

Dijkstra 最短路径算法是 AQA 数据结构部分的核心内容，直接应用于地理信息系统（GIS）中的路线优化。融合数学与地理的题目正是典型的跨学科问题。

Scenario: A city map is modelled as a graph where nodes are junctions and weighted edges are distances in km. Use Dijkstra's algorithm to find the shortest route from node A to node F. Edge list: A-B:4, A-C:2, B-C:1, B-D:5, C-D:8, C-E:10, D-F:6, E-F:2. Show your visited set and distances at each step.

情景：一张城市地图被建模为图，节点为路口，带权边为距离（公里）。使用 Dijkstra 算法求从节点 A 到节点 F 的最短路径。边列表：A-B:4, A-C:2, B-C:1, B-D:5, C-D:8, C-E:10, D-F:6, E-F:2。展示每一步的已访问集合与距离。

0; E=2+10=12. Step3: visit B (dist 3); update D via B: 3+5=8 (<10), so D=8. Step4: visit D (dist 8); update F via D: 8+6=14. Step5: visit E (dist 12); update F via E: 12+2=14 (no change). Step6: visit F. Shortest path A-C-B-D-F with total 14 km. Alternatively A-C-B-D? Wait, C-B-D: C to B is 1, B-D 5, so A-C-B-D = 2+1+5=8, plus D-F 6 =14, yes.

初始化：dist[A]=0，其余为∞。第1步：访问 A；更新 B=4，C=2。第2步：访问 C（未访问中最短）；经 C 更新 B：2+1=3 (<4)，故 B=3；D=2+8=10；E=2+10=12。第3步：访问 B（距离3）；经 B 更新 D：3+5=8 (<10)，故 D=8。第4步：访问 D（距离8）；经 D 更新 F：8+6=14。第5步：访问 E（12）；经 E 更新 F：12+2=14（不变）。第6步：访问 F。最短路径 A-C-B-D-F，总距离 14 km。

4. SQL Queries and Business Data Analysis | SQL 查询与商业数据分析

Databases are ubiquitous in business. Writing efficient SQL to extract actionable insights ties computer science to commerce. The following example mimics a realistic AQA question on a sales database.

数据库在商业中无处不在。编写高效 SQL 以提取可操作的见解，将计算机科学与商科紧密联系起来。以下示例模拟了一道真实的 AQA 销售数据库题目。

Table Sales: SaleID, ProductID, Quantity, SaleDate. Table Products: ProductID, ProductName, Category, Price. Write SQL to: (a) list the total revenue (Quantity*Price) for each product sold in 2024; (b) find the product with the highest total revenue; (c) update the price of all 'Electronics' products by reducing 10%.

表 Sales：SaleID, ProductID, Quantity, SaleDate。表 Products：ProductID, ProductName, Category, Price。编写 SQL 完成：(a) 列出 2024 年售出的每种产品的总收入（Quantity*Price）；(b) 找出总收入最高的产品；(c) 将所有 'Electronics' 类产品价格降低 10%。

Revenue FROM Sales S JOIN Products P ON S.ProductID = P.ProductID WHERE S.SaleDate BETWEEN '2024-01-01' AND '2024-12-31' ductID = P.ProductID GROUP BY P.ProductName) AS RevenueTable ORDER BY Rev DESC LIMIT 1; (c) UPDATE Products SET Price = Price * 0.9 WHERE Category = 'Electronics';

广告 / Sponsored

Revenue FROM Sales S JOIN Products P ON S.ProductID = P.ProductID WHERE S.SaleDate BETWEEN '2024-01-01' AND '2024-12-31' GROUP BY P.ProductName; (b) 使用子查询排序取最高；或者用 MAX 子查询。(c) UPDATE Products SET Price = Price * 0.9 WHERE Category = 'Electronics';

5. Network Protocols and Signal Transmission in Physics | 网络协议与物理信号传输

Data transmission over physical media merges computer networking with wave physics. The AQA specification asks you to calculate bit rates and understand encoding schemes like Manchester encoding, which relates to electromagnetic signals.

通过物理介质传输数据，将计算机网络与波动物理学融合起来。AQA 大纲要求你计算比特率，并理解曼彻斯特编码等方案，而这些都与电磁信号有关。

Question: um data rate in bits per second. What would happen if the cable length causes a signal attenuation of -6 dB? (Use the formula: attenuation in dB = 10 log₁₀(Pout/Pin)).

题目：一条双绞线以 100 MHz 时钟频率传输曼彻斯特编码数据。解释为何使用曼彻斯特编码，并计算最大数据速率（bps）。如果电缆长度造成 -6 dB 的信号衰减，会发生什么？（使用公式：衰减 dB = 10 log₁₀(Pout/Pin)）。

entical bits that could cause clock drift. Each bit uses two signal elements (a transition), so the baud rate equals 2 × bit rate. Given clock 100 MHz, the maximum symbol rate is 100 Mbaud. Hence data rate = 100 Mbaud / 2 = 50 Mbps. Attenuation of -6 dB means 10 log₁₀(Pout/Pin) = -6 → log₁₀(Pout/Pin) = -0.6 → Pout/Pin ≈ 0.251. So only about 25% eaches the receiver; the signal may fall below the noise threshold, increasing bit errors.

曼彻斯特编码将时钟与数据合二为一，无需独立时钟线即可保证同步，且避免了长串相同比特导致的时钟漂移。每个比特占用两个信号码元（跳变），因此波特率是比特率的两倍。时钟 100 MHz 时，最大符号速率为 100 Mbaud。故数据速率 = 100 Mbaud / 2 = 50 Mbps。-6 dB 衰减意味着 10 log₁₀(Pout/Pin) = -6 → Pout/Pin ≈ 0.251，接收端仅获得约 25% 的输入功率，信号可能降至噪声门限以下，增加误码率。

6. Sorting Algorithms and Scheduling in Operations Research | 排序算法与运筹学调度

Merge sort exemplifies a divide-and-conquer strategy that also appears in operations research for optimal scheduling. Combining algorithmic complexity with industrial engineering illustrates cross-disciplinary thinking.

归并排序体现了分治策略，该策略同样出现在运筹学的最优调度中。将算法复杂度与工业工程相结合，展现了跨学科思维。

Task: A factory has 8 jobs with processing times: [12, 5, 3, 8, 10, 7, 4, 6] hours. Using the concept of merge sort, explain how to sort the jobs by ascending time and derive the time complexity. Then discuss how a sorted list helps in applying the Shortest Processing Time (SPT) scheduling rule to minimise average completion time.

任务：工厂有 8 个作业，加工时长分别为：[12, 5, 3, 8, 10, 7, 4, 6] 小时。运用归并排序的概念解释如何按时间升序排列作业，并推导时间复杂度。然后讨论排序后的列表如何帮助应用最短加工时间（SPT）调度规则，以最小化平均完成时间。

array, the algorithm yields [3,4,5,6,7,8,10,12]. In scheduling, SPT rule processes the shortest job first. After sorting, the sequence 3,4,5,6,7,8,10,12 gives completion times: 3,7,12,18,25,33,43,55; average = 24.5 hours – ce yields higher averages. Thus sorting is a preprocessing step essential to optimisation.

归并排序递归地将列表划分为单元素子表，再按序合并，时间复杂度为 O(n log n)。对给定数组执行后得到 [3,4,5,6,7,8,10,12]。在调度中，SPT 规则优先加工时间最短的作业。排序后，序列 3,4,5,6,7,8,10,12 的完成时间依次为 3,7,12,18,25,33,43,55，平均 24.5 小时——这是可能的最小平均值。不排序则其他序列会得到更高均值。因此，排序是优化中不可或缺的预处理步骤。

7. Finite State Machines and Biological Sequence Analysis | 有限状态机与生物序列分析

Finite state machines (FSMs) model pattern recognition. In bioinformatics, scanning DNA for specific motifs like start codons is a direct application. This blends computer theory with molecular biology.

有限状态机（FSM）可用于模式识别建模。在生物信息学中，扫描 DNA 以寻找起始密码子等特定模体，正是其直接应用。这融合了计算机理论与分子生物学。

Design scenario: Construct a Mealy machine that accepts the input alphabet {A, U, G, C} and outputs 1 when the sequence 'AUG' is recognised (overlapping allowed). Provide the state transition diagram. Then simulate the input string A U G A U G G and show the output sequence.

设计场景：构造一个 Mealy 机，输入字母表为 {A, U, G, C}，当识别到序列 'AUG' 时输出 1（允许重叠）。给出状态转移图，并模拟输入串 A U G A U G G，展示输出序列。

States: S0 (start, no match), S1 (seen 'A'), S2 (seen 'AU' hers→S0/0. Overlap is handled because after output on G, the machine resets but the next symbol could be A to start new match. Input: A-U-G-A-U-G-G. Simulation: A→S1/0, U→S2/0, G→S0/1 (output 1). Next A→S1/0, U→S2/0, G→S0/1 (output 1). Next G→S0/0. Output sequence: 0,0,1,0,0,1,0. Thus two matches found.

状态：S0（初始，无匹配），S1（已见 A），S2（已见 AU）。转移：S0 下 A→S1/0，其他回 S0/0。S1: U→S2/0, A→S1/0，其他 S0/0。S2: G→S0/1（输出 1 并返回 S0 以允许重叠），A→S1/0，其他 S0/0。重叠被正确处理，因为 G 后复位，紧接着的 A 可开启新匹配。模拟输入 A U G A U G G：A→S1/0, U→S2/0, G→S0/1；A→S1/0, U→S2/0, G→S0/1；最后 G→S0/0。输出序列：0,0,1,0,0,1,0，共找到两次匹配。

8. Image Representation and Medical Imaging | 图像表示与医学成像

Bitmap graphics, colour depth, and resolution are crucial in medical diagnostics, where X-ray or MRI scans must retain fine detail. Compromising on storage can affect clinical decisions, bringing together computer science and healthcare.

位图图形、色彩深度与分辨率在医学诊断中至关重要，X 光或 MRI 扫描必须保留精细细节。存储上的妥协可能影响临床决策，将计算机科学与医疗保健紧密相连。

Problem: 48 pixel image with 12-bit grayscale. Calculate the uncompressed file size in megabytes. The hospital uses lossy compression that reduces file size to 2 MB. Discuss one positive and one negative impact of this compression on diagnostic accuracy, linking to sampling theory and human visual perception.

问题：一张胸部 X 光片以 2048 × 2048 像素、12 位灰度拍摄。计算未压缩文件大小（MB）。医院使用有损压缩将文件缩小至 2 MB。结合采样理论与人类视觉感知，讨论该压缩对诊断准确性的一个正面和一个负面影响。

6.0 MB exactly (since 2048²=4,194,304; ×12/8=6,291,456 bytes = 6 MB). Positives: smaller file size allows faster transmission for teleradiology; human eye cannot detect subtle variations at full 12-bit depth after windowing, so controlled compression may be clinically acceptable. Negatives: lossy compression might discard high-frequency details (e.g., microcalcifications) that are diagnostically significant, violating the Nyquist criterion for faithful reproduction; irreversible artefacts can lead to misdiagnosis.

未压缩大小：2048 × 2048 × 12 比特 = 50,331,648 比特。1 字节 = 8 比特 → 6,291,456 字节。1 MB = 2²⁰ 字节 ≈ 1,048,576 字节 → 6,291,456 / 1,048,576 = 6.0 MB（因为 2048²=4,194,304；乘 12/8 = 6,291,456 字节 = 6 MB）。正面：较小文件能加快远程放射影像传输；人眼在窗口调节后难以分辨全 12 位深度的细微差异，因此受控压缩在临床上可能可接受。负面：有损压缩可能丢弃对诊断至关重要的高频细节（如微小钙化点），违背忠实再现的奈奎斯特准则；不可逆的伪影可能导致误诊。

---

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）