Year 11 Edexcel Computer Science: Interdisciplinary Integrated Question Training | 爱德思11年级计算机科学：跨学科综合题型训练

📚 Year 11 Edexcel Computer Science: Interdisciplinary Integrated Question Training | 爱德思11年级计算机科学：跨学科综合题型训练

Welcome to this intensive interdisciplinary revision guide. It blends core Edexcel Year 11 Computer Science topics with concepts from mathematics, physics, geography and beyond, equipping you with the problem-solving versatility required for high marks on cross-topic exam questions.

欢迎使用这本强化的跨学科复习指南。它将爱德思11年级计算机科学的核心主题与数学、物理、地理等学科概念相融合，帮助你培养应对综合性考题所需的多样化解题能力，从而在考试中获得高分。

---

1. Binary Arithmetic and Electrical Circuits | 二进制运算与电子电路

Binary addition mirrors the way adder circuits work inside a processor. A half adder uses an XOR gate for the sum bit and an AND gate for the carry bit, exactly mirroring the rules 0+0=0, 0+1=1, 1+0=1 and 1+1=0 carry 1. Understanding this link helps you predict the behaviour of simple digital circuits composed of transistors acting as switches.

二进制加法与处理器内部加法器电路的工作方式完全对应。半加器使用异或门产生和位，使用与门产生进位位，精确反映了0+0=0、0+1=1、1+0=1以及1+1=0进位1的规则。理解这种联系有助于预测由晶体管作为开关组成的简单数字电路的行为。

Example question: Add the unsigned 8-bit binary numbers 01101101₂ (109) and 01011010₂ (90) as a processor would, showing the carries. Then explain why the resulting 8-bit value might be interpreted as -57 in two’s complement and how this links to overflow in electrical arithmetic logic units.

例题：按处理器的方式将无符号8位二进制数 01101101₂ (109) 和 01011010₂ (90) 相加，显示进位过程。然后解释为什么得到的8位结果在二进制补码中可能被解释为 -57，以及这与电子算术逻辑单元中的溢出有何关联。

Solution stepwise: Write the numbers vertically. Add column by column: bit 0: 1+0=1, no carry. Bit 1: 0+1=1, no carry. Bit 2: 1+0=1, no carry. Bit 3: 1+1=0 carry 1. Bit 4: 0+1+carry1=0 carry 1. Bit 5: 1+0+carry1=0 carry 1. Bit 6: 1+1+carry1=1 carry 1. Bit 7: 0+0+carry1=1. The 8-bit sum is 11000111₂. In unsigned the expected 199 cannot fit in 8 bits, so overflow occurs. The circuit usually sets an overflow flag. In signed two’s complement, 11000111₂ is indeed -57, showing how the same bit pattern carries different meanings depending on interpretation — a crucial distinction in processor status registers.

分步解答：将两数竖直排列。逐列相加：位0: 1+0=1，无进位。位1: 0+1=1，无进位。位2: 1+0=1，无进位。位3: 1+1=0 进位1。位4: 0+1+进位1=0 进位1。位5: 1+0+进位1=0 进位1。位6: 1+1+进位1=1 进位1。位7: 0+0+进位1=1。8位和为11000111₂。在无符号解释中，期望的199无法用8位表示，因此发生溢出，电路通常置溢出标志。在有符号二进制补码中，11000111₂确实等于-57，这表明相同的位模式在不同解释下具有不同含义——这是处理器状态寄存器中一个至关重要的区别。

---

2. Logic Gates and Boolean Algebra in Digital Electronics | 逻辑门与数字电子学中的布尔代数

Logic gates are the building blocks of digital systems and follow Boolean algebra rules you study in mathematics. A burglar alarm that triggers when a door sensor (D) OR a motion sensor (M) detects an intrusion can be expressed as Q = D OR M. When you add an arming switch (A), the requirement becomes Q = A AND (D OR M). This directly corresponds to a physical circuit that can be reduced using Boolean identities.

逻辑门是数字系统的构建模块，遵循你在数学中学到的布尔代数规则。当门传感器(D)或运动传感器(M)检测到入侵时触发的防盗警报可表示为Q = D OR M。当你增加一个布防开关(A)时，表达式变为Q = A AND (D OR M)。这直接对应一个物理电路，并可使用布尔恒等式进行化简。

Example question: A greenhouse automation system must turn on a fan (F) when the temperature exceeds 30°C (T) AND the humidity is high (H), OR whenever a manual override switch (S) is on. Write the Boolean expression, draw the logic gate diagram, and show with a truth table that the circuit matches the expression S OR (T AND H). Then use a Boolean law to prove that the expression does not change if we write (S OR T) AND (S OR H).

