📚 A-Level WJEC Computer Science: High-Frequency Topics Summary | A-Level WJEC 计算机：高频考点总结
Understanding the most frequently examined topics in the WJEC A-Level Computer Science specification is crucial for effective revision. This article summarises the key areas that appear consistently across past papers, from data representation to software development, helping you target your study efficiently.
了解 WJEC A-Level 计算机科学考试大纲中最常考查的主题对于高效复习至关重要。本文总结了历年真题中反复出现的关键领域，从数据表示到软件开发，帮助你有的放矢地进行学习。
1. Data Representation and Number Systems | 数据表示与数制
Data representation is a foundational topic, often examined through binary, hexadecimal, and floating-point conversions. You must be confident converting between denary, binary, and hexadecimal, and performing binary arithmetic such as addition and subtraction using two’s complement for negative numbers.
数据表示是一个基础主题，常以二进制、十六进制和浮点数转换的形式考查。你需要熟练掌握十进制、二进制和十六进制之间的转换，并能进行二进制算术运算，例如使用补码表示负数进行加减法。
Floating-point representation follows the IEEE 754 standard, where a binary number is split into sign, exponent, and mantissa. Be prepared to normalise floating-point numbers and calculate the range and precision they can offer.
浮点数表示遵循 IEEE 754 标准，二进制数被分为符号位、指数和尾数。请准备好对浮点数进行规格化，并计算其能提供的范围和精度。
Character encoding systems like ASCII and Unicode are also frequently tested. Understand the limitations of ASCII and the benefits of Unicode’s larger character set for multilingual support.
字符编码系统如 ASCII 和 Unicode 也经常被考查。理解 ASCII 的局限性以及 Unicode 更大的字符集在多语言支持方面的优势。
2. Computer Architecture and the CPU | 计算机体系结构与中央处理器
The Von Neumann architecture is central to WJEC exam questions. You must be able to describe the roles of the control unit (CU), arithmetic logic unit (ALU), registers (such as PC, MAR, MDR, CIR), and system buses (address, data, control).
冯·诺依曼体系结构是 WJEC 考题的中心。你必须能够描述控制单元（CU）、算术逻辑单元（ALU）、寄存器（如 PC、MAR、MDR、CIR）以及系统总线（地址总线、数据总线、控制总线）的作用。
The fetch-decode-execute cycle is a high-frequency topic. Be prepared to explain each step in detail, including how the program counter increments and how data flows between memory and registers.
取指-译码-执行周期是一个高频考点。请准备好详细解释每一步，包括程序计数器如何递增，以及数据如何在内存和寄存器之间流动。
Factors affecting CPU performance—clock speed, number of cores, and cache memory—are commonly assessed. You should link these to specific scenarios, such as multitasking or real-time processing.
影响 CPU 性能的因素——时钟速度、核心数量和高速缓存——经常被评估。你应当将它们与特定场景联系起来，例如多任务处理或实时处理。
3. Operating Systems and Resource Management | 操作系统与资源管理
Operating system functions such as memory management, processor scheduling, and interrupt handling are regularly examined. You need to describe paging, segmentation, and virtual memory as techniques for managing memory.
操作系统的功能，如内存管理、处理器调度和中断处理，经常被考查。你需要描述分页、分段和虚拟内存等管理内存的技术。
Scheduling algorithms like round robin, first-come-first-served, and shortest job first appear in exam questions. Understand their advantages, disadvantages, and how they affect system throughput and response time.
调度算法如轮转法、先来先服务和最短作业优先会出现在考题中。理解它们的优缺点，以及它们如何影响系统吞吐量和响应时间。
The role of interrupts and the interrupt service routine (ISR) is another key area. Be able to explain how the CPU handles interrupts while preserving the state of the current process.
中断和中断服务程序（ISR）的作用是另一个重点。要能解释 CPU 如何处理中断，同时保存当前进程的状态。
4. Programming Fundamentals and Paradigms | 编程基础与范式
WJEC places emphasis on practical programming skills, which are often linked to theoretical concepts. Data types (integer, real, Boolean, character, string), constants, and variables are basic but essential topics.
WJEC 强调实践编程技能，这些技能常与理论概念相结合。数据类型（整型、实型、布尔型、字符型、字符串）、常量和变量是基本但至关重要的主题。
Control structures—sequence, selection (IF, CASE), and iteration (FOR, WHILE, REPEAT)—must be fully understood. You should be able to trace through pseudocode or actual code snippets to determine outputs or identify errors.
控制结构——顺序、选择（IF，CASE）和迭代（FOR，WHILE，REPEAT）——必须完全理解。你应该能够通过伪代码或实际代码片段进行追踪，以确定输出或识别错误。
Subroutines, procedures, and functions, including parameter passing by value and by reference, are frequent topics. Recursion and its use in solving problems like factorial or Fibonacci sequences may also appear.
子程序、过程和函数，包括按值传递和按引用传递参数，是常见主题。递归及其在解决阶乘或斐波那契数列等问题中的应用也可能出现。
5. Data Structures and Abstract Data Types (ADTs) | 数据结构与抽象数据类型
Arrays, both one-dimensional and two-dimensional, are tested for their use in storing and accessing data. Linked lists, stacks, and queues are abstract data types that frequently appear, often requiring algorithms for insertion and deletion.
一维和二维数组因其在存储和访问数据中的使用而受到测试。链表、栈和队列是经常出现的抽象数据类型，通常需要插入和删除算法。
Stacks are linked to LIFO (Last In First Out) and used in subroutine calls and backtracking. Queues follow FIFO (First In First Out) and appear in simulation or buffering contexts. You should be able to draw diagrams showing pointer operations.
栈遵循后进先出 (LIFO) 原则，用于子程序调用和回溯。队列遵循先进先出 (FIFO) 原则，出现在模拟或缓冲上下文中。你应该能够绘制显示指针操作的示意图。
Tree structures, especially binary search trees, may be examined for traversal methods (pre-order, in-order, post-order). Understand how to construct and search a binary tree, and know its advantage for fast lookup.
树形结构，特别是二叉搜索树，可能会考查遍历方法（前序、中序、后序）。理解如何构建和搜索二叉树，并了解它在快速查找方面的优势。
6. Algorithms and Computational Complexity | 算法与计算复杂度
Searching algorithms such as linear search and binary search are definitely high-frequency. Compare their efficiency in terms of best, average, and worst-case scenarios, and be able to implement them in pseudocode.
搜索算法如线性搜索和二分搜索绝对是高频考点。比较它们在最佳、平均和最差情况下的效率，并能够用伪代码实现它们。
Sorting algorithms including bubble sort, insertion sort, and merge sort are examined. You may be asked to demonstrate steps of sorting, analyse their time complexity using Big O notation (O(n), O(n²), O(n log n)), and identify stable sorts.
包括冒泡排序、插入排序和归并排序在内的排序算法是考点。你可能需要演示排序步骤，使用大 O 符号 (O(n), O(n²), O(n log n)) 分析它们的时间复杂度，并识别稳定排序。
Algorithm efficiency and the concept of intractable problems are also relevant. Know how to measure complexity and the difference between polynomial time and exponential time algorithms.
算法效率与难解问题的概念也相关。知道如何衡量复杂度以及多项式时间算法与指数时间算法之间的区别。
7. Databases and SQL | 数据库与 SQL
Relational databases, entity-relationship diagrams, and normalisation to 3NF (Third Normal Form) are staple exam content. Understand primary keys, foreign keys, and the elimination of data redundancy and anomalies.
关系数据库、实体关系图以及规范化到第三范式 (3NF) 是必考内容。理解主键、外键，以及消除数据冗余和异常的方法。
SQL commands for data definition (CREATE, ALTER, DROP) and data manipulation (SELECT, INSERT, UPDATE, DELETE) are tested frequently. You should be able to write queries that filter, sort, and join tables.
用于数据定义（CREATE, ALTER, DROP）和数据操作（SELECT, INSERT, UPDATE, DELETE）的 SQL 命令经常被考查。你应该能够编写过滤、排序和连接表的查询语句。
Wildcard characters, aggregate functions (SUM, AVG, COUNT), and GROUP BY clauses are important. Past papers often include database scenarios requiring multiple joins and nested queries.
通配符、聚合函数（SUM, AVG, COUNT）以及 GROUP BY 子句也很重要。历年真题通常包含需要多表连接和嵌套查询的数据库场景。
8. Computer Networks and Communication | 计算机网络与通信
Network models such as the TCP/IP stack and the OSI model are compared. You need to understand the functions of each layer—from physical transmission to application services—and how protocols like HTTP, FTP, DNS, and DHCP operate.
网络模型如 TCP/IP 协议栈和 OSI 模型会被比较。你需要理解每一层的功能——从物理传输到应用服务——以及 HTTP、FTP、DNS 和 DHCP 等协议如何运作。
Transmission methods (serial vs. parallel, simplex, half-duplex, full-duplex) and error detection methods (parity bits, checksums, CRC) are also key. Be able to explain how CRC can detect and, in some cases, correct errors.
传输方式（串行与并行、单工、半双工、全双工）和错误检测方法（奇偶校验位、校验和、CRC）也很关键。要能解释 CRC 如何检测并在某些情况下纠正错误。
Network security, including firewalls, encryption (symmetric and asymmetric), and malware types, is increasingly examined. Know the principles of public key cryptography and digital signatures.
网络安全，包括防火墙、加密（对称和非对称）以及恶意软件类型，越来越常被考查。了解公钥加密和数字签名的工作原理。
9. Boolean Algebra and Logic Gates | 布尔代数与逻辑门
Logic gates (AND, OR, NOT, NAND, NOR, XOR) and their truth tables are fundamental. You must be able to construct logic circuits from Boolean expressions and simplify them using Boolean laws or Karnaugh maps (K-maps).
逻辑门（与门、或门、非门、与非门、或非门、异或门）及其真值表是基础。你必须能够根据布尔表达式构建逻辑电路，并使用布尔定律或卡诺图（K-maps）进行化简。
De Morgan’s laws and the distributive, associative, and commutative laws are often needed for simplification. Be prepared to convert between sum-of-products (SoP) and product-of-sums (PoS) forms.
德摩根定律以及分配律、结合律和交换律经常需要用于化简。准备好进行积之和 (SoP) 与和之积 (PoS) 形式之间的转换。
K-maps up to four variables are a high-frequency tool for minimising circuits. You should be able to group cells correctly and write the simplified expression, reducing gate count.
最多四个变量的卡诺图是简化电路的高频工具。你应该能正确圈圈并写出简化表达式，减少门数量。
10. Software Development and Testing | 软件开发与测试
The software development life cycle (SDLC) with its stages—analysis, design, implementation, testing, evaluation—is often examined. Compare waterfall, agile, and spiral models, highlighting situations where each is suitable.
软件开发生命周期 (SDLC) 及其阶段——分析、设计、实施、测试、评估——经常被考查。比较瀑布模型、敏捷模型和螺旋模型，突出每种模型适用的场景。
Testing strategies such as white-box, black-box, and alpha/beta testing are important. You must know the difference between syntax errors, logic errors, and runtime errors, and how to select test data (normal, boundary, erroneous).
测试策略如白盒测试、黑盒测试和 alpha/beta 测试很重要。你必须知道语法错误、逻辑错误和运行时错误之间的区别，以及如何选择测试数据（正常、边界、异常）。
Documentation (user and technical) and maintenance types (corrective, adaptive, perfective) are also part of the syllabus. Questions may ask you to justify a maintenance approach for a given scenario.
文档（用户和技术）和维护类型（纠错性、适应性、完善性）也是大纲的一部分。考题可能会要求你为给定的场景论证一种维护方法。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导