📚 AS WJEC Computer Science: In-Depth Analysis of Past Papers | AS WJEC 计算机：历年真题深度解析
Mastering WJEC AS Computer Science means more than just understanding the theory—it requires exam-ready application. This guide takes you through the most frequent question types from real past papers, pinpointing what examiners look for and how to craft high-scoring answers. By dissecting topics like data representation, Boolean logic, algorithms, networking, and system software through the lens of actual exam questions, you will build the analytical skills and precision needed to excel.
精通 WJEC AS 计算机科学不仅意味着理解理论，还需要能够应对考试的应用能力。本指南通过历年真题中最高频的题型，精准指出考官关注的重点以及如何构建高分答案。我们将以实际考题为透镜，深入剖析数据表示、布尔逻辑、算法、网络和系统软件等主题，帮助你培养卓越的分析技能与答题精准度。
1. Decoding the Paper Structure | 解读试卷结构
The WJEC AS Computer Science qualification splits into two units. Unit 1, a 1-hour 45-minute written examination, carries 62.5% of the total AS marks. It mixes short answer questions, structured calculations, tracing exercises, and extended prose. Unit 2 is an on-screen programming examination focusing on practical problem solving. For the purposes of past paper analysis, Unit 1 is the goldmine for repeated patterns and must-know command words like “state”, “describe”, “explain”, and “discuss”.
WJEC AS 计算机科学证书分为两个单元。Unit 1 是时长 1 小时 45 分钟的笔试，占总分的 62.5%。题型包括简答题、结构化计算、追踪练习和论述题。Unit 2 是上机编程考试，侧重实践问题解决。就真题分析而言，Unit 1 是一座金矿，其中反复出现的题型模式以及 “state”、”describe”、”explain” 和 “discuss” 等指令词是必须掌握的。
Past papers reveal that topics are not uniformly weighted. Data representation and Boolean algebra appeared in nearly every series, often as compulsory short questions. Algorithms and trace tables feature heavily in the mid-section, while networking and ethical issues typically form part of a longer, scenario-based question. Adjusting your revision to match this spread gives you a tactical advantage.
历年真题显示，各主题的权重并不均衡。数据表示和布尔代数几乎出现在每一份试卷中，常作为必答短题。算法和追踪表大量出现在试卷中部，而网络与伦理问题通常构成情境长题的一部分。根据这一分布调整复习策略，你就能获得战术优势。
2. Data Representation: Binary, Hex and Two’s Complement | 数据表示：二进制、十六进制与补码
A staple question asks: “Convert the decimal number 119 into an 8-bit two’s complement binary number and then into hexadecimal.” Start by expressing 119 as powers of 2: 64+32+16+4+2+1, giving binary 01110111. Since it is positive, the two’s complement representation is identical. To reach hexadecimal, split into nibbles: 0111 (7) and 0111 (7), producing 77H. Examiners often add a follow-up: “State the range of an 8-bit two’s complement integer.” The answer is -128 to +127.
一道经典题要求：”将十进制数 119 转换为 8 位二进制补码形式，然后再转为十六进制。” 首先用 2 的幂表示 119：64+32+16+4+2+1，得到二进制 01110111。因为是正数，补码形式相同。转换为十六进制时，拆分为半字节：0111（7）和 0111（7），得到 77H。考官常追加一问：”说出 8 位二进制补码整数的范围。” 答案为 -128 到 +127。
Another frequent variant tests binary addition and overflow. For instance, “Add the 8-bit two’s complement numbers 01101010 (+106) and 01011011 (+91), and comment on the result.” 106+91 = 197, but the binary sum yields 11000101. Since the result is outside the representable range, the overflow flag would be set, and interpreting the sum as two’s complement gives a negative value (-59). Understanding the hardware implications of the overflow bit earns top marks.
另一种常见变体考查二进制加法与溢出。例如，”将 8 位补码数 01101010 (+106) 与 01011011 (+91) 相加，并评论结果。” 106+91=197，但二进制求和得出 11000101。由于结果超出可表示范围，溢出标志位将被置位，若将结果视作补码会得到负值 (-59)。理解溢出位在硬件层面的含义能赢得高分。
| Binary | Decimal (unsigned) | Two’s complement |
|---|---|---|
| 11000101 | 197 | -59 |
3. Boolean Algebra and Logic Gate Simplification | 布尔代数与逻辑门化简
A heavily tested skill is simplifying expressions using laws of Boolean algebra. Consider this past paper problem: “Simplify the expression P = A ∨ (¬A ∧ B).” Applying the distributive law, P = (A ∨ ¬A) ∧ (A ∨ B) = 1 ∧ (A ∨ B) = A ∨ B. Alternatively, absorption directly gives A ∨ B. The marking scheme rewards clear, step-by-step justification. Follow the simplification by drawing the equivalent logic circuit using AND, OR, and NOT gates—examiners penalise missing connections or ambiguous symbols.
一项高频考查的技能是运用布尔代数定律化简表达式。考虑这道真题：”化简表达式 P = A ∨ (¬A ∧ B)。” 应用分配律，P = (A ∨ ¬A) ∧ (A ∨ B) = 1 ∧ (A ∨ B) = A ∨ B。或者直接用吸收律可得 A ∨ B。评分方案奖励步骤清晰、推理周密的解答。化简后需绘制等价逻辑电路（使用与门、或门和非门）——考官会扣掉缺失连线或模糊符号的分数。
Another common question provides a truth table and asks for the Boolean expression in sum-of-products form, followed by Karnaugh map reduction. For a 3-variable input (A, B, C) with output 1 for minterms 1,3,6,7, the un-simplified expression is ¬A ¬B C + ¬A B C + A B ¬C + A B C. After mapping onto a K-map, the simplified result might be C + A B. Always circle the largest groups (1, 2, 4, 8) on the K-map and write the minimised equation to secure full marks.
另一种常见题型给出真值表，要求写出积之和形式的布尔表达式，然后使用卡诺图化简。对于一个三变量输入 (A, B, C)，最小项 1,3,6,7 输出为 1，未化简表达式为 ¬A ¬B C + ¬A B C + A B ¬C + A B C。映射到卡诺图后，化简结果可能是 C + A B。一定要在卡诺图上圈出最大的组（1、2、4、8），并写出最简方程，方能满分。
4. Computer Architecture: The Fetch-Decode-Execute Cycle | 计算机体系结构：取指-译码-执行周期
WJEC expects candidates to describe the roles of key registers within the CPU. A typical question: “Explain how the Program Counter (PC), Memory Address Register (MAR), and Current Instruction Register (CIR) interact during the fetch stage.” The PC holds the address of the next instruction. This address is copied to the MAR, which sends it along the address bus. The instruction at that memory location is fetched and placed into the CIR. Meanwhile, the PC is incremented to point to the subsequent instruction. Using precise technical language such as “incremented” and “address bus” makes the answer stand out.
WJEC 期望考生描述 CPU 内部关键寄存器的作用。典型问题：”解释在取指阶段，程序计数器 (PC)、内存地址寄存器 (MAR) 和当前指令寄存器 (CIR) 如何相互作用。” PC 存放下一条指令的地址。该地址被复制到 MAR，MAR 将其送上地址总线。对应内存位置处的指令被取出并放入 CIR。同时，PC 自增以指向下一条指令。使用 “自增”、”地址总线” 等精确的技术语言能让答案脱颖而出。
Past papers also probe factors affecting CPU performance: clock speed, cache size, and number of cores. A 6-mark “discuss” question may ask you to evaluate how each factor improves performance in a given scenario. For instance, increasing cache size reduces the average memory access time because more instructions/data can be stored close to the CPU, minimising slow main memory fetches. However, the law of diminishing returns applies—beyond a certain cache size, hit rate improvements flatten. Balancing technical detail with critical evaluation earns the top band.
真题还会探究影响 CPU 性能的因素：时钟速度、缓存大小和核心数量。一道 6 分的 “discuss” 题可能要求评估每种因素在给定场景下如何提升性能。例如，增大缓存可以降低平均内存访问时间，因为更多的指令/数据可存储在靠近 CPU 的位置，减少缓慢的主存读取。但这里存在边际收益递减规律——超出一定缓存大小后，命中率的提升会趋于平缓。结合技术细节与批判性评估，才能斩获最高分段。
5. Algorithm Trace Tables: Dry Running with Precision | 算法追踪表：精准手动追踪
Trace tables are a guarantee in WJEC Unit 1. A classic problem provides pseudocode such as:
追踪表是 WJEC Unit 1 的必考点。一道经典题目给出如下的伪代码：
SUM ← 0
FOR i ← 1 TO 4
SUM ← SUM + i
ENDFOR
OUTPUT SUM
The task is to complete a trace table with columns for i, SUM, and OUTPUT. Iteration by iteration: i=1, SUM=1; i=2, SUM=3; i=3, SUM=6; i=4, SUM=10. Final OUTPUT is 10. Students often lose marks by missing the final state after the loop or by incorrectly listing i when it changes. Always include the loop variable update exactly where it occurs in the pseudocode.
任务是用 i、SUM 和 OUTPUT 三列完成追踪表。逐次迭代：i=1, SUM=1；i=2, SUM=3；i=3, SUM=6；i=4, SUM=10。最终 OUTPUT 为 10。考生常因遗漏循环结束后的最终状态，或错误记录 i 的变化时机而丢分。必须严格按照伪代码中变量更新的位置进行记录。
| i | SUM | OUTPUT |
|---|---|---|
| 1 | 1 | |
| 2 | 3 | |
| 3 | 6 | |
| 4 | 10 | 10 |
More challenging trace problems involve nested loops or arrays. When an array A[1..4] is manipulated inside a loop, you must track each element’s value precisely. Use the trace table to note A[1], A[2], etc., in separate columns if space is provided, or annotate carefully. Mark schemes award marks for correct intermediate values even if the final output is wrong, so demonstrate your working methodically.
更具挑战性的追踪问题涉及嵌套循环或数组。当数组 A[1..4] 在循环内被修改时，你必须准确追踪每个元素的值。若空间允许，在追踪表中用单独列记录 A[1]、A[2] 等，或仔细添加注释。评分方案会为正确的中间值给分，即使最终输出错误，因此务必有条理地展示你的解题过程。
6. Searching and Sorting Algorithms: Stepwise Thinking | 搜索与排序算法：逐步思维
Binary search is examined almost every year. A typical question provides a sorted list: [3, 9, 14, 21, 28, 35, 42, 50] and asks to locate 35 using binary search, documenting each step. Low=0, High=7, Mid=3 (21). 35>21, so Low=4. Mid=5 (35), match found. Many candidates fail to show the comparisons explicitly; a full-mark answer would include: “compare 35 with 21, 35 greater, discard left half”. Also, be prepared to state the maximum number of comparisons for a list of size n: approximately log₂ n.
二分搜索几乎每年都考。一道典型题目提供有序列表 [3, 9, 14, 21, 28, 35, 42, 50]，要求用二分搜索定位 35，并记录每一步。Low=0, High=7, Mid=3（21）。35>21，所以 Low=4。Mid=5（35），找到匹配。许多考生未能明确展示比较过程；满分答案应包含：”比较 35 与 21，35 更大，丢弃左半部分”。此外，要准备好写出规模为 n 的列表的最大比较次数：约为 log₂ n。
Sorting questions often ask to complete a bubble sort pass or compare algorithms. For a first pass of bubble sort on [7, 2, 9, 1]: compare 7 and 2 → swap (2,7,9,1); compare 7 and 9 → no swap; compare 9 and 1 → swap (2,7,1,9). After one pass, the largest element “bubbles” to the end. Understand that a complete bubble sort requires n-1 passes in the worst case. Exam questions also test the efficiency difference between bubble sort (O(n²)) and merge sort (O(n log n)), so know the big O notations.
排序题经常要求完成一次冒泡排序的趟，或比较不同算法。对数组 [7, 2, 9, 1] 进行第一趟冒泡排序：比较 7 和 2 → 交换 (2,7,9,1)；比较 7 和 9 → 不交换；比较 9 和 1 → 交换 (2,7,1,9)。一趟之后，最大元素 “冒泡” 到末尾。要明白，在最坏情况下，完整的冒泡排序需要 n-1 趟。考试还会考查冒泡排序 (O(n²)) 与归并排序 (O(n log n)) 的效率差异，因此需牢记大 O 表示法。
7. Programming Fundamentals: Pseudocode and Data Structures | 编程基础：伪代码与数据结构
WJEC papers frequently ask candidates to read or write pseudocode for array and record operations. An example: “A teacher stores student names and test scores in a record structure. Write pseudocode to find and output the name of the student with the highest score.” Using a WHILE or FOR loop, initialise a variable HighestScore ← -1, iterate through the records, and update HighestScore and TopStudent whenever a higher score is found. After the loop, output TopStudent. Marks are allocated for initialisation, correct loop boundary, comparison, and final output.
WJEC 试卷经常要求考生阅读或编写针对数组和记录操作的伪代码。例如：”一位教师将学生姓名和测试成绩存储在记录结构中。编写伪代码找出并输出成绩最高的学生姓名。” 使用 WHILE 或 FOR 循环，初始化变量 HighestScore ← -1，遍历记录，每当发现更高成绩时就更新 HighestScore 和 TopStudent。循环结束后输出 TopStudent。分数将分配给初始化、正确的循环边界、比较以及最终输出。
Another theme is modular programming using functions and procedures. You may be given an incomplete function and asked to fill in the missing code or predict the output. Understanding parameter passing by value versus by reference can be decisive. If a parameter is passed by value, changes inside the procedure do not affect the original variable. Past papers often set a trap where a variable is passed by value but the question expects the original variable’s final state to be unchanged—missing this nuance costs marks.
另一主题是使用函数和过程的模块化编程。你可能会看到一个不完整的函数，要求补全缺失代码或预测输出。理解按值传递与按引用传递参数可能成为决胜关键。如果参数按值传递，过程
Published by TutorHao | AS Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导