例题：温室自动化系统需要在温度超过30°C(T)且湿度高(H)，或手动超控开关(S)开启时启动风扇(F)。写出布尔表达式，画出逻辑门图，并用真值表证明该电路与表达式 S OR (T AND H) 相符。然后运用布尔定律证明写作 (S OR T) AND (S OR H) 时表达式不变。

Solution: The expression is F = S OR (T AND H). Truth table columns for S,T,H show T AND H, then S OR (T AND H). The result column matches F. The alternative expression (S OR T) AND (S OR H) is the distributive law: S + (T·H) = (S+T)·(S+H). This shows that the same functionality could be implemented with a different arrangement of gates, demonstrating optimisation in digital electronics.

解答：表达式为 F = S OR (T AND H)。真值表列S,T,H，计算T AND H，然后S OR (T AND H)，结果列与F一致。备选表达式 (S OR T) AND (S OR H) 是分配律的应用：S+(T·H) = (S+T)·(S+H)。这表明相同的功能可以用不同的门排列实现，展示了数字电子学中的优化。

---

3. Image Representation and Human Perception | 图像表示与人类感知

Digital images are composed of pixels, each storing a binary value for colour. Colour depth and resolution directly affect file size and perceived quality. From a biology perspective, the human eye’s angular resolution approximates 0.02° and can distinguish about 10 million colours, which relates to the need for 24-bit colour depth. Cross-topic questions may ask you to decide whether a given display resolution exceeds what the eye can resolve at a typical viewing distance.

数字图像由像素构成，每个像素存储颜色的二进制值。颜色深度和分辨率直接影响文件大小和感知质量。从生物学角度看，人眼的角度分辨力约为0.02°，并能区分约1000万种颜色，这与需要24位颜色深度相关。综合性考题可能要求你判断给定的显示分辨率在典型观看距离下是否超过了眼睛的分辨能力。

Example question: A 6-inch smartphone display has a resolution of 2400×1080 pixels. The viewing distance is 30 cm. The smallest object the human eye can resolve is about 0.1 mm at that distance. Calculate the pixel pitch in mm and decide if individual pixels are visible. Also, compute the file size of an uncompressed screenshot with 24-bit colour depth, and suggest whether a 16-bit colour depth could reduce size without noticeable degradation, linking to eye biology.

例题：一部6英寸智能手机屏幕分辨率为2400×1080像素，观看距离30 cm。人眼在该距离可分辨的最小物体约0.1 mm。计算像素间距(mm)，判断是否能分辨单个像素。同时计算24位色深下未压缩截图的文件大小，并说明16位色深是否可以在不引起明显劣化的情况下减小体积，联系眼睛的生物学特性。

Solution: Screen width ≈ 6 inches × (16/√(16²+9²))? Simpler: use diagonal and aspect ratio. Diagonal 6 in = 152.4 mm. Aspect ratio 20:9, width = 152.4 × (20/√(20²+9²)) ≈ 152.4 × (20/21.93) ≈ 139 mm. Horizontal pixels 2400, pixel pitch = 139/2400 ≈ 0.058 mm. This is smaller than 0.1 mm, so pixels are not individually visible. Uncompressed size = 2400×1080×24 bits = 62,208,000 bits = 7.78 MB. 16-bit colour depth would halve the colour palette to 65,536 colours; the eye can distinguish roughly 10 million, so subtle gradients might show banding, but for many images it is acceptable. This illustrates the trade-off studied in multimedia compression.

解答：屏幕宽度 ≈ 6英寸 × (20/√(20²+9²))？更简单：使用对角线和纵横比。对角线6英寸=152.4 mm，纵横比20:9，宽=152.4×(20/√(20²+9²))≈152.4×(20/21.93)≈139 mm。水平2400像素，像素间距=139/2400≈0.058 mm。小于0.1 mm，因此肉眼无法分辨单个像素。未压缩文件大小=2400×1080×24位=62,208,000位=7.78 MB。16位色深将颜色数减至65,536种；人眼可分辨约1000万种颜色，因此平滑渐变可能出现色带，但对许多图像可接受。这说明了多媒体压缩中研究的权衡。

---

4. Sound Sampling and Wave Physics | 声音采样与波动物理学

Sound is an analogue wave described by frequency and amplitude. Sampling converts it into a digital signal by taking measurements at regular intervals. Physics tells us that to reproduce a wave accurately, the sampling rate must be at least twice the highest frequency present (Nyquist theorem). Edexcel questions often integrate calculations of file size = sample rate × bit depth × duration (for mono). Understanding basic wave properties helps you predict the effects of under-sampling.

