Multidisciplinary Integrated Question Training for AS Eduqas Computer Science | AS Eduqas 计算机：跨学科综合题型训练

📚 Multidisciplinary Integrated Question Training for AS Eduqas Computer Science | AS Eduqas 计算机：跨学科综合题型训练

Modern computer science does not exist in isolation. The AS Eduqas specification encourages students to apply computational thinking across a range of disciplines, from mathematics and physics to biology and economics. This article provides a set of integrated question exercises that combine core programming, data structures, algorithms, and theory with real-world cross-curricular scenarios. By practising these, you will strengthen your ability to transfer skills and deepen your understanding of both computing and the connected subject areas.

现代计算机科学并非孤立存在。AS Eduqas 考试大纲鼓励学生将计算思维应用于数学、物理、生物、经济学等多个学科。本文提供一组跨学科综合训练题，将核心编程、数据结构、算法和理论知识与现实世界的跨课程场景相结合。通过练习，你将增强知识迁移能力，加深对计算机科学及相关学科的理解。

1. Algorithmic Thinking in Mathematics | 数学中的算法思维

Mathematics and computer science share a common foundation in logic and problem-solving. A typical AS question might ask you to design an algorithm to compute the greatest common divisor (GCD) or generate prime numbers using the Sieve of Eratosthenes.

数学与计算机科学在逻辑和问题解决方面有着共同基础。典型的 AS 题目可能要求设计一个算法来计算最大公约数（GCD），或使用埃拉托斯特尼筛法生成素数。

For example, implement the Euclidean algorithm using iteration and recursion, then analyse its time complexity. Consider how the algorithm would be modified to handle very large integers, as used in cryptography.

例如，使用迭代和递归实现欧几里得算法，并分析其时间复杂度。思考如何在密码学中处理超大整数时修改该算法。

Write pseudocode for both iterative and recursive GCD. Explain why the recursive version might cause stack overflow for extreme inputs.
编写迭代和递归 GCD 的伪代码。解释为何递归版本在极端输入下可能导致栈溢出。
Use a trace table to demonstrate the algorithm for GCD(270, 192).
使用跟踪表演示计算 GCD(270, 192) 的过程。

Extend this to the extended Euclidean algorithm to find multiplicative inverses modulo n, a concept essential in RSA encryption. This shows how pure number theory becomes a computational tool.

将其扩展为扩展欧几里得算法，求模 n 的乘法逆元，这是 RSA 加密中的关键概念。这展示了纯数论如何成为计算工具。

2. Computational Modelling in Physics | 物理模拟中的计算建模

Physics problems often require simulating motion, forces, or wave propagation. In AS Computer Science, you may be given a scenario like modelling a projectile under gravity, taking air resistance into account using numerical methods.

物理问题常常需要模拟运动、力或波的传播。在 AS 计算机科学中，你可能会遇到如模拟重力作用下的抛射体，并使用数值方法考虑空气阻力。

Consider a cannonball fired with initial velocity u at an angle θ. Without air resistance, the trajectory is parabolic and can be solved analytically. With air drag proportional to velocity, you need to apply Euler’s method or the Runge-Kutta method to update velocity and position step by step.

考虑一个以初速度 u 和角度 θ 发射的炮弹。没有空气阻力时，轨迹是抛物线，有解析解；当空气阻力与速度成正比时，需要应用欧拉方法或龙格-库塔方法逐步更新速度和位置。

Design a structured flowchart for the simulation loop. Include input, processing, and output stages.
设计仿真循环的结构化流程图，包含输入、处理和输出阶段。
Write a Python program that uses a time step Δt = 0.01 s and saves coordinates into a 2D array. Explain how the choice of Δt affects accuracy and performance.
编写一个 Python 程序，使用时间步长 Δt = 0.01 s，将坐标保存到二维数组中。解释 Δt 的选择如何影响准确性和性能。

Such exercises develop your ability to translate physical laws into algorithmic steps, a key skill in scientific computing.

