Year 12 WJEC Computer Science: Interdisciplinary Exam Practice | Year 12 WJEC 计算机：跨学科综合题型训练

📚 Year 12 WJEC Computer Science: Interdisciplinary Exam Practice | Year 12 WJEC 计算机：跨学科综合题型训练

WJEC Computer Science at Year 12 increasingly tests your ability to connect concepts from different areas: mathematical logic with binary systems, Boolean algebra with circuit design, networking with graph algorithms, and project management with system development. This article provides a series of integrated question drills that mirror the cross-topic style you will encounter in the exam, with step-by-step solutions in both English and Chinese to reinforce your understanding.

Year 12 WJEC 计算机科学考试越来越注重你对不同领域概念的连接能力：数学逻辑与二进制系统、布尔代数与电路设计、网络与图算法、项目管理与系统开发。本文提供一系列模拟跨主题考试风格的综合性题目训练，并附有中英双语逐步解答，以巩固你的理解。

1. Binary Arithmetic & Number Systems | 二进制运算与数制

A classic interdisciplinary question combines two’s complement addition with mathematical overflow analysis. Consider the task: using 8-bit two’s complement, add +87 and +45 and determine whether an overflow occurs.

一道经典的跨学科题目将二进制补码加法与数学溢出分析结合起来。考虑以下任务：使用8位二进制补码，将 +87 和 +45 相加，并判断是否发生溢出。

Step 1: Convert to binary. 87₁₀ = 01010111₂, 45₁₀ = 00101101₂. Align the bits and perform binary addition, carrying where necessary.

步骤1：转换为二进制。87₁₀ = 01010111₂，45₁₀ = 00101101₂。对齐位并进行二进制加法，必要时进位。

  01010111
+ 00101101
-----------
  10000100

The result is 10000100₂. In two’s complement, the leftmost bit is 1, which indicates a negative number. But we added two positive numbers, so this is a clear sign of overflow. The mathematical sum 87 + 45 = 132 exceeds the range of an 8-bit two’s complement positive number (+127). Overflow flag would be set in the CPU status register.

结果为 10000100₂。在二进制补码中，最左边的位是1，表示一个负数。但我们相加的是两个正数，因此这是明显的溢出标志。数学上 87 + 45 = 132 超出了8位二进制补码的正数范围（+127）。CPU 状态寄存器中的溢出标志将被置位。

This connects computer arithmetic to modular arithmetic. An 8-bit two’s complement system behaves as integers modulo 256. +132 wraps around to 132 – 256 = -124, which is the signed decimal value of 10000100₂. Recognising this wrap-around helps you understand why overflow occurs and how it links to the carry out of the most significant bit.

这连接了计算机算术与模运算。8位二进制补码系统表现为整数模256。+132 回绕为 132 – 256 = -124，这正是 10000100₂ 的有符号十进制值。识别这种回绕有助于你理解溢出的原因以及它如何与最高位的进位相关联。

2. Boolean Logic & Circuit Design | 布尔逻辑与电路设计

WJEC papers often require you to design a combinational circuit from a worded problem. For example: design a full adder circuit using basic logic gates. A full adder takes three inputs (A, B, C_in) and produces Sum and C_out. Show the truth table, derive simplified Boolean expressions, and draw the logic diagram.

WJEC 试卷经常要求你根据文字描述设计组合电路。例如：使用基本逻辑门设计一位全加器电路。全加器接受三个输入（A、B、C_in）并产生 Sum 和 C_out。试列出真值表，推导简化布尔表达式，并画出逻辑图。

A	B	C_in	Sum	C_out
0	0	0	0	0
0	0	1	1	0
0	1	0	1	0
0	1	1	0	1
1	0	0	1	0
1	0	1	0	1
1	1	0	0	1
1	1	1	1	1

From the truth table, Sum = A XOR B XOR C_in. C_out = (A AND B) OR (C_in AND (A XOR B)). These expressions come directly from the minterms and can be simplified using Boolean algebra or Karnaugh maps. The circuit uses XOR, AND and OR gates, bridging logic to physical transistor implementations.

根据真值表，Sum = A XOR B XOR C_in；C_out = (A AND B) OR (C_in AND (A XOR B))。这些表达式直接从最小项导出，可使用布尔代数或卡诺图进行化简。电路使用异或门、与门和或门，将逻辑与物理晶体管的实现联系起来。

This cross‑linking is a perfect example of how WJEC expects you to move seamlessly from a functional specification through Boolean manipulation to a hardware schematic, combining abstract computer science with electronics engineering.

这种交叉联系是 WJEC 期望你在功能规格、布尔运算和硬件原理图之间无缝转换的完美示例，将抽象的计算机科学与电子工程相结合。

3. Data Structures & Algorithmic Efficiency | 数据结构与算法效率

A common interdisciplinary task is to analyse the time complexity of a search algorithm and relate it to data organisation. Consider a sorted list of 10⁶ integer IDs stored in an array. Determine the maximum number of comparisons needed by binary search. Express the worst‑case complexity using Big O notation and briefly explain why it is logarithmic.

