📚 Interdisciplinary Integrated Question Practice for Year 11 WJEC Computer Science | WJEC Year 11 计算机：跨学科综合题型训练
In the WJEC GCSE Computer Science specification, you are often asked to apply computing concepts in unfamiliar contexts that link to other subjects. Interdisciplinary questions test your ability to transfer skills from mathematics, science, geography, design, and ethics into algorithmic thinking, data analysis, and system design. This article provides targeted integrated question training, showing how computer science interacts with real-world disciplines and preparing you for the style of synoptic questions on your exams.
在WJEC GCSE计算机科学课程中，你经常需要在与其他学科相联系的陌生情境中应用计算概念。跨学科题目考查你将数学、科学、地理、设计和伦理等学科的技能转化为算法思维、数据分析和系统设计的能力。本文提供了有针对性的综合题型训练，展示计算机科学如何与现实世界学科交互，帮助你为考试中的综合性题目做好准备。
1. Introduction to Interdisciplinary Questions | 跨学科题目导论
WJEC exam papers often include scenario-based questions that require you to draw on knowledge from other fields. A problem might describe a scientific experiment, a geographic information system, or a retail database, and then ask you to write pseudocode, design a table, or evaluate ethical concerns. Recognising the cross-curricular link is the first step; the second is isolating the computer science behind it.
WJEC试卷经常包含基于情境的题目，要求你借用其他领域的知识。问题可能描述科学实验、地理信息系统或零售数据库，然后要求你编写伪代码、设计数据表或评估伦理问题。识别跨学科联系是第一步，第二步是剥离出背后的计算机科学原理。
A strong answer demonstrates computational thinking within the given context. For example, when asked to model acceleration due to gravity, you must apply iteration and variables rather than just recalling the physics formula. The following sections walk through sample interdisciplinary problems with detailed solutions, showing how to bridge subjects while staying focused on computing assessment objectives.
一个有力的回答要在给定情境中展示计算思维。例如，当要求模拟重力加速度时，你必须运用迭代和变量，而不仅仅是回忆物理公式。以下各节将通过典型的跨学科例题和详细解析，展示如何在紧扣计算机评价目标的同时架起学科之间的桥梁。
2. Algorithms & Mathematical Thinking | 算法与数学思维
Many WJEC algorithm questions are rooted in mathematical ideas such as sequences, series, and statistics. You might be asked to write pseudocode to calculate a moving average, detect outliers, or find the greatest common divisor. These problems test your ability to translate a mathematical procedure into precise, step-by-step instructions.
许多WJEC算法题目都植根于数学思想，如数列、级数和统计。你可能需要编写伪代码来计算移动平均值、检测异常值或求最大公约数。这些问题考查你将数学过程转化为精确的、一步步执行的指令的能力。
Sample question: A weather station records the temperature every minute in an array temps. Write pseudocode to find the maximum temperature and the sum of all temperatures. Then extend your algorithm to flag any minute where the temperature change exceeds 10°C compared with the previous minute, as this may indicate a sensor fault. Use mathematical operators to express your conditions.
例题：一个气象站每分钟记录一条温度值，存储在数组 temps 中。编写伪代码找出最高温度以及所有温度的总和。然后扩展你的算法，当某一分钟的温度与前一分钟相比变化超过10°C时进行标记，因为这可能表示传感器故障。使用数学运算符表达你的条件。
Solution approach – English: First, initialise maxTemp to a very low value and sum to 0. Use a loop to traverse the array. For each temperature, update maxTemp if the current value is greater, and add the value to sum. For outlier detection, start from the second element and compute the absolute difference between temps[i] and temps[i-1]. If the difference exceeds 10, output a warning. In pseudocode:
解题思路 – 中文：首先，将 maxTemp 初始化为一个很小的值，sum 初始化为0。使用循环遍历数组。对于每个温度，如果当前值更大则更新 maxTemp，并将该值加到 sum 中。对于异常检测，从第二个元素开始，计算 temps[i] 与 temps[i-1] 的绝对差值。如果差值超过10，则输出警告。伪代码如下：
maxTemp ← -∞
sum ← 0
FOR i ← 0 TO LEN(temps)-1
IF temps[i] > maxTemp THEN maxTemp ← temps[i]
sum ← sum + temps[i]
ENDFOR
FOR i ← 1 TO LEN(temps)-1
IF ABS(temps[i] - temps[i-1]) > 10 THEN
OUTPUT "Spike at minute", i, "value", temps[i]
ENDIF
ENDFOR
The same logic applies when processing data from science experiments or financial modelling. Mathematics provides the rules, and algorithms make them executable.
相同的逻辑也适用于处理科学实验或金融建模中的数据。数学提供规则，而算法使其可执行。
3. Data Representation & Electronics | 数据表示与电子学
Binary addition, logical operations, and half-adders sit right at the intersection of computer science and physics/electronics. Designing a circuit that adds bits involves Boolean algebra, which can be expressed with logic gates and truth tables.
二进制加法、逻辑运算和半加器正好处于计算机科学与物理/电子学的交叉点。设计一个实现比特相加的电路需要布尔代数，可以用逻辑门和真值表来表达。
Sample question: Construct a half-adder circuit using AND, OR, and NOT gates. Explain how the circuit produces the Sum and Carry outputs. Write the Boolean expressions for Sum and Carry, and show the truth table.
例题：使用与、或、非门构建一个半加器电路。解释电路如何产生 Sum 和 Carry 输出。写出 Sum 和 Carry 的布尔表达式，并展示真值表。
English explanation: ut is A AND B. Using a circuit diagram in your mind: Connect A and B to an XOR arrangement (two NOT gates, two AND gates, one OR) for Sum; connect A and B to an AND gate for Carry. The truth table has four rows: 0+0→Sum 0 Carry 0; 0+1→Sum 1 Carry 0; 1+0→Sum 1 Carry 0; 1+1→Sum 0 Carry 1. This directly links to transistor-level electronics in the physical world.
中文解释：半加器将两个单比特输入 A 和 B 相加。Sum 输出是 A 与 B 的异或，可表示为 (A AND NOT B) OR (NOT A AND B)。Carry 输出是 A AND B。在脑中构建电路图：将 A 和 B 连接到一个异或结构（两个非门、两个与门、一个或门）得到 Sum；将 A 和 B 连接到一个与门得到 Carry。真值表有四种情况：0+0→Sum 0 Carry 0；0+1→Sum 1 Carry 0；1+0→Sum 1 Carry 0；1+1→Sum 0 Carry 1。这直接与物理世界中的晶体管级电子线路相联系。
Sum = (A ∧ ¬B) ∨ (¬A ∧ B) Carry = A ∧ B
When exam questions embed adders inside larger systems like a scientific calculator, recognising the underlying Boolean logic saves time.
当考题将加法器嵌入科学计算器等更大的系统中时，识别底层的布尔逻辑可以节省时间。
4. Sorting Algorithms & Statistics | 排序算法与统计学
Sorting is fundamental to preparing data for statistical analysis. Whether you need to find the median test score or order experimental results, sorting algorithms like bubble sort or merge sort appear frequently in WJEC papers alongside statistical interpretation.
排序是数据准备进行统计分析的基础。无论你需要找到测试分数的中位数还是排列实验结果，冒泡排序或归并排序等排序算法与统计解释一起频繁出现在WJEC试卷中。
Sample question: A teacher stores pupils' test marks as percentages in an array marks. Write pseudocode for a bubble sort to arrange the marks in ascending order. After sorting, calculate the median mark. Explain why bubble sort is O(n2) and how that affects performance if the school had 10,000 students.
例题：教师将学生的测试分数（百分比）存储于数组 marks 中。编写冒泡排序的伪代码，将分数按升序排列。排序后，计算中位分数。解释为什么冒泡排序的时间复杂度是 O(n2)，以及如果学校有10,000名学生，这对性能有何影响。
English walkthrough: Bubble sort compares adjacent items and swaps them if they are in the wrong order, repeating passes through the list. After sorting, if the number of marks n is odd, median is marks[n//2]; if even, it is the average of the two middle values. The complexity O(n2 s means roughly 50 million comparisons, which could be slow. In statistics, large datasets demand more efficient algorithms like quicksort for timely processing.
中文讲解：冒泡排序比较相邻元素，若顺序错误则交换，重复遍历列表。排序后，若分数个数 n 是奇数，中位数就是 marks[n//2]；若是偶数，则是中间两个值的平均值。复杂度 O(n2) 是因为在最坏情况下，n 个元素中的每一个都要与几乎每一个其他元素比较。当 n = 10,000 时，这大约是五千万次比较，可能会很慢。在统计学中，大型数据集需要像快速排序这样更高效的算法才能及时处理。
FOR i ← 0 TO n-2
FOR j ← 0 TO n-2-i
IF marks[j] > marks[j+1] THEN
SWAP marks[j], marks[j+1]
ENDIF
ENDFOR
ENDFOR
This type of question merges algorithmic efficiency with practical statistical meaning – a key WJEC combination.
这类题目将算法效率与实际的统计意义融合在一起，是WJEC的关键组合。
5. Networking & Geography | 网络与地理
Computer networks span physical spaces, and designing a cost-effective topology often relies on geographic data. Problems about laying undersea cables, connecting cities, or locating data centres ask you to apply graph theory, which doubles as geographic optimisation.
计算机网络跨越物理空间，设计高性价比的拓扑结构常依赖于地理数据。关于铺设海底光缆、连接城市或定位数据中心的问题，需要你运用图论，这也正是地理优化的范畴。
Sample question: Five cities have the following straight-line distances between them (in km): A-B 120, A-C 200, B-C 90, B-D 150, C-D 100, C-E 180, D-E 110. Sketch a graph and use a minimum spanning tree algorithm (e.g., Prim's) to find the least total cable length needed to connect all cities. Explain how a greedy algorithm makes local optimum choices.
例题：五个城市之间的直线距离（公里）如下：A-B 120, A-C 200, B-C 90, B-D 150, C-D 100, C-E 180, D-E 110。画出图形，并使用最小生成树算法（如 Prim 算法）求出连接所有城市所需的最短总缆线长度。解释贪心算法如何做出局部最优选择。
English solution: Apply Prim' rom {A,B,C}, choose C-D (100); then from {A,B,C,D} choose D-E (110). Total cable = 120+90+100+110 = 420 km. This is a classic optimisation problem in geography (transport planning) solved elegantly by a computer science greedy algorithm. The algorithm makes the best immediate choice without looking ahead, which works for this problem because of the matroid property of minimum spanning trees.
中文解答：从任一节点开始应用 Prim 算法，例如从 A 出发。选择与 A 相连的最小边：A-B (120)。已访问集合为 {A,B}，最小边是 B-C (90)。接下来从 {A,B,C} 选择 C-D (100)；然后从 {A,B,C,D} 选择 D-E (110)。总缆线 = 120+90+100+110 = 420 公里。这是地理学（交通规划）中的经典优化问题，通过计算机科学的贪心算法巧妙地解决。该算法在每一个步骤都做出眼前最好的选择而不向前看，由于最小生成树具有拟阵性质，在这个问题上这种做法是有效的。
Always expect WJEC to contextualise graph algorithms in real-world geography, requiring you to interpret maps and distance tables.
WJEC考题总是期望你将图算法置于真实地理情境中，要求你解释地图和距离表。
6. Cybersecurity & Psychology | 网络安全与心理学
Social engineering attacks exploit human psychology rather than technical vulnerabilities. Phishing emails often use authority, scarcity, or urgency to trick users. Understanding these psychological triggers helps in designing secure systems and recognising threats – a cross-curricular area with flavour of social sciences.
社会工程攻击利用的是人类心理而不是技术漏洞。钓鱼邮件经常使用权威、稀缺性或紧迫感来欺骗用户。理解这些心理触发因素有助于设计安全系统和识别威胁，这是一个带有人文社会科学色彩的跨学科领域。
Sample question: Read the following email excerpt: "Dear customer, your account will be suspended within 24 hours unless you verify your password immediately. Click here: http://secure-bank.verify.tk". Identify three social engineering techniques used, explain why the link is suspicious, and suggest two technical measures a bank could implement to prevent such attacks.
例题：阅读以下电子邮件摘录：“尊敬的客户，您的账户将在24小时内被暂停，除非您立即验证密码。请点击此处：http://secure-bank.verify.tk”。识别其中使用的三种社会工程技术，解释该链接为何可疑，并提出银行可采取的两项技术措施来防范此类攻击。
English analysis: Techniques: 1) Urgency – threat of account suspension within 24 hours creates panic. 2) Authority – pretending to be the bank (the 'secure' label). 3) Familiarity – using 'Dear customer' to mimic genuine communication. The link is suspicious because the domain is not the bank's official domain; 'secure-bank.verify.tk' is a free domain, likely registered by an attacker. Technical measures: enforce multi-factor authentication so that even if the password is stolen, access is blocked; implement an email authentication system such as SPF/DKIM/DMARC to filter phishing attempts. Psychology teaches us that fear and time pressure override logical thinking; cybersecurity must counteract that through both user education and technical controls.
中文分析：技术手法：1) 紧迫感——威胁24小时内暂停账户制造恐慌。2) 权威性——冒充银行（使用“secure”标签）。3) 熟识感——使用“尊敬的客户”模仿真实沟通。链接可疑是因为域名不是银行的官方域名；“secure-bank.verify.tk”是一个免费域名，很可能由攻击者注册。技术措施：实施多因素认证，这样即使密码被盗也无法访问；实施诸如 SPF/DKIM/DMARC 的邮件认证系统来过滤钓鱼尝试。心理学告诉我们，恐惧和时间压力会压制逻辑思考；网络安全必须通过用户教育和技术控制双管齐下来应对。
7. Databases & Biology | 数据库与生物学
Bioinformatics databases store genetic sequences, species data, and phenotype information. Writing SQL queries against such databases requires understanding of biological entities as well as relational design, making it a rich interdisciplinary exercise.
生物信息学数据库存储基因序列、物种数据和表型信息。针对此类数据库编写 SQL 查询需要理解生物学实体以及关系型设计，这使其成为丰富的跨学科练习。
Sample question: A table DNA_SEQUENCES has fields: species (text), gene (text), sequence (text of A,T,C,G), length (integer). Write SQL statements to: (a) list all distinct species; (b) find the sequences shorter than 100 bases for the gene 'hemoglobin'; (c) calculate the average length of sequences for 'Homo sapiens'. Explain how an index on the species field could improve performance when the database contains millions of records.
例题：表 DNA_SEQUENCES 包含字段：species（文本）、gene（文本）、sequence（由 A、T、C、G 组成的文本）、length（整数）。编写 SQL 语句实现：(a) 列出所有不重复的物种；(b) 找出基因 'hemoglobin' 中长度小于100个碱基的序列；(c) 计算 'Homo sapiens' 所有序列的平均长度。解释当数据库包含数百万条记录时，对 species 字段建立索引如何改善性能。
English SQL solutions:
中文SQL解答：
-- (a)
SELECT DISTINCT species FROM DNA_SEQUENCES;
-- (b)
SELECT sequence FROM DNA_SEQUENCES
WHERE gene = 'hemoglobin' AND length < 100;
-- (c)
SELECT AVG(length) FROM DNA_SEQUENCES
WHERE species = 'Homo sapiens';
An index on species allows the DBMS to locate rows without scanning the entire table (full table scan). It creates a sorted structure (like a B-tree) so that queries filtering by species run in logarithmic time, which is crucial for large biological datasets used in genomics research.
对 species 字段建立索引能让数据库管理系统无需扫描整个表（全表扫描）即可定位行。它创建了一种排序结构（如B树），使得按照 species 筛选的查询能以对数时间运行，这对于基因组学研究中使用的大型生物数据集至关重要。
8. Programming & Physics Simulation | 编程与物理模拟
Computational modelling of physical phenomena is a classic WJEC scenario. Using a loop to update position and velocity over time brings together differential equations and iterative programming.
对物理现象的计算建模是WJEC的经典情境。使用循环随时间更新位置和速度，将微分方程与迭代编程结合在一起。
Sample question: metres. Ignoring air resistance, the distance fallen after t seconds is given by s = ½ g t2 with g = 9.8 m/s2. Write a program in pseudocode or Python that outputs the height of the object every 0.5 seconds until it hits the ground. Ensure your loop condition compares height with a small positive value to avoid infinite loops.
例题：一个物体从100米高处落下。忽略空气阻力，下落 t 秒后的距离由 s = ½ g t2 给出，g = 9.8 m/s2。用伪代码或 Python 编写一个程序，每隔0.5秒输出物体的高度，直到它落地。确保循环条件将高度与一个小的正值比较，以避免无限循环。
English solution: The current height is initial height minus distance fallen. The loop updates time by 0.5 s each iteration. Condition: while height > 0. Use a small threshold like 0.01 if necessary. Pseudocode:
中文解答：当前高度等于初始高度减去下落距离。循环每次迭代将时间增加0.5秒。条件：当 height > 0 时继续。如果需要，使用一个如0.01的小阈值。伪代码如下：
g ← 9.8
initialHeight ← 100
t ← 0
REPEAT
distance ← 0.5 * g * t * t
height ← initialHeight - distance
IF height < 0 THEN height ← 0
OUTPUT "At t=", t, "s, height=", height, "m"
t ← t + 0.5
UNTIL height <= 0
This problem blends physics equations with algorithm design. Always initialise variables clearly and think about the termination condition from both computational and physical perspectives.
这个题目融合了物理方程和算法设计。始终清晰地初始化变量，并从计算和物理两个角度思考终止条件。
9. Ethical & Legal Issues & Social Studies | 伦理法律问题与社会学
Data protection laws like the GDPR (General Data Protection Regulation) have profound effects on the design of information systems. WJEC often requires you to evaluate the impact of technology on society, drawing from legal studies and sociology.
像《通用数据保护条例》(GDPR) 这样的数据保护法律对信息系统的设计产生了深远影响。WJEC经常要求你评估技术对社会的影响，这需要借鉴法学和社会学的知识。
Sample question: You are designing a database for a health research project that stores patients' age, postcode, and medical condition. Explain how the principles of data minimisation and purpose limitation from GDPR would affect your table design. Suggest at least two fields you should avoid storing directly and explain why. Discuss one potential ethical dilemma if the data were shared with insurance companies.
例题：你正在为一个存储患者年龄、邮政编码和医疗状况的医学研究项目设计数据库。解释 GDPR 中的数据最小化原则和目的限定原则将如何影响你的表设计。提出至少两个你应该避免直接存储的字段并解释原因。讨论如果这些数据与保险公司共享可能会引发的一个潜在伦理问题。
English answer: Data minimisation means you should only collect data that
Published by TutorHao | Year 11 Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图