Interdisciplinary Integrated Problem-Solving for Year 13 WJEC Computer Science | 跨学科综合题型训练

📚 Interdisciplinary Integrated Problem-Solving for Year 13 WJEC Computer Science | 跨学科综合题型训练

In Year 13 WJEC Computer Science, examinations increasingly reward your ability to connect programming, theory, and architecture with real-world disciplines such as mathematics, physics, biology, economics, and engineering. This article presents a series of integrated problem-solving exercises that mirror the style of synoptic assessment. Each section blends core A-level concepts with cross-curricular contexts, helping you develop the analytical mindset needed for high-band answers.

在 Year 13 WJEC 计算机科学中，考试越来越看重你将编程、理论和体系结构与数学、物理、生物、经济和工程等现实学科相联系的能力。本文呈现一系列综合问题解决训练，模拟综合性评估的风格。每一小节都将核心 A-level 概念与跨学科情境融合，助你培养获得高分所需的解析思维。

1. Mathematical Foundations: Recursive Sequence Analysis | 数学基础：递归数列分析

In WJEC Computer Science, recursion is tested both in theory (Unit 1) and practical programming (Unit 2/3). A common interdisciplinary task presents a recurrence relation such as T(n) = T(n-1) + n, with base case T(1)=1. You need to derive a closed-form solution using mathematical induction, implement the recursive function, and analyse time complexity. This bridges discrete mathematics and algorithm design.

在 WJEC 计算机科学中，递归在理论（单元1）和实践编程（单元2/3）中都会考查。一种常见的跨学科任务是给出递推关系，例如 T(n) = T(n-1) + n，基例 T(1)=1。你需要用数学归纳法推导闭合形式解，实现递归函数并分析时间复杂度。这架起了离散数学与算法设计的桥梁。

The Python implementation ‘def T(n): return 1 if n==1 else T(n-1)+n’ is straightforward. Tracing the call stack for n=4 reveals multiple stack frames. Total number of calls is n, leading to O(n) time, but the call stack space complexity is also O(n). An iterative version reduces space to O(1) and often appears as a follow-up question on efficiency.

Python 实现 ‘def T(n): return 1 if n==1 else T(n-1)+n’ 非常直接。追踪 n=4 的调用栈会显示出多个栈帧。总调用次数为 n，导致 O(n) 时间，但调用栈空间复杂度也是 O(n)。迭代版本可将空间降至 O(1)，经常作为效率问题的追问出现。

Exam problems ask for comparison with memoisation. By caching computed results in a dictionary, subsequent calls become O(1) lookups, converting the algorithm to a linear-time process. This reflects the mathematical idea of overlapping subproblems and highlights why dynamic programming often replaces pure recursion in time-critical systems.

考题通常要求与记忆化进行比较。通过用字典缓存已计算结果，后续调用变为 O(1) 查找，算法转为线性时间。这反映了重叠子问题的数学思想，并突显了为何在时间敏感的系统中动态规划常代替纯递归。

2. Physics-based Simulation: Modelling Projectile Trajectory with OOP | 基于物理的模拟：使用面向对象建模弹道轨迹

Object-oriented programming (Unit 3) can elegantly model physical systems. Define a Projectile class with attributes: x, y, vx, vy and gravity=9.8. A method update(dt) applies the equations of motion: x += vx * dt, vy += -gravity * dt, y += vy * dt. This simple kinematics simulation reinforces both Newtonian physics and software design patterns.

面向对象编程（单元3）可以优雅地建模物理系统。定义一个 Projectile 类，属性包括 x、y、vx、vy 和 gravity=9.8。方法 update(dt) 应用运动方程：x += vx * dt，vy += -gravity * dt，y += vy * dt。这一简单运动学模拟同时强化了牛顿物理和软件设计模式。

Tasks often require detecting when the projectile hits the ground (y <= 0). This demands conditional logic and possibly event-driven messaging. Students must also consider numerical stability: a dt that is too large causes inaccurate trajectories, while a very small dt consumes more CPU time. The choice of step size links directly to computational physics considerations.

任务常常要求检测弹丸何时着地（y <= 0）。这需要条件逻辑，也可能需要事件驱动消息。学生还必须考虑数值稳定性：过大的 dt 会导致不准确的轨迹，而过小的 dt 消耗更多 CPU 时间。步长的选择直接关联到计算物理的考量。

Expanding to include air resistance introduces a drag force proportional to velocity squared. The resulting differential equation cannot be solved analytically, so numerical integration (Euler method) is used. This illustrates how computer simulation solves complex physical problems, which WJEC Unit 4 may link to accuracy and limitations of such numerical models.

扩展到包含空气阻力会引入与速度平方成正比的阻力。产生的微分方程无法解析求解，于是采用数值积分（欧拉方法）。这展示了计算机模拟如何解决复杂物理问题，WJEC 单元4可能将此与这类数值模型的准确性和局限性相联系。

3. Computational Biology: DNA Sequence Analysis and Dynamic Programming | 计算生物学：DNA 序列分析与动态规划

Bioinformatics combines computer science with biology. A typical WJEC interdisciplinary problem supplies two DNA strings and asks for the longest common subsequence (LCS). The LCS algorithm uses dynamic programming to fill a 2D table: if characters match, DP[i][j] = DP[i-1][j-1] + 1; else DP[i][j] = max(DP[i-1][j], DP[i][j-1]). This exercise tests nested loops, array indexing, and backtracking.

生物信息学结合了计算机科学与生物学。典型的 WJEC 跨学科问题给出两条 DNA 字符串，要求找出最长公共子序列（LCS）。LCS 算法使用动态规划填充二维表格：若字符匹配，DP[i][j] = DP[i-1][j-1] + 1；否则 DP[i][j] = max(DP[i-1][j], DP[i][j-1])。该练习考查嵌套循环、数组索引和回溯。

The biological interpretation is that identical LCS regions may indicate evolutionary relatedness. From a computational standpoint, the DP table dimensions yield O(mn) time and space, which becomes impractical for whole genomes. This naturally leads to discussing heuristic methods or space optimisation, linking algorithmic efficiency to realistic bioinformatics constraints.

生物学解释是，相同的 LCS 区域可能暗示进化关联。从计算角度看，DP 表维度产生 O(mn) 时间和空间，对于全基因组而言变得不切实际。这自然引向讨论启发式方法或空间优化，将算法效率与现实的生物信息学限制联系起来。

Variants include the edit distance (Levenshtein distance) with substitution, insertion, and deletion costs. This algorithm is used in spell checkers and genetic mutation studies, directly tying string manipulation to everyday software tools and research. Understanding the recurrence provides a foundation for advanced pattern matching topics.

变体包括具有替换、插入和删除代价的编辑距离（莱文斯坦距离）。该算法用于

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

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