一项常见的跨学科任务是分析查找算法的时间复杂度，并将其与数据组织方式联系起来。考虑一个存储在数组中的、包含 10⁶ 条整数 ID 的有序列表。确定二分查找所需的最大比较次数。用大 O 表示法表达最坏情况复杂度，并简要解释为什么它是对数级的。

Binary search repeatedly halves the search space. With n = 10⁶, the maximum comparisons = log₂(10⁶) + 1 ≈ 20 + 1 = 21. The O(log n) growth rate is independent of hardware speed, emphasising the mathematical underpinning of algorithm design. Knowing this allows you to predict performance on large datasets without trial runs.

二分查找反复将搜索空间减半。当 n = 10⁶ 时，最大比较次数 = log₂(10⁶) + 1 ≈ 20 + 1 = 21。O(log n) 的增长率与硬件速度无关，这强调了算法设计的数学基础。了解这一点，你无需实际运行就能预测大规模数据集上的性能表现。

In many WJEC exam questions, you must choose between an array and a linked list for a given scenario and justify your choice using both time complexity (Big O) and memory characteristics. This blends data structures with algorithmic reasoning, and sometimes with system constraints like cache efficiency in computer architecture.

在许多 WJEC 考试题中，你必须根据给定场景，在数组和链表之间做出选择，并利用时间复杂度（大 O 记法）与内存特性来证明你的选择。这融合了数据结构与算法推理，有时还涉及计算机体系结构中的约束，例如缓存效率。

4. Computer Architecture & Performance | 计算机体系结构与性能

CPU performance questions link physics and mathematics with hardware design. A program executes 2.5 × 10⁹ instructions, the average CPI is 1.4, and the clock frequency is 3.2 GHz. Calculate the CPU execution time. Explain how pipelining could reduce CPI and discuss the trade‑off involving pipeline hazards.

CPU 性能问题将物理、数学与硬件设计联系起来。某程序执行 2.5 × 10⁹ 条指令，平均 CPI 为 1.4，时钟频率为 3.2 GHz。请计算 CPU 执行时间。解释流水线技术如何降低 CPI，并讨论涉及流水线冒险的权衡问题。

Execution time = (Instruction Count × CPI) / Clock Rate = (2.5 × 10⁹ × 1.4) / (3.2 × 10⁹ Hz) = 3.5 / 3.2 ≈ 1.094 seconds. Pipelining overlaps instruction stages, ideally giving a CPI close to 1. Data hazards (RAW, WAR, WAW) and control hazards (branches) might stall the pipeline, increasing CPI again. This interconnection between mathematical modelling and hardware micro‑architecture is a favourite in WJEC exams.

执行时间 = （指令数 × CPI） / 时钟频率 = （2.5 × 10⁹ × 1.4） / （3.2 × 10⁹ Hz） = 3.5 / 3.2 ≈ 1.094 秒。流水线技术重叠各指令阶段，理想情况下使 CPI 接近 1。数据冒险（RAW、WAR、WAW）和控制冒险（分支）可能会使流水线暂停，再次增加 CPI。这种数学建模与硬件微架构之间的交互是 WJEC 考试的热门考点。

Modern multi‑core processors add another dimension: you might need to apply Amdahl’s law to predict speedup, linking parallel architecture with the mathematical notion of fraction of serial code. This type of question tests whether you can synthesise knowledge across the specification.

现代多核处理器增加了另一个维度：你可能需要运用阿姆达尔定律来预测加速比，将并行架构与串行代码比例的数学概念联系起来。这类问题考查你是否能将教学大纲中的知识融会贯通。

5. Networking & Graph Theory | 网络与图论

Routing algorithms apply graph theory directly. Given the weighted graph below representing a network of routers, use Dijkstra’s algorithm to find the shortest path from node A to F. Show the step‑by‑step operation of the distance vector and explain why the algorithm guarantees optimality.

路由算法直接应用图论。给定下面的带权有向图，表示一个路由器网络，使用迪杰斯特拉算法找出从节点 A 到 F 的最短路径。逐步展示距离向量的操作过程，并解释该算法为何能保证最优性。

Graph nodes: A, B, C, D, E, F. Edge weights: A‑B:4, A‑C:2, B‑C:1, B‑D:5, C‑E:10, D‑F:3, E‑F:2, D‑E:2. Starting at A, initial distances: A=0, others=∞. Iteratively update: C via A=2; B via A=4 or C=2+1=3 (choose 3); D via B=3+5=8; E via B→D→E=8+2=10 or C=2+10=12 → min 10; F via D=8+3=11 or E=10+2=12 → min 11. Shortest path A→C→B→D→F with total cost 2+1+5+3 = 11. This merges network technology with discrete maths.