声音是由频率和振幅描述的模拟波。采样通过固定间隔测量将其转换为数字信号。物理学告诉我们，要准确再现波形，采样率必须至少为所含最高频率的两倍（奈奎斯特定理）。爱德思考题常综合计算文件大小 = 采样率 × 位深度 × 时长（单声道）。理解基本波动特性有助于预测欠采样的影响。

Example question: A scientist records a bat echolocation call containing frequencies up to 80 kHz. Calculate the minimum sample rate needed. If the recording lasts 1.2 seconds and uses 16-bit mono, what is the file size in kilobytes? Explain why using a 44.1 kHz sample rate would introduce aliasing, linking to wave interference.

例题：科学家录制包含最高80 kHz频率的蝙蝠回声定位叫声。计算所需的最低采样率。若录音时长1.2秒，使用16位单声道，文件大小是多少KB？解释为什么使用44.1 kHz采样率会引入混叠，并联系波的干涉。

Solution: Minimum sample rate = 2 × 80 kHz = 160 kHz. File size = 160,000 × 16 × 1.2 = 3,072,000 bits = 384,000 bytes = 375 KB (using 1 KB = 1024 bytes, ≈ 375 KB). With 44.1 kHz, frequencies above 22.05 kHz fold back into the audible range as false tones, causing aliasing distortion. This is analogous to wave interference where high-frequency components superimpose incorrectly on the reconstructed wave, a direct consequence of insufficient sampling points per wave cycle.

解答：最低采样率 = 2×80 kHz = 160 kHz。文件大小 = 160000×16×1.2 = 3,072,000位 = 384,000字节 ≈ 375 KB（按 1 KB=1024字节）。若用44.1 kHz，高于22.05 kHz的频率会作为虚假音调折叠回可听范围，造成混叠失真。这类似于波干涉，高频分量错误地叠加在重建波上，是每个波周期采样点不足的直接后果。

---

5. Network Topologies and Geographic Factors | 网络拓扑与地理因素

Network topology choice (star, mesh, bus) affects latency and fault tolerance, while geographic distance governs transmission delay. A signal in optical fibre travels at about 2×10⁸ m/s. Combining this with your knowledge of network hardware allows you to compute round-trip time (RTT) between cities, and to evaluate whether a topology change can meaningfully reduce delay.

网络拓扑的选择（星型、网状、总线型）影响延迟和容错性，而地理距离决定传输延迟。光纤中的信号以约2×10⁸ m/s的速度传播。将这些与你的网络硬件知识结合起来，可以计算城市间的往返时间（RTT），并评估拓扑变更能否有效减少延迟。

Example question: A company has offices in London and Mumbai, connected via a 7,200 km undersea fibre. A data packet must travel this distance through routers adding 3 µs processing delay each. There are 8 routers in a star configuration at the London end only, and a direct point-to-point trunk. Estimate the minimum one-way delay and discuss whether changing from a star WAN to a mesh topology would significantly reduce delay, considering geography.

例题：一家公司在伦敦和孟买设有办事处，通过一条7200 km海底光缆连接。数据包需经过这段距离，每台路由器增加3 µs处理延迟。在星型拓扑中仅在伦敦端有8个路由器，并有一条直达主干链路。估算最小单向延迟，并讨论考虑到地理因素，将广域网从星型改为网状拓扑是否能显著减少延迟。

Solution: Propagation delay = distance/speed = 7,200,000 m / 2×10⁸ m/s = 0.036 s = 36 ms. Total router delay = 8 × 3 µs = 24 µs ≈ 0.024 ms, negligible. So minimum one-way delay ≈ 36 ms. A mesh topology adds redundant direct paths but cannot shorten the physical cable length, so minimal delay improvement. The primary factor remains geography. This shows that topology mostly impacts reliability and available bandwidth, not the physical speed-of-light limitation.

解答：传播延迟 = 距离/速度 = 7,200,000 m / 2×10⁸ m/s = 0.036 s = 36 ms。路由器延迟总和 = 8×3 µs = 24 µs ≈ 0.024 ms，可忽略不计。因此最小单向延迟约36 ms。网状拓扑增加了冗余直连路径，但无法缩短物理线缆长度，因此延迟改善极微。主要因素仍是地理位置。这表明拓扑主要影响可靠性和可用带宽，而非光速引起的物理限制。

---

6. Algorithm Efficiency and Mathematical Sequences | 算法效率与数学数列

