📚 A-Level AQA Computer Science: Final Revision Checklist | A-Level AQA 计算机：期末复习提纲
Preparing for the AQA A-Level Computer Science (7517) examination requires a structured approach that covers programming, theory and the wider implications of technology. This revision checklist summarises the essential knowledge and skills for each topic, helping you focus your study and identify any gaps.
备考 AQA A-Level 计算机科学 (7517) 考试需要有结构化的方法，涵盖编程、理论以及技术的广泛影响。本复习提纲总结了每个主题的基本知识和技能，帮助您集中学习并找出不足。
1. Data Representation | 数据表示
Convert between binary, decimal and hexadecimal accurately, and understand why different bases are used. Use binary addition and subtraction, including two’s complement for negative integers. Recognise overflow errors and how they arise in a fixed-width register.
准确地在二进制、十进制和十六进制之间进行转换，并理解使用不同进制的原因。掌握二进制加法和减法，包括用补码表示负整数。能识别溢出错误及其在定宽寄存器中产生的原因。
Describe fixed-point and floating-point binary representation of real numbers using mantissa and exponent. Explain normalisation and the trade-off between range and precision. Convert between binary floating-point and decimal to a given precision.
能够描述使用尾数和指数表示实数的定点与浮点二进制形式。解释规格化以及范围与精度之间的权衡。在给定精度下进行二进制浮点数与十进制间的转换。
Understand how bitmaps encode images: resolution, colour depth and file size. Compare bitmap and vector graphic representations, including scalability and storage requirements. Explain the sampling process for sound and the impact of sample rate, bit depth and Nyquist theorem. Evaluate lossy vs lossless compression for text, image and sound.
理解位图如何编码图像：分辨率、颜色深度和文件大小。比较位图与矢量图的表示方式，包括可缩放性和存储需求。解释声音的采样过程以及采样率、位深度和奈奎斯特定理的影响。评估有损与无损压缩在文本、图像和声音中的应用。
2. Programming Fundamentals | 编程基础
Work confidently with primitive data types, constants, variables and assignment. Use structured programming constructs: sequence, selection (IF, CASE) and iteration (FOR, WHILE, REPEAT). Apply nested control structures and understand the importance of indentation for readability.
熟练使用基本数据类型、常量、变量和赋值。运用结构化编程构造：顺序、选择（IF, CASE）和迭代（FOR, WHILE, REPEAT）。应用嵌套控制结构，并理解缩进对可读性的重要性。
Write subroutines (procedures and functions) with parameters passed by value or by reference. Explain the advantages of using local variables and modular design. Distinguish between recursive and iterative solutions, and trace recursive algorithms such as factorial or Fibonacci.
编写带有按值或按引用传递参数的子程序（过程和函数）。解释使用局部变量和模块化设计的优势。区分递归与迭代解决方案，并追踪递归算法，如阶乘或斐波那契数列。
Use arrays, records and lists to store collections. Handle text files: open, read, write and close. Perform exception handling using try-catch mechanisms to make programs robust.
使用数组、记录和列表存储集合数据。处理文本文件：打开、读取、写入和关闭。使用 try-catch 机制进行异常处理以确保程序健壮性。
3. Data Structures and Abstract Data Types | 数据结构与抽象数据类型
Define and implement stacks (LIFO) and queues (FIFO, circular, priority) using arrays or linked lists. Provide the core operations: push, pop, peek, enqueue, dequeue, isEmpty, isFull. Recognise applications, such as call stacks, parsing and print spooling.
定义并实现栈（LIFO）和队列（FIFO、循环、优先级），可使用数组或链表。掌握核心操作：push, pop, peek, enqueue, dequeue, isEmpty, isFull。识别应用场景，如调用栈、语法分析和打印缓冲。
Distinguish between static and dynamic data structures. Explain linked lists (singly, doubly, circular) and how nodes store data and pointers. Compare insertion and deletion efficiencies.
区分静态与动态数据结构。解释链表（单向、双向、循环）以及节点如何存储数据和指针。比较插入和删除操作的效率。
Describe graphs (weighted, directed, undirected) and trees (binary trees, binary search trees). Implement traversal algorithms: depth-first and breadth-first for graphs; pre-order, in-order, post-order for trees. Outline hash tables and collision resolution (chaining, open addressing).
描述图（带权、有向、无向）和树（二叉树、二叉搜索树）。实现图的深度优先和广度优先遍历，以及树的先序、中序、后序遍历算法。概述哈希表与冲突解决方法（链地址法、开放地址法）。
4. Algorithms and Complexity | 算法与复杂度
Compare searching algorithms: linear search and binary search, in terms of steps and preconditions. Compare sorting algorithms: bubble, insertion and merge sort. Analyse time complexity using Big O notation, including best, average and worst cases.
比较搜索算法：线性搜索和二分搜索的步骤与先决条件。比较排序算法：冒泡排序、插入排序和归并排序。使用大O符号分析时间复杂度，包括最好、平均和最坏情况。
Express complexity classes: O(1), O(log n), O(n), O(n log n), O(n²). Derive the complexity of simple nested loops and recursive algorithms. Solve recurrence relations for algorithms like merge sort: T(n) = 2T(n/2) + O(n).
表示复杂度类别：O(1)、O(log n)、O(n)、O(n log n)、O(n²)。推导简单嵌套循环和递归算法的复杂度。求解诸如归并排序的递推关系：T(n) = 2T(n/2) + O(n)。
Apply algorithmic thinking to solve problems: abstraction, decomposition, pattern recognition. Model problems using graphs (shortest path with Dijkstra’s algorithm) and trees (e.g. minimax for game playing).
运用算法思维解决问题：抽象、分解、模式识别。使用图（Dijkstra 最短路径算法）和树（如博弈的极小化极大算法）对问题建模。
5. Theory of Computation | 计算理论
Model problems with finite state machines (FSMs) and acceptors. Draw state transition diagrams and specify state transition tables. Distinguish between deterministic and non-deterministic FSMs. Apply Mealy machines where outputs depend on state and input.
用有限状态机 (FSM) 和接受器为问题建模。绘制状态转换图并写出状态转换表。区分确定性与非确定性 FSM。应用输出依赖于状态和输入的 Mealy 机。
Explain the Turing machine model and the concept of a universal Turing machine. Understand the Church-Turing thesis and the notion of computability. Identify problems that are undecidable, such as the halting problem.
解释图灵机模型及通用图灵机的概念。理解邱奇-图灵论题和可计算性概念。识别不可判定问题，如停机问题。
Classify problems by complexity: tractable (polynomial time), intractable, and NP-hard. Explain the significance of P vs NP and how heuristics are used for intractable problems.
按复杂度对问题分类：可处理（多项式时间）、难处理及 NP-hard。解释 P vs NP 的重要性，以及对于难处理问题如何使用启发式。
6. Computer Architecture and the Fetch-Execute Cycle | 计算机体系结构与取指执行周期
Outline the Von Neumann architecture: CPU, memory, input/output, stored program concept. Describe registers: PC, MAR, MDR, CIR, ACC. Explain the fetch-decode-execute cycle step by step, including how the address bus, data bus and control bus are used.
概述冯·诺依曼体系结构：CPU、存储器、输入/输出、存储程序概念。描述寄存器：PC、MAR、MDR、CIR、ACC。逐步解释取指-译码-执行周期，包含地址总线、数据总线和控制总线的使用。
Compare CISC and RISC processor philosophies. Understand pipelining and how it improves throughput. Explain the role of cores and parallel processing, and identify hazards that reduce performance.
比较 CISC 与 RISC 处理器设计理念。理解流水线及其如何提高吞吐量。解释核心和并行处理的作用，并识别降低性能的冲突。
Describe the memory hierarchy: registers, cache, RAM, secondary storage. Discuss cache mapping (direct, associative) and the principle of locality. Compare magnetic, optical and solid-state storage in terms of speed, volatility and durability.
描述存储器层次结构：寄存器、缓存、RAM、辅助存储器。讨论缓存映射（直接映射、相联映射）和局部性原则。从速度、易失性和耐用性方面比较磁、光和固态存储。
7. Boolean Algebra and Logic Circuits | 布尔代数与逻辑电路
Simplify Boolean expressions using identities, De Morgan’s laws, and Karnaugh maps (up to four variables). Represent logic circuits using AND, OR, NOT, NAND, NOR, XOR and XNOR gates. Convert between logic diagrams, truth tables and Boolean expressions.
使用恒等式、德摩根定律和卡诺图（最多四变量）化简布尔表达式。使用与、或、非、与非、或非、异或和同或门表示逻辑电路。在逻辑图、真值表和布尔表达式之间进行转换。
Understand half adders and full adders, and how they can be combined to form a ripple-carry adder. Explain the role of flip-flops (SR, JK, D) as sequential logic elements, and construct state diagrams for simple counters.
理解半加器和全加器，以及它们如何组合构成行波进位加法器。解释触发器（SR、JK、D）作为时序逻辑元件的作用，并为简单计数器构建状态图。
Apply Boolean algebra to solve control and decision problems, e.g. designing a two-way traffic light controller. Recognise that any Boolean function can be implemented using only NAND or NOR gates.
应用布尔代数解决控制和决策问题，例如设计双向交通灯控制器。认识到任意布尔函数均可仅用与非门或或非门实现。
8. System Software, Operating Systems and Assembly Language | 系统软件、操作系统与汇编语言
Categorise software: application, system (OS, utilities, libraries), translators. Explain the role of an operating system: memory management, scheduling, handling interrupts, providing a user interface and managing peripherals.
对软件分类：应用软件、系统软件（操作系统、实用程序、库）、翻译器。解释操作系统的作用：内存管理、调度、处理中断、提供用户界面和管理外设。
Compare compilers, interpreters and assemblers. Understand the translation process: lexical analysis, syntax analysis, code generation and optimisation. Distinguish between assembly language and machine code, and use an instruction set (e.g. LMC) to write simple assembly programs with mnemonics like LDA, STA, ADD, SUB, BRZ.
比较编译器、解释器和汇编器。理解翻译过程：词法分析、语法分析、代码生成和优化。区分汇编语言和机器码，并使用指令集（如 LMC）编写简单汇编程序，使用如 LDA、STA、ADD、SUB、BRZ 等助记符。
Describe different types of operating system: batch, real-time, multi-tasking, distributed. Explain scheduling algorithms: round robin, first come first served, shortest job first, and evaluate their impact on processor utilisation.
描述不同类型的操作系统：批处理、实时、多任务、分布式。解释调度算法：轮转、先来先服务、最短作业优先，并评估其对处理器利用率的影响。
9. Communication and Networking | 通信与网络
Describe network topologies: star, bus, ring, mesh; compare their advantages and reliability. Distinguish between LAN, WAN, WLAN and VPN. Explain the roles of network hardware: NIC, hub, switch, router, gateway, wireless access point.
描述网络拓扑：星型、总线、环形、网状；比较其优势与可靠性。区分 LAN、WAN、WLAN 和 VPN。解释网络硬件的作用：网卡、集线器、交换机、路由器、网关、无线接入点。
Understand the TCP/IP stack: application, transport, internet and link layers. Relate protocols to layers: DNS, HTTP, FTP, SMTP at application; TCP/UDP at transport; IP at internet. Explain the process of packet switching and how error detection (checksum, CRC) is used.
理解 TCP/IP 协议栈：应用层、传输层、互联网层和链路层。将协议与各层对应：DNS、HTTP、FTP、SMTP 在应用层；TCP/UDP 在传输层；IP 在互联网层。解释分组交换过程以及如何使用差错检测（校验和、CRC）。
Outline client-server and peer-to-peer network models. Network security: firewalls, encryption (symmetric, asymmetric, public key), digital signatures. Understand the purpose of DHCP and NAT in IP address management.
概述客户-服务器和对等网络模型。网络安全：防火墙、加密（对称、非对称、公钥）、数字签名。理解 DHCP 和 NAT 在 IP 地址管理中的作用。
10. Databases, SQL and Big Data | 数据库、SQL 与大数据
Explain the relational database model: tables, fields, records, primary keys, foreign keys, entity relationships. Normalise relations to third normal form (3NF) to reduce redundancy and anomalies.
解释关系数据库模型：表、字段、记录、主键、外键、实体关系。将关系规范化为第三范式 (3NF) 以减少冗余和异常。
Write and interpret SQL queries: SELECT, FROM, WHERE, JOIN, GROUP BY, HAVING, ORDER BY, aggregate functions (COUNT, AVG, SUM). Use INSERT, UPDATE, DELETE to modify data. Design queries for reports and data retrieval.
编写并解释 SQL 查询：SELECT、FROM、WHERE、JOIN、GROUP BY、HAVING、ORDER BY 及聚合函数（COUNT、AVG、SUM）。使用 INSERT、UPDATE、DELETE 修改数据。设计用于报表和数据检索的查询。
Define big data characteristics: volume, velocity, variety, veracity. Compare relational databases with non-relational (NoSQL) approaches. Discuss data mining, machine learning and their ethical use in personal data analysis.
定义大数据的特征：大量、高速、多样、真实性。比较关系数据库与非关系 (NoSQL) 方法。讨论数据挖掘、机器学习及其在个人数据分析中的伦理使用。
11. Functional Programming | 函数式编程
Understand the functional programming paradigm: pure functions, immutability, statelessness, no side effects. Explain first-class functions, higher-order functions and function composition. Apply map, filter and reduce (fold) to process lists.
理解函数式编程范式：纯函数、不可变性、无状态、无副作用。解释一等函数、高阶函数和函数组合。应用 map、filter 和 reduce (fold) 处理列表。
Write simple functional expressions using list comprehensions. Evaluate recursive functions without assignment, using pattern matching and base/recursive cases. Compare the functional approach with imperative style for clarity and debugging.
使用列表推导式编写简单的函数表达式。在不使用赋值的情况下，通过模式匹配和基例/递归情况评估递归函数。比较函数式方法与命令式风格在清晰性和调试方面的差异。
Recognise common functional idioms: currying, partial application, lambda expressions. Understand how a functional language evaluates expressions via lazy evaluation and how this differs from eager evaluation.
识别常见的函数式惯用法：柯里化、部分应用、lambda 表达式。理解函数式语言如何通过惰性求值计算表达式，以及这与严格求值的区别。
12. Legal, Social, Moral and Ethical Issues | 法律、社会、道德与伦理问题
Discuss key legislation: Data Protection Act, Computer Misuse Act, Regulation of Investigatory Powers Act (RIPA), Copyright, Designs and Patents Act, and the impact of GDPR. Apply these to scenarios such as hacking, data breaches and software piracy.
讨论关键立法：数据保护法、计算机滥用法、调查权力规制法 (RIPA)、版权、设计和专利法，以及 GDPR 的影响。将这些应用于黑客攻击、数据泄露和软件盗版等场景。
Evaluate ethical dilemmas posed by emerging technologies: artificial intelligence, autonomous vehicles, facial recognition, surveillance. Use ethical frameworks (utilitarianism, deontology) to articulate reasoned arguments about privacy, bias and digital divide.
评估新兴技术带来的伦理困境：人工智能、自动驾驶汽车、人脸识别、监控。运用伦理框架（功利主义、道义论）就隐私、偏见和数字鸿沟给出有说服力的论证。
Analyse the social impact of the internet, including online censorship, echo chambers, fake news and the role of social media. Discuss the moral responsibility of software developers to produce secure, accessible and environmentally sustainable code.
分析互联网的社会影响，包括在线审查、信息茧房、假新闻和社交媒体的作用。讨论软件开发者在编写安全、可访问且环境可持续的代码方面的道德责任。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply