📚 AS WJEC Computer Science: Interdisciplinary Integrated Question Training | AS WJEC 计算机科学：跨学科综合题型训练
Interdisciplinary questions in AS WJEC Computer Science challenge you to apply computational thinking beyond pure programming. These problems often blend concepts from mathematics, sciences, humanities, and business, requiring you to model real-world situations, design algorithms, and evaluate solutions. This article presents a series of integrated question types to sharpen your cross-curricular skills.
AS WJEC 计算机科学中的跨学科题目要求你超越纯编程，将计算思维应用到不同领域。这些问题往往融合数学、科学、人文和商业概念，需要你对真实场景建模、设计算法并评估解决方案。本文呈现一系列综合题型，旨在提升你的跨学科技能。
1. Mathematics and Algorithmic Efficiency | 数学与算法效率分析
Many WJEC questions link mathematical functions with algorithmic performance. You may be asked to write pseudocode for a mathematical process, such as generating the Fibonacci sequence or calculating factorial, and then analyse its time complexity using Big-O notation. Understanding how loop structures and recursive calls correspond to mathematical growth rates is essential.
许多 WJEC 题目将数学函数与算法性能相联系。你可能需要为某个数学过程（如生成斐波那契数列或计算阶乘）编写伪代码，然后使用大 O 记法分析其时间复杂度。理解循环结构和递归调用如何对应数学增长速率至关重要。
Example: thm to compute the n-th triangular number T(n) = 1+2+...+n. Determine its time complexity.
示例：编写一个迭代算法计算第 n 个三角数 T(n) = 1+2+...+n。确定其时间复杂度。
(n+1)/2 yields O(1). Examiners often expect you to compare naive iterative solutions with closed-form mathematical ones.
解答思路：使用一个从 1 到 n 的求和循环。这需要 n 次迭代，时间复杂度为 O(n)。若使用直接公式 T(n) = n(n+1)/2，则复杂度为 O(1)。考官常期望你对比朴素的迭代解法与闭合形式的数学解法。
n-1) + O(1) leads to O(n). Be prepared to trace recursive calls and draw a recursion tree.
对于递归算法，你需要建立递推关系。例如阶乘：T(n) = T(n-1) + O(1) 得到 O(n)。准备好跟踪递归调用并绘制递归树。
When analysing nested loops for matrix operations or sorting, you often get O(n²) or O(n log n). Practice counting primitive operations and simplifying to the dominant term.
当分析矩阵运算或排序的嵌套循环时，你常会得到 O(n²) 或 O(n log n)。练习计算基本操作并将其简化为主导项。
2. Physics and Sensor Data Acquisition | 物理与传感器数据采集
Sensor-based questions integrate physics concepts like voltage, sampling, and analogue-to-digital conversion. You might need to calculate digital representations of physical measurements, consider sampling rates and aliasing, or write code to process sensor data streams.
基于传感器的问题融合了电压、采样和模数转换等物理概念。你可能需要计算物理测量值的数字表示，考虑采样率与混叠，或编写代码处理传感器数据流。
Example: 3.3 V and 10-bit resolution is used. The minimum step size is 3.3 / 1024 ≈ 0.00322 V. If 0–3.3 V maps to 0– ux, the digital value = floor(450 / 0.977) ≈ 460, binary representation: 460 = 111001100₂.
示例：使用参考电压 3.3 V、10 位分辨率的 ADC。最小步长为 3.3 / 1024 ≈ 0.00322 V。若 0–3.3 V 对应 0–1000 lux，则光照度分辨率为 1000/1024 ≈ 0.977 lux。对于 450 lux，数字值 = floor(450 / 0.977) ≈ 460，二进制表示为 111001100₂。
for a 50 Hz variation, sample at ≥ 100 Hz. Explain how undersampling leads to distortion.
始终牢记奈奎斯特准则：采样频率至少是信号最高频率的两倍以避免混叠。因此对于 50 Hz 的变化，采样频率需 ≥ 100 Hz。解释欠采样如何导致失真。
You may also be asked to write a simple data-logging routine that reads the ADC register and converts it to meaningful units, storing timestamps. This combines physics measurement with programming loops and file output.
你可能还需要编写一个简单的数据记录程序，读取 ADC 寄存器并将其转换为有意义的单位，同时存储时间戳。这结合了物理测量与编程循环及文件输出。
3. Biology and DNA Sequence Pattern Matching | 生物与 DNA 序列模式匹配
Computational biology often requires searching for patterns in nucleotide sequences. WJEC may present you with a string of A, C, G, T bases and ask you to implement a search algorithm, highlighting efficiency trade-offs between brute-force and optimized methods like Boyer-Moore or KMP.
计算生物学常需要在核苷酸序列中搜索模式。WJEC 可能会给出由 A、C、G、T 碱基组成的字符串，要求你实现搜索算法，并指出蛮力法与 Boyer-Moore 或 KMP 等优化方法之间的效率权衡。
Example: Given sequence 'AGCTATGCCATGC', count occurrences of 'ATG' pattern length m=3, but for variable m, brute-force is O(n*m). Trace the comparison steps.
示例：给定序列 'AGCTATGCCATGC'，统计 'ATG' 的出现次数。简单的滑动窗口有效。对于定长模式 m=3，复杂度为 O(n)，但对于可变长度 m，蛮力法为 O(n*m)。追踪比较步骤。
You may be asked to describe how a finite state machine can be designed to recognise a motif. Draw a state transition diagram for the pattern 'ATG', linking to automata theory. Discuss the transition table and accepting state.
你可能会被要求描述如何设计有限状态机来识别特定片段。绘制模式 'ATG' 的状态转换图，与自动机理论相联系。讨论转换表和接受状态。
Another typical task involves finding all occurrences and printing their start indices. This requires string handling and careful index management, common in bioinformatics tools.
另一典型任务是找出所有出现位置并打印其起始索引。这需要字符串处理和谨慎的索引管理，在生物信息学工具中十分常见。
4. Business and Normalised Database Design | 商业与规范化数据库设计
Business scenarios typically involve tables of customer orders, products, and suppliers. Normalisation questions test your ability to eliminate data redundancy and anomalies. You will be given unnormalised data and must decompose it into 1NF, 2NF, and 3NF, identifying primary and foreign keys appropriately.
商业场景通常涉及客户订单、产品和供应商表。规范化题目测试你消除数据冗余和异常的能力。你会得到未规范化的数据，必须将其分解为 1NF、2NF 和 3NF，合理确定主键和外键。
Example: Normalise the following table to 3NF: Order(OrderID, CustomerID, CustomerName, ProductID, ProductName, SupplierCode, SupplierName, Quantity). Step-by-step: 1NF remove repeating groups; 2NF remove partial key dependencies; 3NF remove transitive dependencies. Resulting tables: Customers, Products, Suppliers, Orders (linking keys).
示例：将下表规范化到 3NF：Order(OrderID, CustomerID, CustomerName, ProductID, ProductName, SupplierCode, SupplierName, Quantity)。逐步进行：1NF 去除重复组；2NF 去除部分依赖；3NF 去除传递依赖。结果表：Customers、Products、Suppliers、Orders（用外键连接）。
Explain why this prevents update anomalies—if a supplier changes name, it only needs updating in one place. Also discuss how normalised design affects query performance and how indexing can help.
解释这为何能防止更新异常——若供应商更名，只需在一处更新。并讨论规范化设计如何影响查询性能以及索引如何提供帮助。
You might be asked to write SQL queries joining the normalised tables to retrieve information, linking business requirements with database skills.
你可能会被要求编写连接规范化表的 SQL 查询以检索信息，将业务需求与数据库技能结合起来。
5. Geography and Shortest Path Algorithms | 地理与最短路径算法
Geographical information systems (GIS) rely on graph algorithms to find routes. You may be presented with a weighted graph of towns and asked to apply Dijkstra's algorithm, recording visited
Published by TutorHao | AS Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图