这类练习训练你将物理定律转化为算法步骤的能力，这是科学计算中的关键技能。

3. Bioinformatics and Sequence Alignment | 生物信息学与序列比对

Bioinformatics applies algorithms to analyse DNA, RNA, and protein sequences. A typical cross-disciplinary problem involves finding the longest common subsequence (LCS) between two DNA strands, which helps identify evolutionary relationships.

生物信息学运用算法分析 DNA、RNA 和蛋白质序列。典型的跨学科问题涉及寻找两条 DNA 链的最长公共子序列（LCS），这有助于识别进化关系。

The LCS problem is a classic dynamic programming challenge. For sequences S1 = “AGGTAB” and S2 = “GXTXAYB”, the LCS is “GTAB”. You need to construct a 2D table and fill it using the recurrence: if characters match, cell[i][j] = cell[i-1][j-1] + 1; else max(cell[i-1][j], cell[i][j-1]).

LCS 问题是经典的动态规划挑战。对于序列 S1 = “AGGTAB” 和 S2 = “GXTXAYB”，LCS 是 “GTAB”。你需要构造一个二维表并用递推填表：若字符匹配，cell[i][j] = cell[i-1][j-1] + 1；否则取 max(cell[i-1][j], cell[i][j-1])。

Dry-run the dynamic programming table for the given sequences. Show the traceback arrows to recover the actual subsequence.
对给定序列进行动态规划表的推演，展示回溯箭头以恢复实际子序列。
Discuss the time and space complexity (O(mn)). How could you reduce memory usage if only the length of LCS is required?
讨论时间和空间复杂度（O(mn)）。如果只需要 LCS 长度，如何降低内存占用？

This illustrates how computing solves biological puzzles and highlights optimisation trade-offs in algorithm design.

这展示了计算机如何解决生物学难题，并凸显算法设计中优化权衡。

4. Game Theory and Search Algorithms in Economics | 经济学中的博弈论与搜索算法

Economics employs game theory to model strategic interactions. Computer science contributes by implementing minimax and alpha-beta pruning in decision trees for zero-sum games like the prisoner’s dilemma repeated over multiple rounds.

经济学运用博弈论建模策略互动。计算机科学通过在决策树中实现极小极大和α-β剪枝，用于重复多轮的囚徒困境等零和博弈。

You might be asked to write a program that plays a repeated prisoner’s dilemma using strategies such as tit-for-tat. Use a payoff matrix: if both cooperate, each gains 3; if both defect, each gains 1; if one defects and the other cooperates, the defector gains 5 and the cooperator gains 0.

你可能会被要求编写一个程序，使用以牙还牙等策略进行重复囚徒困境博弈。收益矩阵为：若双方合作，各得 3；双方背叛，各得 1；一方背叛另一方合作，背叛者得 5，合作者得 0。

Implement a finite state machine representing the tit-for-tat strategy. Show the state transition diagram.
实现一个代表以牙还牙策略的有限状态机，展示状态转换图。
Use an array to store the history of moves. Explain how the opponent’s past actions influence the next decision.
使用数组存储动作历史，解释对手过去的行动如何影响下一步决策。

These tasks link algorithmic design with economic reasoning, promoting understanding of agent-based modelling.

这些任务将算法设计与经济推理相连，促进对基于主体建模的理解。

5. Data Representation and Statistics | 数据表示与统计学

Handling large datasets is a core competency. In AS Eduqas, questions often involve reading data from files, representing it in appropriate structures, and performing statistical calculations such as mean, median, standard deviation, and frequency distributions.

处理大规模数据集是一项核心能力。AS Eduqas 题目常涉及从文件读取数据，用合适结构表示，并进行统计计算，如均值、中位数、标准差和频率分布。

For example, a CSV file contains daily temperatures from multiple weather stations. You need to design a record structure, store the data in a hash table keyed by station ID, then compute the 7-day moving average to detect climate anomalies.