When analysing algorithms, we count how many times key operations execute. This often produces mathematical sequences such as arithmetic progressions or triangular numbers. For example, a nested loop where the inner counter runs from 1 to i in the i-th iteration yields total iterations = 1+2+3+…+n = n(n+1)/2, a triangular number. Recognising these patterns links discrete maths with programming logic.

分析算法时，我们计算关键操作执行的次数。这常常产生等差数列或三角形数等数学数列。例如，一个嵌套循环在第i轮迭代中内层计数器从1运行至i，总迭代次数 = 1+2+3+…+n = n(n+1)/2，即三角形数。识别这些模式将离散数学与编程逻辑联系起来。

Example question: Examine this pseudocode that creates a multiplication table:
FOR i = 1 TO n
  FOR j = 1 TO n
    PRINT i*j
If n=10, how many multiplications and prints occur? Derive a formula in terms of n for total operations, and explain how this relates to the sum of the first n integers squared, linking to arithmetic series. If the inner loop is changed to run while j ≤ i, recalculate the total.

例题：查看以下创建乘法表的伪代码：
FOR i = 1 TO n
  FOR j = 1 TO n
    PRINT i*j
若n=10，发生了多少次乘法和打印？推导出关于n的总操作数公式，并解释其与第一个n个整数和的平方有何关系，联系等差级数。若内层循环改为当j ≤ i时执行，重新计算总数。

Solution: With j from 1 to n, each outer iteration gives n prints and n multiplications, so total = n² prints and n² multiplications. For n=10, that is 100 each. The total operations = 2n². The sum of first n integers is n(n+1)/2, not directly squared here; but if the inner loop runs j ≤ i, then total iterations = n(n+1)/2. So prints = n(n+1)/2, and each includes a multiplication, so total operations = n(n+1). For n=10, that equals 110 instead of 200, demonstrating an efficiency improvement by halving the work.

解答：当j从1到n时，每次外层迭代有n次打印和n次乘法，总计=n²次打印和n²次乘法。n=10时各为100。总操作数=2n²。前n个整数和为n(n+1)/2，此处并非直接平方；但若内层循环改为j≤i，则总迭代次数=n(n+1)/2。因此打印次数=n(n+1)/2，每次含一次乘法，总操作数=n(n+1)。n=10时等于110而非200，通过减半工作量体现了效率提升。

---

7. Cryptography and Historical Mathematics | 密码学与历史数学

Classic ciphers like the Caesar cipher rely on modular arithmetic, a topic you encounter in both mathematics and computer science. Shifting each letter by a fixed key K modulo 26 transforms plaintext to ciphertext. Cryptanalysis often applies frequency analysis, connecting to statistics. Understanding modular arithmetic deepens your ability to write encryption programs and decode messages.

像凯撒密码这样的经典密码依赖于模运算，这是你在数学和计算机科学中都会遇到的课题。通过固定密钥K对26取模，将明文中每个字母移位，得到密文。密码分析常使用频率分析，与统计学相关。理解模运算能加深你编写加密程序和解密消息的能力。

Example question: The word ‘HELLO’ is encrypted using the Caesar cipher with key 5. Show the encryption process using modular arithmetic: (letter position + key) MOD 26. Given the intercepted ciphertext ‘YMJXJFWJNX’, perform frequency analysis to deduce the most likely key, assuming ‘E’ is the most common letter in English. Write a brief algorithm in pseudocode that automates this deduction.

例题：使用密钥5的凯撒密码加密单词’HELLO’。使用模运算展示加密过程：(字母位置 + 密钥) MOD 26。给定截获的密文’YMJXJFWJNX’，执行频率分析推断最可能的密钥，假设’E’是英语中最常见的字母。用伪代码写一个自动完成此推断的简短算法。

Solution: H=7, (7+5) mod 26=12=M. E=4→9=J. L=11→16=Q. L→Q. O=14→19=T, so ‘MJQQT’. In the ciphertext, count letters: J appears 3 times, X twice. The most frequent ciphertext letter is J (position 9). Assume J decrypts to E (4). Then (9 − key) mod 26 = 4 ⇒ key=5. Algorithm: count frequencies, find most frequent letter, compute key = (mostFreqPos − 4) mod 26, output key. This connects historical cryptanalysis with modern string manipulation and modulo arithmetic.

解答：H=7, (7+5) mod 26=12=M。E=4→9=J。L=11→16=Q，L→Q。O=14→19=T，得’MJQQT’。在给定密文中统计字母：J出现3次，X两次。最常见密文字母为J(位置9)。假设J解密为E(4)，则 (9 – 密钥) mod 26 = 4 ⇒ 密钥=5。算法：统计频率，寻找最高频字母，计算密钥=(最高频位置 − 4) mod 26，输出密钥。这将历史上的密码分析与现代字符串处理和模运算联系起来。

