📚 Year 12 Edexcel Computer Science: Summer Bridging Course | Edexcel AS 计算机暑期衔接课程
Welcome to your summer preparation guide for Year 12 Edexcel Computer Science (AS, 8CN0). This bridging resource is designed to help you move from GCSE to the advanced concepts, rigorous problem-solving habits and programming fluency required at A-level. The gap between the two levels is not mainly about learning more facts: it is about thinking differently. At GCSE you were often asked to recall and describe; at AS you are asked to explain, compare, justify, design and implement. By working through the topics below in order, you will build both confidence and competence before the new academic year begins.
欢迎阅读 Edexcel 计算机科学 AS 阶段（12 年级，8CN0）暑期预习指南。本衔接资源旨在帮助你从 GCSE 平稳过渡到 A-level 所需的高级概念、严谨的问题解决习惯与编程能力。两个阶段之间的差距主要不在于"记住更多事实"，而在于"换一种方式思考"。在 GCSE 阶段，你常常只需回忆与描述；到了 AS 阶段，你必须解释、比较、论证、设计并实现。通过按顺序学习以下主题，你将在新学年开始前同时建立信心与实力。
1. Course Overview and Exam Structure | 课程概览与考试结构
The Edexcel AS Computer Science qualification (8CN0) is made up of two externally assessed papers, each weighted at 50% of the total AS grade. Paper 1, 'Principles of Computer Science', tests your understanding of theory, while Paper 2, 'Application of Computational Thinking', assesses your ability to design algorithms and write programs that solve problems. Both papers last 2 hours and contain a mixture of short-answer questions, extended-writing questions and programming-related tasks.
Edexcel AS 计算机科学（8CN0）资格包含两份外部考试试卷，各占总成绩的 50%。试卷一"计算机科学原理"考查你的理论理解，试卷二"计算思维的应用"评估你设计算法并编写程序解决问题的能力。两份试卷时长均为 2 小时，题型包括简答题、扩展写作题以及与编程相关的任务。
| Paper 试卷 | Title 名称 | Weight 占比 | Duration 时长 | Focus 重点 |
|---|---|---|---|---|
| Paper 1 | Principles of Computer Science 计算机科学原理 | 50% | 2 hours | Theory, data, hardware, networks 理论、数据、硬件、网络 |
| Paper 2 | Application of Computational Thinking 计算思维的应用 | 50% | 2 hours | Algorithms and programming 算法与编程 |
Always cross-check the topic sequence against the current published Pearson specification, because small updates do occur between series.
请务必把主题顺序与 Pearson 最新公布的官方考纲进行核对，因为不同考试季之间会有小幅更新。
2. What GCSE Knowledge You Must Secure First | 必须巩固的 GCSE 基础
Before you touch AS content, audit your GCSE foundations. Weak foundations cause more AS underperformance than difficult new theory. Check that you can convert between binary, denary and hexadecimal without hesitation, that you can construct a truth table for a two-input logic circuit, and that you can write a simple program using sequence, selection and iteration.
在接触 AS 内容之前，请先盘点你的 GCSE 基础。基础薄弱造成的 AS 成绩下滑，比"新理论太难"更常见。请确认你能毫不犹豫地在二进制、十进制与十六进制之间转换；能为含两个输入的逻辑电路写出真值表；能用顺序、选择与循环结构写出简单程序。
- Units and storage: bit, nibble, byte, KiB, MiB, GiB, TiB, and the difference between decimal and binary prefixes.
- Data representation: text, images, sound, and the idea that everything reduces to binary patterns.
- Programming constructs: variables, input/output, if/elif/else, for and while loops, functions and parameters.
- Networks: LAN vs WAN, topology basics, IP and MAC addresses, and simple security threats.
- 单位与存储：位、半字节、字节、KiB、MiB、GiB、TiB，以及十进制前缀与二进制前缀的差别。
- 数据表示：文本、图像、声音，并理解一切最终都归结为二进制模式。
- 编程结构：变量、输入输出、if/elif/else、for 与 while 循环、函数与参数。
- 网络：局域网与广域网、拓扑基础、IP 与 MAC 地址、简单的安全威胁。
A useful diagnostic: write, from memory, a program that reads ten numbers and prints the largest, the smallest and the mean. If you need help, that is your first revision target.
一个有效的自测方法：凭记忆写出一个程序，读入十个数字，输出最大值、最小值与平均值。如果你需要查资料才能完成，这就是你的第一个复习目标。
3. Paper 1 Topic Map: Computational Thinking, Data, Computers, Communication | 试卷一知识地图：计算思维、数据、计算机、通信
Paper 1 draws on four broad areas: computational thinking and problem solving; data representation, data structures and Boolean logic; the structure and function of computer systems, including hardware, software and the stored program model; and communication, networks, security and the ethical and legal issues that surround them. Treat this as a map rather than a list, because exam questions frequently combine areas, for example asking you to explain how a compression method affects transmission time over a network.
试卷一涵盖四大领域：计算思维与问题解决；数据表示、数据结构与布尔逻辑；计算机系统的结构与功能，包括硬件、软件与存储程序模型；以及通信、网络、安全，及其涉及的伦理与法律议题。请把它当作一张地图而不是一份清单，因为考题经常跨领域组合，例如要求你解释某种压缩方法如何影响网络传输时间。
Notice the verbs in the command words. 'Describe' needs a factual account; 'explain' needs cause and effect; 'compare' needs both similarities and differences; 'evaluate' needs a judgement supported by evidence. Marks are awarded for the reasoning, not for length.
请注意"指令动词"。describe（描述）需要事实陈述；explain（解释）需要因果逻辑；compare（比较）需要同时给出相同点与不同点；evaluate（评价）需要以证据支撑的判断。得分来自推理过程，而不是篇幅长短。
4. Number Systems, Binary Arithmetic and Data Representation | 数制、二进制运算与数据表示
Number work is the highest-yield revision topic in the whole specification because it is objectively markable and appears every series. You must be fluent in three bases and in the arithmetic that connects them.
数制是整个考纲中"性价比"最高的复习主题，因为它的评分客观、几乎每季必考。你必须熟练掌握三种进制以及它们之间的运算。
Denary → Binary → Hexadecimal: 173₁₀ = 1010 1101₂ = AD₁₆
The place values in one byte are 128, 64, 32, 16, 8, 4, 2 and 1, which are 2⁷ down to 2⁰. Hexadecimal is base 16, so each hex digit represents exactly four bits, which is why hex is used as a compact shorthand for binary. In two's complement, a negative value is formed by inverting the bits and adding 1, and the value of an n-bit signed number ranges from −2⁽ⁿ⁻¹⁾ to 2⁽ⁿ⁻¹⁾ − 1.
一个字节的位权是 128、64、32、16、8、4、2、1，即 2⁷ 到 2⁰。十六进制是 16 进制，每个十六进制位恰好对应四位，因此十六进制常被用作二进制的紧凑写法。在补码表示中，负数由"按位取反再加 1"得到，n 位有符号数的取值范围是 −2⁽ⁿ⁻¹⁾ 到 2⁽ⁿ⁻¹⁾ − 1。
8-bit two's complement: −5 = 256 − 5 = 251 = 1111 1011₂
- Binary addition and subtraction, including overflow detection when the carry out of the most significant bit differs from the carry in.
- Logical shifts left and right, and the effect on value: a left shift multiplies by 2, a right shift divides by 2 (integer division).
- Character sets: ASCII uses 7 or 8 bits, giving 128 or 256 characters; Unicode uses more bits so it can represent the world's writing systems.
- epth (in bits); sound file size = sample rate × bit depth × duration × number of channels.
- 二进制加减法，包括溢出判断：最高位进位与次高位进位不一致即发生溢出。
- 逻辑左移与右移及其对数值的影响：左移相当于乘 2，右移相当于整除 2。
- 字符集：ASCII 使用 7 位或 8 位，表示 128 或 256 个字符；Unicode 使用更多位，可表示世界各书写系统。
- 图像文件大小 = 宽 × 高 × 色彩深度（位）；声音文件大小 = 采样率 × 采样位深 × 时长 × 声道数。
5. Boolean Logic, Truth Tables and Simplification | 布尔逻辑、真值表与化简
Boolean logic is the bridge between theory and hardware. You should be able to take a written specification, build a logic circuit, derive a truth table and simplify the expression. Questions often ask you to complete a partially filled truth table, so practise until it becomes mechanical.
布尔逻辑是理论与硬件之间的桥梁。你应当能够根据文字描述画出逻辑电路、推导真值表，并对表达式进行化简。考题常常要求你补全一张只填了一半的真值表，所以要练到"机械化"的程度。
Remember the three primary gates (AND, OR, NOT) and the derived gates NAND, NOR and XOR. The half adder is built from an XOR gate for the sum and an AND gate for the carry, which is the classic exam example of combining gates.
请记住三种基本门（AND、OR、NOT）以及派生门 NAND、NOR、XOR。半加器由异或门产生"和"、与门产生"进位"，这是考题中组合门电路的经典例子。
De Morgan: NOT (A AND B) ≡ (NOT A) OR (NOT B)
Half adder: S = A ⊕ B, C = A AND B
Use distribution, absorption and De Morgan's laws to reduce the number of gates, and always justify each step in words: 'simplified because A OR (A AND B) ≡ A'.
使用分配律、吸收律与德摩根定律来减少门的数量，并且每一步都要用文字说明理由："因为 A OR (A AND B) ≡ A，所以化简成功"。
6. Programming Fundamentals: Building Real Fluency in Python | 编程基础：在 Python 中建立真正的熟练度
At AS you are expected to write programs, not merely read them. Python is an excellent choice because it has minimal syntax overhead, but the exam is testing your algorithmic thinking, not your knowledge of library functions. Learn a small, reliable core and use it repeatedly.
在 AS 阶段，你被要求"写"程序，而不仅仅是"读"程序。Python 是很好的选择，因为语法负担小；但考试考查的是你的算法思维，而不是你对库函数的了解。请掌握一个小而可靠的核心子集，并反复使用它。
- Input, output and casting: value = int(input("Enter a number: "))
- Selection: if / elif / else, including nested conditions and compound Boolean expressions with and, or, not.
- Iteration: for loops with range(), and while loops with a sentinel condition.
- Modular code: defining functions with parameters and return values, and avoiding global variables.
- Validation and exception handling: checking a value is in range before using it, and using try / except for input errors.
- Simple file handling: opening, reading line by line, writing and closing.
- Lists: appending, indexing, slicing, iterating, searching, and passing a list into a function.
- 输入、输出与类型转换：value = int(input("请输入一个数字："))
- 选择结构：if / elif / else，包括嵌套条件与用 and、or、not 组成的复合布尔表达式。
- 循环结构：使用 range() 的 for 循环，以及带哨兵条件的 while 循环。
- 模块化代码：定义含参数与返回值的函数，避免使用全局变量。
- 数据校验与异常处理：使用前先检查取值是否在范围内，并用 try / except 处理输入错误。
- 简单文件操作：打开、逐行读取、写入与关闭。
- 列表：追加、索引、切片、遍历、搜索，以及把列表传入函数。
A high-value habit: after every program you write, add comments explaining the purpose of each block. This trains you to separate 'what it does' from 'how it does it', which is precisely what examiners look for in algorithm design questions.
一个高收益习惯：每写完一个程序，都为每个代码块加上注释说明其目的。这会训练你区分"它做什么"与"它怎么做"，而这正是考官在算法设计题中想要看到的东西。
7. Algorithms, Decomposition and Computational Thinking | 算法、分解与计算思维
Computational thinking at AS level has three examinable strands: decomposition, abstraction and algorithmic thinking. Decomposition means breaking a large problem into smaller sub-problems that can be solved independently. Abstraction means removing irrelevant detail to create a model that keeps only what matters. Algorithmic thinking means expressing a solution as an unambiguous sequence of steps.
AS 阶段的计算思维有三个可考查的维度：分解、抽象与算法思维。分解是把大问题拆成可独立求解的小问题；抽象是去掉无关细节，只保留关键要素来建立模型；算法思维则是把解法表达为无歧义的有序步骤。
You should be able to express an algorithm in three ways: structured English, pseudocode and a program. Pseudocode must be unambiguous, must use indentation to show block structure, and should not depend on a particular language's syntax.
你应当能用三种方式表达算法：结构化英文、伪代码与程序。伪代码必须无歧义、用缩进体现块结构，并且不应依赖某一门语言的具体语法。
- Standard algorithms to be able to write from scratch: linear search, binary search, bubble sort, insertion sort, merge sort, and simple file-based data processing.
- Trace tables: given an algorithm and input data, complete a table showing each variable after each iteration.
- Efficiency arguments: why binary search needs the data to be sorted, and why it inspects far fewer items than a linear search.
- 必须能默写的标准算法：线性查找、二分查找、冒泡排序、插入排序、归并排序，以及基于文件的简单数据处理。
- 跟踪表：给定算法与输入数据，填出每一轮迭代后各变量的值。
- 效率论证：二分查找为什么要求数据有序，以及为什么它检查的元素数量远少于线性查找。
Linear search: up to n comparisons. Binary search: up to log₂ n comparisons.
8. Data Structures and Abstract Data Types | 数据结构与抽象数据类型
AS introduces you to structures that organise data so that operations on it become efficient. The key insight is that the choice of structure follows from the operations you need, not from personal preference.
AS 阶段会介绍一些用于组织数据的结构，使针对数据的操作变得高效。关键洞见是：选择哪种结构取决于你需要的操作，而不是个人偏好。
| Structure 结构 | Rule 规则 | Typical use 典型用途 |
|---|---|---|
| Array / List 数组/列表 | Fixed or growable sequence, indexed 可索引的序列 | Storing records 存储记录 |
| Stack 栈 | LIFO: last in, first out 后进先出 | Undo, function call stack 撤销、函数调用栈 |
| Queue 队列 | FIFO: first in, first out 先进先出 | Print queues, buffering 打印队列、缓冲 |
| Linked list 链表 | Nodes with data plus pointer 数据加指针的节点 | Frequent insertion and deletion 频繁插入删除 |
| Hash table 哈希表 | Key mapped by hash function 用哈希函数映射键 | Fast lookup by key 按键快速查找 |
Be ready to compare a linked list with an array: insertion into a linked list is O(1) once the position is known, but accessing the nth element is O(n) because you must follow the pointers, whereas an array gives O(1) direct access by index.
要准备好比较链表与数组：已知位置时向链表插入节点是 O(1)，但访问第 n 个元素是 O(n)，因为必须沿指针逐个前进；而数组通过下标可直接访问，是 O(1)。
9. Paper 2 Exam Practice: Writing Algorithms Under Time Pressure | 试卷二应试：限时算法写作
Paper 2 rewards preparation that is specific to the exam format. You are not being tested on how clever your code is, but on whether your solution is correct, complete, readable and testable within the time available.
试卷二奖励的是"针对考试形式"的准备。它考查的并非你的代码有多巧妙，而是你的解法在限定时间内是否正确、完整、可读、可测。
- Read the whole question first: the marks are distributed across sub-parts, so a long scenario often hides several easy marks at the end.
- State your assumptions: language, valid input range, and what happens with invalid data.
- Write pseudocode first, then translate into code. This keeps your structure visible to the examiner.
- Include validation, and describe at least three test cases: normal, boundary and erroneous.
- Leave two minutes to re-read your program looking for off-by-one errors in loops and incorrect comparison operators.
- 先通读整道题：分数分布在各个小题中，因此一个长情境题往往在末尾藏着几个容易的分数。
- 明确写出你的假设：使用语言、有效输入范围，以及遇到非法数据时的处理方式。
- 先写伪代码，再翻译成代码，这样你的结构对考官是可见的。
- 加入数据校验，并至少描述三类测试用例：普通、边界与错误情况。
- 留出两分钟复读程序，重点检查循环中的"差一错误"和比较运算符是否写错。
A typical testing answer might be: for a program that accepts marks from 0 to 100, test 0 and 100 (boundary), 57 (normal), and −3 or abc (erroneous).
一个典型的测试答案可以这样写：对于接受 0 到 100 分成绩的程序，测试 0 与 100（边界）、57（普通）、−3 或 abc（错误输入）。
10. Computer Systems: Hardware, Software and the Stored Program Model | 计算机系统：硬件、软件与存储程序模型
The theory of computer systems is examined in Paper 1 and connects directly to how your own programs run. Learn the fetch-decode-execute cycle as a causal chain rather than a list of words.
计算机系统理论在试卷一中考查，并且与你自己的程序如何运行直接相关。请把"取指—译码—执行"周期当作一条因果链来学，而不是一串需要背诵的词。
- Von Neumann architecture: a single memory holding both instructions and data, with the CPU, memory and buses connected.
- Registers: program counter, memory address register, memory data register, current instruction register and accumulator.
- Clock speed in gigahertz, cores and cache size as factors affecting performance, and why doubling cores does not always double speed.
- Memory hierarchy: registers, cache, RAM, and secondary storage, traded off against speed, cost and volatility.
- Compilers vs interpreters: a compiler translates the whole source program before execution and produces an executable, while an interpreter translates and executes line by line.
- 冯·诺依曼结构：指令与数据存放在同一存储器中，CPU、存储器与总线相互连接。
- 寄存器：程序计数器、存储器地址寄存器、存储器数据寄存器、当前指令寄存器与累加器。
- 时钟频率（GHz）、核心数与缓存容量是影响性能的因素，以及为什么核心数翻倍并不总是速度翻倍。
- 存储层次：寄存器、缓存、内存与外存，在速度、成本与易失性之间权衡。
- 编译器与解释器：编译器在执行前翻译整个源程序并生成可执行文件；解释器逐行翻译并执行。
Be able to explain the cycle in sequence: the PC holds the address of the next instruction, the MAR fetches it, the MDR carries it, the CIR decodes it, and the accumulator stores intermediate results before the PC increments.
要能按顺序解释这一周期：PC 保存下一条指令的地址，MAR 取址，MDR 传送，CIR 译码，累加器保存中间结果，随后 PC 自增。
11. Networks, Cybersecurity and Ethical Issues | 网络、网络安全与伦理议题
Network and security questions are usually scenario-based: you are given a specific organisation and asked to recommend a solution with reasons. Generic answers score poorly. Link every recommendation to the context, the cost and the level of risk.
网络与安全题通常基于情境：给定一个具体机构，要求你提出方案并说明理由。泛泛而谈的答案得分很低。请把每一条建议都与情境、成本与风险等级挂钩。
- Transmission media and performance: bandwidth, latency, and the effect of wired versus wireless connections.
- Protocols: TCP/IP for reliable delivery, HTTP/HTTPS for web traffic, and layered models that separate concerns.
- Threats: malware, phishing, social engineering, denial of service, and interception of unencrypted traffic.
- Countermeasures: firewalls, encryption, authentication, access levels, anti-malware, and physical security.
- Ethics and law: intellectual property, personal data protection, surveillance, and the impact of automation on employment.
- 传输介质与性能：带宽、延迟，以及有线与无线连接的差别。
- 协议：TCP/IP 保证可靠传输，HTTP/HTTPS 承载网页流量，分层模型用于分离关注点。
- 威胁：恶意软件、网络钓鱼、社会工程、拒绝服务攻击，以及未加密流量的被截获。
- 对策：防火墙、加密、身份验证、访问权限分级、反恶意软件与物理安全。
- 伦理与法律：知识产权、个人数据保护、监控，以及自动化对就业的影响。
Compression is worth revising alongside networks: lossless compression preserves all data and is essential for text and code, while lossy compression removes data that humans are unlikely to notice, which is acceptable for many images and for streamed audio.
压缩值得与网络一起复习：无损压缩保留全部数据，对文本和代码是必需的；有损压缩丢弃人耳人眼不易察觉的数据，对许多图像和流媒体音频是可接受的。
12. Eight-Week Summer Study Plan and Self-Assessment | 八周暑期学习计划与自我评估
广告 / Sponsored培生爱德思计算机科学学生用书教材Pearson Edexcel International GCSE Computer…计算机 备考教辅 · 正版现货 · 与本文内容相关查看详情 / View on Taobao参考价 ¥349.0
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图