例如，一个 CSV 文件包含多个气象站的每日温度。你需要设计记录结构，将数据存储在按站 ID 索引的哈希表中，然后计算 7 天移动平均以检测气候异常。

Explain why a hash table with open addressing might be suitable. Write a procedure to insert or update a temperature reading.
解释为何使用开放寻址的哈希表可能合适。编写一个过程来插入或更新温度读数。
Use a circular queue to implement the moving average with O(1) update per new reading. Provide a step-by-step demonstration.
使用循环队列实现移动平均，每次新读数更新为 O(1)。逐步演示。

This integrates data structures with statistical analysis, demonstrating how efficient algorithms enable real-time data science.

这结合了数据结构与统计分析，展示了高效算法如何支撑实时数据科学。

6. Cryptography and Network Security | 密码学与网络安全

Secure communication relies on mathematical transformations and computational techniques. A typical integrated question covers the Caesar cipher, Vigenère cipher, and then extends to modern symmetric encryption like AES, discussing key exchange problems.

安全通信依赖于数学变换和计算技术。典型的综合题涵盖凯撒密码、维吉尼亚密码，然后延伸到现代对称加密如 AES，并讨论密钥交换问题。

You may be asked to encrypt and decrypt using a simple XOR cipher with a repeating key. Show how the same operation decrypts, and why this is vulnerable if the key is shorter than the plaintext.

你可能会被要求使用重复密钥的简单异或密码进行加解密。展示为何相同操作可以解密，以及如果密钥短于明文为何容易受到攻击。

Write a function that takes a plaintext string and a key string, returning the ciphertext as hexadecimal. Include a trace for ‘HELLO’ with key ‘KEY’.
编写一个函数，接受明文字符串和密钥字符串，返回十六进制密文。包含对 ‘HELLO’ 和密钥 ‘KEY’ 的跟踪。
Explain the concept of perfect secrecy and why the one-time pad achieves it. Discuss practical limitations.
解释完美保密的概念以及为何一次性密码本能实现它。讨论实际限制。

This highlights the intersection of computational logic, modular arithmetic, and security principles.

这突出了计算逻辑、模运算和安全原理的交集。

7. Image Processing and Computer Graphics | 图像处理与计算机图形学

Digital images are stored as arrays of pixels. Manipulating these arrays provides rich cross-curricular links with art and media studies. An AS question might involve applying a convolution filter to blur, sharpen, or detect edges in a grayscale image represented as a 2D list.

数字图像以像素数组存储。操作这些数组提供了与艺术和媒体研究丰富的跨课程联系。AS 问题可能涉及在表示为二维列表的灰度图像上应用卷积滤波器进行模糊、锐化或边缘检测。

Implement a 3×3 Gaussian blur filter. The filter kernel is a matrix of weights: [[1,2,1],[2,4,2],[1,2,1]] divided by 16. You need to handle boundary pixels (e.g., by replicating edge pixels or using zero padding).

实现一个 3×3 高斯模糊滤波器。滤波核是权重矩阵：[[1,2,1],[2,4,2],[1,2,1]] 除以 16。需要处理边界像素（例如复制边缘像素或零填充）。

Write a nested loop to apply the filter. Discuss the time complexity relative to image dimensions.
编写嵌套循环应用滤波器，讨论相对于图像尺寸的时间复杂度。
Compare the effects of different padding strategies on the output image quality.
比较不同填充策略对输出图像质量的影响。

This exercise consolidates 2D array manipulation and algorithmic efficiency, key syllabus topics.

此练习巩固了二维数组操作和算法效率，这是教学大纲的重点。

8. Natural Language Processing and Linguistics | 自然语言处理与语言学

NLP combines computer science with linguistics. A problem might require building a simple bigram model to predict the next word based on the previous one, using a dictionary of transition counts derived from a text corpus.

NLP 结合了计算机科学与语言学。一道题目可能要求构建一个简单的二元语法模型，基于前一个词预测下一个词，使用从文本语料库导出的转移计数字典。

Given a sentence “the cat sat on the mat”, compute the bigram probabilities: P(cat|the), P(sat|cat), etc. Handle unseen bigrams with Laplace smoothing (add-one).

给定句子 “the cat sat on the mat”，计算二元语法概率：P(cat|the)、P(sat|cat) 等。用拉普拉斯平滑（加一）处理未见过的二元组。

Design a data structure (nested dictionary) to store counts. Show how to update it while parsing text.
设计一个数据结构（嵌套字典）来存储计数。展示解析文本时如何更新。
Write pseudocode to generate a random sentence of length 10 using the bigram model. Explain the role of a seed word.
编写伪代码使用二元模型生成长度为 10 的随机句子。解释种子词的作用。

This exercise reinforces probabilistic reasoning and efficient use of dictionaries.

此练习强化了概率推理和字典的高效使用。

9. Optimisation and Operations Research | 优化问题与运筹学

Businesses need to optimise routes, resource allocation, and scheduling – classic operations research problems. Computer science provides algorithms like Dijkstra’s shortest path, the knapsack problem, and greedy scheduling.

企业需要优化路径、资源分配和调度——这些都是经典的运筹学问题。计算机科学提供了迪杰斯特拉最短路径、背包问题和贪心调度等算法。

Consider a delivery drone that must visit 5 locations and return to base, minimising total distance. This is the travelling salesman problem (TSP). For small n, exhaustive search is feasible. Implement a recursive function that generates all permutations and finds the minimum total distance.

考虑一架送货无人机必须访问 5 个地点后返回基地，最小化总距离。这是旅行商问题 (TSP)。对于小 n，穷举搜索是可行的。实现一个递归函数生成所有排列并找出最小总距离。

Provide the permutation generation algorithm and trace for 4 cities. Calculate the number of permutations and relate to factorial time complexity.
提供排列生成算法，并对 4 个城市进行追踪。计算排列数并将其与阶乘时间复杂度相关联。
Discuss how a heuristic like nearest neighbour can find an approximate solution faster. Compare the trade-off between optimality and speed.
讨论最近邻等启发式方法如何更快找到近似解。比较最优性与速度之间的权衡。

This links computational complexity with practical decision-making in business contexts.

这将计算复杂性与商业环境中的实际决策联系起来。

10. Strategies for Answering Multidisciplinary Questions | 综合题型解题策略

Success in integrated questions requires a methodological approach. First, identify the core computing topic (e.g., arrays, recursion, searching) and the external domain knowledge (e.g., physics formula, genetic code). Break the problem into sub-tasks and allocate time accordingly.

成功应对综合题需要一套方法论。首先，确定核心计算机主题（如数组、递归、搜索）和外部领域知识（如物理公式、遗传密码）。将问题分解为子任务并相应分配时间。

Always link your solution back to the syllabus. Show clear algorithmic thinking: define inputs, outputs, processes, and test cases. Use standard conventions for pseudocode, flowcharts, or Python, as specified. When evaluating, discuss both correctness and efficiency.

始终将解答与大纲联系起来。展示清晰的计算思维：定义输入、输出、过程和测试用例。按题目要求使用标准约定的伪代码、流程图或 Python。进行评估时，讨论正确性和效率。

Practise past papers involving cross-curricular contexts. Annotate where biology or economics knowledge is needed.
练习涉及跨课程背景的历年真题。标注需要生物学或经济学知识的地方。
Create your own integrated problems by modifying textbook algorithms with extra constraints inspired by other subjects.
通过修改课本算法并添加其他学科启发的额外约束，创建自己的综合问题。

The ability to seamlessly combine disciplines will set you apart in the AS examination and beyond.

无缝结合各学科的能力将使你在 AS 考试及以后脱颖而出。

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

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

Multidisciplinary Integrated Question Training for AS Eduqas Computer Science | AS Eduqas 计算机：跨学科综合题型训练