---

8. Databases and Statistical Analysis | 数据库与统计分析

Structured Query Language (SQL) is used to retrieve and summarise data in relational databases. The same tasks can be performed in Pandas or pure Python, but SQL’s aggregate functions (AVG, SUM, COUNT) are essentially statistical operations. Combining database queries with computing averages, modes, or detecting outliers builds a bridge between Data Management and Statistics.

结构化查询语言(SQL)用于在关系数据库中检索和汇总数据。相同的任务可以在Pandas或纯Python中完成，但SQL的聚合函数(AVG, SUM, COUNT)本质上是统计操作。将数据库查询与计算平均值、众数或检测异常值相结合，在数据管理和统计学之间架起了一座桥梁。

Example question: A table Results stores student marks: Name VARCHAR, Score INTEGER. Write an SQL query to compute the average score and count the number of entries. Then, without executing it, predict the result set for a dataset of five scores: 45, 78, 92, 67, 88. Explain how outlier thresholds could be computed in a separate query and relate to the statistical concept of interquartile range (IQR).

例题：表 Results 存储学生分数：Name VARCHAR, Score INTEGER。编写一条SQL查询计算平均分和条目数。然后，在不执行的情况下，预测针对五条记录：45, 78, 92, 67, 88 的结果集。解释如何在另一条查询中计算异常值阈值，并联系统计概念四分位距(IQR)。

Solution: SQL: SELECT AVG(Score) AS Average, COUNT(*) AS Count FROM Results; For the data, sum=370, average=74, count=5. To find outliers, you could use PERCENTILE_CONT in some SQL dialects, or compute bounds as Q1-1.5×IQR and Q3+1.5×IQR. First sort: 45,67,78,88,92. Q1=67, Q3=88, IQR=21. Lower bound = 67-31.5=35.5, upper=88+31.5=119.5. No score is outside, so no outliers. This demonstrates how database systems serve as platforms for descriptive statistics.

解答：SQL：SELECT AVG(Score) AS Average, COUNT(*) AS Count FROM Results; 对于给定数据，总和=370，平均=74，计数=5。为寻找异常值，可在某些SQL方言中使用PERCENTILE_CONT，或计算边界 Q1-1.5×IQR 和 Q3+1.5×IQR。先排序：45,67,78,88,92。Q1=67，Q3=88，IQR=21。下界=67-31.5=35.5，上界=88+31.5=119.5。所有分数均未超出，故无异常值。这表明数据库系统可作为描述性统计的平台。

---

9. Programming for Numerical Methods | 编程实现数值方法

Numerical methods such as the bisection method are used to solve equations like f(x)=0 when an algebraic solution is impossible. Implementing these in Python requires looping constructs, conditionals, and tolerance comparisons — all core programming skills. The method itself stems from the mathematical Intermediate Value Theorem, making it a perfect cross-disciplinary exercise.

诸如二分法之类的数值方法用于在没有代数解的情况下求解诸如f(x)=0的方程。用Python实现这类方法需要循环结构、条件语句和容差比较——这些都是核心编程技能。该方法本身源于数学中的介值定理，使其成为绝佳的跨学科练习。

Example question: Write a Python function bisection(f, a, b, tol) that finds the root of f in [a, b] assuming f(a) and f(b) have opposite signs. Use it to find √2 by solving f(x)=x²−2 on [1,2] with tolerance 0.0005. Show the number of iterations needed and relate this to the formula n ≥ log₂((b-a)/tol).

例题：编写一个Python函数 bisection(f, a, b, tol)，在f(a)和f(b)异号的假设下求f在[a, b]内的根。利用它求解f(x)=x²−2在[1,2]上的根√2，容差0.0005。展示所需的迭代次数，并联系公式 n ≥ log₂((b-a)/tol) 。

Solution:

def f(x): return x**2 - 2
def bisection(f,a,b,tol):
    while (b-a)/2 > tol:
        c = (a+b)/2
        if f(c)==0: return c
        elif f(a)*f(c)<0: b=c
        else: a=c
    return (a+b)/2
root = bisection(f,1,2,0.0005)

Predicting iterations: (b-a)/2ⁿ ≤ tol ⇒ 1/2ⁿ ≤ 0.0005 ⇒ 2ⁿ ≥ 2000 ⇒ n ≥ log₂2000 ≈

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

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