图节点：A、B、C、D、E、F。边权值：A‑B:4、A‑C:2、B‑C:1、B‑D:5、C‑E:10、D‑F:3、E‑F:2、D‑E:2。从 A 出发，初始距离：A=0，其余为∞。迭代更新：经 A 到 C=2；经 A 到 B=4、或经 C 为 2+1=3（选 3）；经 B 到 D=3+5=8；经 B→D→E 为 8+2=10、或经 C 为 2+10=12 → 最小 10；经 D 到 F=8+3=11、或经 E 为 10+2=12 → 最小 11。最短路径 A→C→B→D→F，总开销 2+1+5+3=11。这将网络技术与离散数学融合在一起。

WJEC might ask you to compare Dijkstra with Bellman‑Ford for dynamic routing, linking algorithm tolerance to negative weights with real‑world WAN requirements. Always support your answer with graph theory terminology like relaxation and convergence.

WJEC 可能会要求你比较迪杰斯特拉算法与贝尔曼‑福特算法在动态路由中的应用，将算法对负权重的容忍度与现实世界广域网需求联系起来。答题时务必使用图论术语，如松弛和收敛，来支撑你的答案。

6. Databases & Data Analysis | 数据库与数据分析

An exam task often involves normalising a flat‑file table into third normal form (3NF) and then writing SQL queries. Consider a college table: Student(ID, Name, CourseCode, CourseTitle, TutorID, TutorName). Identify partial and transitive dependencies, decompose it into 3NF, and write an SQL query to list students along with their course titles.

考试中常出现将平面表规范化为第三范式（3NF）并编写 SQL 查询的任务。考虑一个大学表：Student(ID, Name, CourseCode, CourseTitle, TutorID, TutorName)。识别部分依赖和传递依赖，将其分解为 3NF，并编写 SQL 查询列出学生及其课程名称。

Primary key: ID. Partial dependency: CourseTitle depends only on CourseCode, not on entire key. Transitive dependency: TutorName depends on TutorID, which depends on ID via Course. 3NF tables: Students(ID, Name, CourseCode, TutorID); Courses(CourseCode, CourseTitle); Tutors(TutorID, TutorName). SQL: SELECT Students.Name, Courses.CourseTitle FROM Students INNER JOIN Courses ON Students.CourseCode = Courses.CourseCode; This connects data modelling with business logic and programming.

主键：ID。部分依赖：CourseTitle 仅依赖于 CourseCode，而非整个主键。传递依赖：TutorName 依赖于 TutorID，而 TutorID 通过 Course 依赖于 ID。3NF 表：Students(ID, Name, CourseCode, TutorID)；Courses(CourseCode, CourseTitle)；Tutors(TutorID, TutorName)。SQL：SELECT Students.Name, Courses.CourseTitle FROM Students INNER JOIN Courses ON Students.CourseCode = Courses.CourseCode；这将数据建模与业务逻辑和程序设计连接起来。

You may also be required to discuss the impact of normalisation on database performance, weighing reduced redundancy against increased join cost — an intersection of database theory and computer architecture (disk I/O and indexing).

你可能还需要讨论规范化对数据库性能的影响，在减少冗余与增加连接开销之间权衡 —— 这是数据库理论与计算机体系结构（磁盘 I/O 和索引）的交汇点。

7. Systems Development Life Cycle | 系统开发生命周期

A realistic WJEC scenario involves planning a software project using Critical Path Analysis (CPA). Given activities for a mobile app: Requirements (A, 3 days), Design (B, 5 days, depends on A), Prototyping (C, 4 days, depends on B), User Feedback (D, 2 days, depends on C), Coding (E, 10 days, depends on B), Testing (F, 6 days, depends on E and D). Draw the network diagram, identify the critical path, and calculate the minimum project duration.

一个真实的 WJEC 场景涉及使用关键路径分析（CPA）来规划一个软件项目。某移动应用的各项活动：需求分析（A，3 天），设计（B，5 天，依赖 A），原型制作（C，4 天，依赖 B），用户反馈（D，2 天，依赖 C），编码（E，10 天，依赖 B），测试（F，6 天，依赖 E 和 D）。画出网络图，标出关键路径，并计算最短项目工期。

Paths: A→B→C→D→F: 3+5+4+2+6 = 20 days; A→B→E→F: 3+5+10+6 = 24 days. Critical path is A→B→E→F, duration 24 days. Any delay on these activities extends the entire project. This merges project management (operations research) with software engineering, showing how logic sequencing and resource planning are as important as coding.

各路径：A→B→C→D→F：3+5+4+2+6 = 20 天；A→B→E→F：3+5+10+6 = 24 天。关键路径为 A→B→E→F，工期 24 天。这些活动上的任何延误都会延长整个项目。这融合了项目管理（运筹学）与软件工程，表明逻辑排序和资源规划与编码同样重要。

Be prepared to discuss how agile methodologies alter planning

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

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

Year 12 WJEC Computer Science: Interdisciplinary Exam Practice | Year 12 WJEC 计算机：跨学科综合题型训练