📚 In-Depth Analysis of AS AQA Computer Science Past Papers | AS AQA 计算机：历年真题深度解析
The AS AQA Computer Science (7516) qualification challenges students with a blend of theory and practical programming. Analysing past papers is one of the most effective ways to prepare. This guide provides a systematic exploration of common question types, examiner expectations, and strategies for maximising marks.
AS AQA 计算机科学（7516）资格结合了理论与实际编程，对学生构成挑战。分析历年真题是最有效的备考方式之一。本指南系统性地剖析了常见题型、考官期望以及最大化分数的策略。
1. Understanding the Exam Structure | 理解考试结构
The AS qualification consists of two papers: Paper 1 (on-screen programming and problem solving) and Paper 2 (written theory). Paper 1 is taken on a computer and involves coding tasks, while Paper 2 tests knowledge of computer systems, data representation, and more.
AS 资格包含两份试卷：试卷1（上机编程与问题解决）和试卷2（书面理论）。试卷1在计算机上完成，包含编程任务，而试卷2考察计算机系统、数据表示等知识。
Each paper is 1 hour 30 minutes long and carries equal weighting. Familiarity with the structure helps you allocate study time effectively.
每份试卷时长1小时30分钟，权重相等。熟悉结构有助于有效分配学习时间。
Past papers from 2017 onwards reflect the current specification. Reviewing them reveals patterns in question styles and topics.
2017年以后的历年真题反映了当前大纲。回顾它们可揭示出题风格和主题的规律。
2. Data Representation and Number Systems | 数据表示与数制系统
Questions on binary, hexadecimal, and data units appear in nearly every Paper 2. You must be confident converting between binary and denary, and performing addition of binary integers.
关于二进制、十六进制和数据单位的问题几乎出现在每份试卷2中。你必须熟练地进行二进制与十进制转换，以及二进制整数加法。
A typical question asks: ‘Convert the denary number 157 into an 8-bit binary number.’ The solution requires repeated division by 2. The binary representation is 10011101.
一个典型问题是：“将十进制数157转换为8位二进制数。”解决方法需要用2反复相除。二进制表示为10011101。
Hexadecimal is commonly used to represent colours in HTML or memory addresses. For example, A2₁₆ = 162₁₀. Understanding nibbles and bytes is essential.
十六进制常用于表示HTML颜色或内存地址。例如，A2₁₆ = 162₁₀。理解半字节和字节至关重要。
Sound and image representation also appear: sampling rate, bit depth, resolution. Be prepared to calculate file sizes.
声音和图像表示也会出现：采样率、位深度、分辨率。要准备好计算文件大小。
File size (bits) = sample rate × bit depth × duration (seconds)
文件大小（位） = 采样率 × 位深度 × 时长（秒）
3. Programming Fundamentals and Pseudocode | 编程基础与伪代码
Paper 1 requires writing pseudocode and possibly programming in a high-level language. AQA pseudocode uses keywords like WHILE, ENDWHILE, IF, ELSE, OUTPUT, and FOR.
试卷1要求编写伪代码，并可能使用高级语言编程。AQA伪代码使用诸如WHILE、ENDWHILE、IF、ELSE、OUTPUT和FOR等关键字。
Common tasks include input validation, iteration over arrays, and string manipulation. Examiner reports often highlight missing indentation or incorrect loop termination.
常见任务包括输入验证、数组遍历和字符串操作。考官报告经常指出缺少缩进或循环终止条件错误。
Example: ‘Write pseudocode to count the number of vowels in a string.’ You need a loop that checks each character against the set {‘a’,’e’,’i’,’o’,’u’}.
示例：“编写伪代码计算字符串中元音的数量。”你需要一个循环，将每个字符与集合{‘a’,’e’,’i’,’o’,’u’}进行比较。
Trace tables are also tested. Practice stepping through code with variables to predict outputs.
追踪表也在考试范围内。练习通过变量逐步执行代码以预测输出。
4. Data Structures: Arrays, Lists, and Stacks | 数据结构：数组、列表和栈
AS exams focus on one- and two-dimensional arrays, singly linked lists, and stacks. You must understand static vs dynamic data structures.
AS考试重点考察一维和二维数组、单向链表和栈。你必须理解静态与动态数据结构的区别。
A typical array question: ‘Given the array numbers = [4, 7, 1, 9], what is numbers[2]?’ The answer is 1 (0-indexed in pseudocode). Be aware of indexing conventions.
典型的数组题：“给定数组 numbers = [4, 7, 1, 9]，numbers[2]的值是多少？”答案是1（伪代码中索引从0开始）。注意索引约定。
Stacks involve PUSH and POP operations. Past questions ask you to show the state of a stack after a series of operations. Remember LIFO principle.
栈涉及PUSH和POP操作。历年题目要求你展示一系列操作后栈的状态。记住后进先出原则。
Linked lists: be able to draw diagrams showing nodes with data and pointers. Insertion and deletion of nodes is a key skill.
链表：要能绘制包含数据和指针的节点示意图。节点的插入与删除是一项关键技能。
5. Algorithms: Searching and Sorting | 算法：搜索与排序
Linear search and binary search are regularly examined. You may be asked to describe the steps or list the number of comparisons needed for a sorted list. Binary search requires a sorted array.
线性搜索和二分搜索经常考。你可能被要求描述步骤，或列出在有序列表中所需的比较次数。二分搜索要求数组已排序。
Sorting algorithms: bubble sort is the most common. Understand how it compares adjacent items and swaps if necessary. Express time complexity using Big O notation:
排序算法：冒泡排序最常见。理解它如何比较相邻项并在必要时交换。用大O表示法表达时间复杂度：
Bubble sort worst case: O(n²)
冒泡排序最坏情况：O(n²)
Past papers often show a partially completed bubble sort and ask you to fill in the missing values after a pass.
真题经常展示一个部分完成的冒泡排序，要求你填入一次遍历后缺失的值。
6. Computer Systems and Architecture | 计算机系统与体系结构
The fetch-decode-execute cycle is a core concept. Be ready to explain the role of the program counter (PC), memory address register (MAR), and memory data register (MDR).
取指-解码-执行周期是核心概念。准备好解释程序计数器（PC）、存储器地址寄存器（MAR）和存储器数据寄存器（MDR）的作用。
Von Neumann architecture features a single shared memory for data and instructions, while Harvard architecture uses separate memories. Past questions compare them.
冯·诺依曼体系结构的特点是数据和指令共享单一存储器，而哈佛体系结构使用独立的存储器。真题会进行比较。
Factors affecting CPU performance: clock speed, number of cores, and cache size. Exam questions often ask you to evaluate a scenario.
影响CPU性能的因素：时钟速度、核心数和缓存大小。考题常要求你评估某个场景。
Secondary storage: magnetic, optical, solid state. Know their characteristics and suitable uses, e.g., SSD for fast boot times.
辅助存储器：磁、光、固态。了解它们的特性和适用场景，如SSD用于快速启动。
7. Networking and the Internet | 网络与互联网
Network topologies: star and bus are the focus. Star topology provides better fault tolerance. The role of network protocols: TCP/IP, HTTP, FTP, SMTP, etc. must be known.
网络拓扑：星型和总线是重点。星型拓扑提供更好的容错性。网络协议的作用：TCP/IP、HTTP、FTP、SMTP等必须掌握。
Packet switching: data is split into packets, each with a header containing destination address. Routers direct packets independently.
包交换：数据被分割成数据包，每个包有一个包含目标地址的包头。路由器独立地引导数据包。
Layered models: the TCP/IP stack has application, transport, internet, and link layers. Past questions ask you to identify which layer a given protocol operates at.
分层模型：TCP/IP协议栈有应用层、传输层、互联网层和链路层。真题会要求你识别某个协议在哪个层运行。
8. Databases and SQL Queries | 数据库与SQL查询
Relational database concepts: primary key, foreign key, entity, table. You need to write simple SQL SELECT statements with WHERE conditions.
关系数据库概念：主键、外键、实体、表。你需要编写带WHERE条件的简单SQL SELECT语句。
Example: ‘SELECT name, grade FROM Students WHERE grade > 70 ORDER BY name ASC’ will be familiar. Always check for correct syntax and required columns.
例如：“SELECT name, grade FROM Students WHERE grade > 70 ORDER BY name ASC”会很熟悉。始终检查语法正确性以及所需列。
Past papers may include updating data with UPDATE or INSERT. Understand the effect of DELETE and referential integrity.
真题可能包括用UPDATE或INSERT更新数据。理解DELETE的影响和参照完整性。
9. Computational Thinking and Problem Solving | 计算思维与问题解决
Abstraction, decomposition, and pattern recognition are fundamental to computational thinking. Paper 1 often presents a problem scenario, requiring you to break it down.
抽象、分解和模式识别是计算思维的基础。试卷1常给出一个问题情境，要求你将其分解。
Designing solutions: you might be asked to produce an algorithm from a description. Use pseudocode with clear variable names and comments.
设计解决方案：可能要求你根据描述设计算法。使用伪代码，带有明确的变量名和注释。
Thinking logically: trace through algorithms with test data to verify correctness. Always consider edge cases, e.g., empty input or maximum values.
逻辑思考：用测试数据跟踪算法以验证正确性。始终考虑边缘情况，如空输入或最大值。
10. Common Pitfalls in Past Papers | 历年真题中的常见陷阱
Many students lose marks due to off-by-one errors in loops. In AQA pseudocode, a FOR loop from 0 to n-1 iterates n times; using <= n would cause an extra iteration.
许多学生由于循环中的差一错误而丢分。在AQA伪代码中，FOR循环从0到n-1迭代n次；使用<=n会导致额外迭代。
Misunderstanding data types: treating a string as an integer leads to errors. Always convert as needed using functions like STRING_TO_INT.
误解数据类型：将字符串视为整数会导致错误。始终使用STRING_TO_INT等函数按需转换。
Ignoring marks for elegance: examiners reward efficient algorithms. Using nested loops when a single loop would suffice wastes marks.
忽视算法的优雅性：考官奖励高效算法。在单个循环就足够的情况下使用嵌套循环会损失分数。
11. Exam Technique and Time Management | 考试技巧与时间管理
Spend roughly 1 minute per mark. If a question is worth 6 marks, allocate about 6 minutes. Leave time for checking, especially in Paper 1 for debugging code.
大约每分值花1分钟。如果一道题值6分，分配约6分钟。留出检查时间，特别是在试卷1中调试代码。
Read the question carefully: underline command words like ‘state’, ‘describe’, ‘explain’. The depth of response varies accordingly.
仔细读题：在‘陈述’、‘描述’、‘解释’等指令词下划线。回答的深度将相应变化。
For coding tasks, write pseudocode clearly and use proper indentation. If stuck, annotate what you intend to do; partial marks are often available.
对于编程任务，清晰地编写伪代码并使用适当的缩进。如果卡住，注释你打算做什么；通常会得到部分分数。
12. Using Mark Schemes Effectively | 有效利用评分方案
After attempting a past paper, compare your answers to the official mark scheme. Identify where you missed marks and understand the required terminology.
在尝试完一套真题后，将你的答案与官方评分方案进行比对。找出丢分之处并理解所需术语。
Mark schemes often reveal that ‘because’ or ‘therefore’ statements are needed for explanation marks. Bullet-point lists are acceptable and can save time.
评分方案常显示，解释题需要‘因为’或‘因此’等陈述以获得分数。项目符号列表是可接受的，并能节省时间。
Create a revision log of recurring mistakes. This transforms past papers from a test into a powerful learning tool.
建立一个循环错误的复习日志。这将使真题从测试转变为强大的学习工具。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导