📚 Year 10 Eduqas Computer Science: In-Depth Analysis of Past Papers | Year 10 Eduqas 计算机：历年真题深度解析
Working through past papers is one of the most effective ways to prepare for your Eduqas Computer Science assessments. This article breaks down common question types, recurring topics and examiner expectations so that Year 10 students can target their revision with confidence. By analysing real exam trends, we uncover exactly what you need to practise to move from a pass to a top grade.
练习历年真题是备考 Eduqas 计算机科学考试最有效的方法之一。这篇文章将拆解常见题型、高频考点以及考官期望，帮助 Year 10 的学生有针对性地进行复习。通过分析真实考题趋势，我们将揭示从及格迈向高分的精准练习方向。
1. Exam Structure Overview | 试卷结构概览
The Eduqas GCSE Computer Science qualification is assessed through two components. Component 1 (Understanding Computer Science) is a 1-hour 45-minute written paper worth 62.5% of the total marks. Component 2 (Computational Thinking and Programming) is a 2-hour on-screen exam worth 37.5%. Year 10 students usually encounter Component 1 content first, covering theory such as hardware, networks, ethics and data representation. Both papers mix short-answer questions, structured questions and extended writing.
Eduqas GCSE 计算机科学由两个模块考核。模块一（理解计算机原理）为 1 小时 45 分钟的笔试，占总分 62.5%。模块二（计算思维与编程）为 2 小时的上机考试，占 37.5%。Year 10 学生通常会先接触模块一的理论内容，涵盖硬件、网络、伦理和数据表示等。两份试卷均包含简答题、结构化问题和扩展写作题。
| Component | Weighting | Duration | Key Focus |
|---|---|---|---|
| Component 1 | 62.5% | 1 hr 45 min | Theory: architecture, networks, ethics, data |
| Component 2 | 37.5% | 2 hours | Programming, algorithms, logic |
2. Data Representation Essentials | 数据表示核心要点
Past papers consistently ask you to convert between binary, denary and hexadecimal. You must be able to apply binary addition and understand overflow. Exam questions also test character sets (ASCII and Unicode), image representation (pixels, colour depth and resolution) and sound representation (sampling rate, bit depth). A typical question might give you a binary number and ask for its denary equivalent, or challenge you to calculate the file size of a bitmap image.
历年真题经常要求你在二进制、十进制和十六进制之间进行转换。你必须掌握二进制加法并理解溢出的概念。考题还会测试字符集（ASCII 和 Unicode）、图像表示（像素、色深和分辨率）以及声音表示（采样率、采样位数）。一道典型的题目可能会给出一个二进制数，要求你写出等值的十进制数，或者让你计算一幅位图图像的文件大小。
Key conversion to memorise: nd file size = sample rate × bit depth × duration in seconds. Always show your working out – marks are awarded for method.
需要熟记的换算关系：1 字节 = 8 比特，1 kB = 1024 字节。图像文件大小公式为：宽度像素 × 高度像素 × 色深（比特）。声音文件大小 = 采样率 × 采样位数 × 时长（秒）。务必展示计算步骤——方法分同样计分。
Image file size = width × height × colour depth (bits)
3. System Architecture and CPU | 系统架构与中央处理器
The Von Neumann architecture is a cornerstone of Component 1. You are expected to label a diagram showing the CPU with Control Unit (CU), Arithmetic Logic Unit (ALU), registers (Program Counter, Memory Address Register, Memory Data Register, Accumulator) and buses (address, data, control). Past papers often ask you to describe the fetch-decode-execute cycle. Use precise terms: the Program Counter holds the address of the next instruction; the instruction is fetched from main memory and placed in the MDR; the CU decodes it; then the ALU executes it.
冯·诺依曼体系是模块一的基石。你需要为一幅 CPU 示意图标注控制单元（CU）、算术逻辑单元（ALU）、寄存器（程序计数器、存储器地址寄存器、存储器数据寄存器、累加器）以及总线（地址总线、数据总线、控制总线）。历年真题常要求你描述取指-译码-执行周期。请使用精确术语：程序计数器存放下一条指令的地址；指令从主存取出并放入 MDR；CU 将其译码；然后 ALU 执行。
Be ready to explain how clock speed, cache memory and the number of cores affect performance. A 3-mark question might state: 'Explain why a dual-core processor with a larger cache performs better than a single-core processor with a smaller cache.' Your answer should link faster access to frequently used data (cache) and parallel processing (cores).
准备好解释时钟速度、高速缓存以及核心数量如何影响性能。一道 3 分的题目可能会陈述：“解释为什么拥有更大缓存的同速双核处理器比缓存更小的单核处理器性能更好。”你的回答应将更快的常用数据访问（缓存）与并行处理（核心）联系起来。
4. Networks and Security | 网络与安全
Eduqas papers regularly feature questions on network topologies (star, mesh, bus), IP and MAC addressing, and protocols such as HTTP, HTTPS, FTP, SMTP, POP3 and IMAP. You must know the purpose of each protocol and which layer of the TCP/IP stack it belongs to. The four layers are Application, Transport, Internet and Link. A classic exam question asks: 'Explain why HTTPS is more secure than HTTP.' Your response must describe encryption and the role of SSL/TLS certificates in authenticating websites.
Eduqas 试卷经常涉及网络拓扑结构（星形、网状、总线型）、IP 与 MAC 地址，以及 HTTP、HTTPS、FTP、SMTP、POP3 和 IMAP 等协议。你必须知道每个协议的用途及其所属的 TCP/IP 协议栈层次。四层分别是应用层、传输层、互联网层和链路层。一道经典考题会问：“解释为什么 HTTPS 比 HTTP 更安全。”你的回答必须描述加密以及 SSL/TLS 证书在验证网站身份中的作用。
Cybersecurity threats also appear: malware (viruses, worms, Trojans), phishing, denial-of-service attacks, and social engineering. For each, you must be able to describe how it works and suggest a prevention method. For instance, a firewall filters incoming and outgoing traffic based on rules; anti-malware software scans for malicious code; user education reduces the risk of phishing.
网络安全威胁也会出现：恶意软件（病毒、蠕虫、特洛伊木马）、网络钓鱼、拒绝服务攻击和社会工程学。对于每一项，你必须能描述其工作原理并提出一种防范措施。例如，防火墙根据规则过滤进出流量；反恶意软件扫描恶意代码；用户教育可降低网络钓鱼的风险。
5. Programming Concepts and Pseudocode | 编程概念与伪代码
Component 2 requires you to write, trace and debug pseudocode. Eduqas uses a specific pseudocode style that includes keywords like INPUT, OUTPUT, IF...THEN...ENDIF, WHILE...ENDWHILE, FOR...ENDFOR. Indentation shows structure. Past questions often give incomplete pseudocode and ask you to fill in blanks to make a loop count from 1 to 10, or to add validation. You must also be able to use arithmetic operators (+, -, *, /, MOD, DIV) and logical operators (AND, OR, NOT).
模块二要求你编写、追踪和调试伪代码。Eduqas 使用特定的伪代码风格，包含关键词如 INPUT, OUTPUT, IF...THEN...ENDIF, WHILE...ENDWHILE, FOR...ENDFOR。缩进体现结构。历年题目常给出不完整的伪代码，要求你填空，使循环从 1 计数到 10，或添加输入验证。你还必须能够使用算术运算符（+, -, *, /, MOD, DIV）和逻辑运算符（AND, OR, NOT）。
Variables, constants and data types (integer, real, Boolean, string, character) are tested frequently. A typical trace-table question asks you to step through a loop and record how variables change. Be meticulous: create a column for every variable and update values line by line. Even a single off-by-one error in a trace table can lose you all marks for that question.
变量、常量和数据类型（整型、实型、布尔型、字符串、字符）经常被考查。一道典型的追踪表题目要求你逐步执行循环并记录变量如何变化。务必仔细：为每个变量建立一列，并逐行更新数值。即使在追踪表中出现一次偏差错误，也可能导致整道题目的全部分数丢失。
6. Algorithms and Flowcharts | 算法与流程图
Search and sort algorithms appear in almost every paper. You must know linear search and binary search, as well as bubble sort and merge sort. Be prepared to compare their efficiency: binary search requires a sorted list but is O(log n), whereas linear search works on unsorted data but is O(n). Past questions may show a flowchart of a search algorithm and ask you to complete it or describe what it does. Learn the standard flowchart symbols: oval for start/end, parallelogram for input/output, rectangle for process, diamond for decision.
搜索和排序算法几乎出现在每份试卷中。你必须了解线性搜索和二分搜索，以及冒泡排序和归并排序。准备好比较它们的效率：二分搜索需要有序列表，时间复杂度为 O(log n)；而线性搜索可以在无序数据上工作，但时间复杂度为 O(n)。历年题目可能展示一个搜索算法的流程图，让你补充完整或描述其功能。请熟记标准流程图符号：椭圆形表示开始/结束，平行四边形表示输入/输出，矩形表示处理过程，菱形表示判断。
Another favourite is the trace of a sorting algorithm. For bubble sort, you may be asked to show the list after each pass. Use a clear layout, showing comparisons and swaps. For example, after the first pass the largest element 'bubbles' to the end. Practise writing pseudocode for both algorithms as well.
另一个常见题型是追踪排序算法。对于冒泡排序，你可能需要展示每一轮遍历后的列表。使用清晰的格式，显示比较和交换。例如，第一轮之后，最大的元素会“冒泡”到末尾。同时也要练习为这两种算法编写伪代码。
7. Logic Gates and Boolean Logic | 逻辑门与布尔逻辑
gates. Know their truth tables by heart. Past papers often give a logic circuit diagram and ask you to complete a truth table for the whole circuit, or to write a Boolean expression. A typical expression might be Q = (A AND B) OR (NOT C).
逻辑门是模块一的基础内容，偶尔也会出现在模块二中。你必须会画并识别 NOT、AND、OR、NAND 和 NOR 门的符号，并牢记它们的真值表。历年真题通常会给出一张逻辑电路图，要求你完成整个电路的真值表，或写出布尔表达式。一个典型的表达式可能为 Q = (A AND B) OR (NOT C)。
| A | B | A AND B | A OR B | NOT A |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 |
on. Practise simplifying simple Boolean expressions using the laws of Boolean logic, such as A AND 0 = 0, A OR 1 = 1 and double negation.
你可能还需要根据现实场景创建逻辑电路，例如当温度低且定时器打开时，加热系统启动。请练习使用布尔逻辑定律化简简单的布尔表达式，例如 A AND 0 = 0，A OR 1 = 1，以及双重否定律。
8. Ethical, Legal and Environmental Issues | 伦理、法律与环境影响
The final section of Component 1 often contains extended-response questions on computing's impact. You must be able to discuss the Data Protection Act (2018), Computer Misuse Act (1990), Copyright, Designs and Patents Act (1988), and the Freedom of Information Act (2000). Know the principles of each: the Data Protection Act requires personal data to be processed lawfully, fairly and transparently; the Computer Misuse Act makes unauthorised access to computer material illegal.
模块一的最后部分通常包含关于计算机影响的扩展回答题。你必须能够讨论《数据保护法》（2018）、《计算机滥用法》（1990）、《版权、外观设计与专利法》（1988）以及《信息自由法》（2000）。了解每部法律的原则：《数据保护法》要求个人数据被合法、公平且透明地处理；《计算机滥用法》规定未经授权访问计算机材料属于违法行为。
Environmental topics include the energy consumption of data centres and e-waste. Ethical discussions might involve artificial intelligence bias, facial recognition technology or the digital divide. A 6-mark question could ask: 'Discuss the ethical and environmental concerns of increasing reliance on cloud computing.' Your answer should present a balanced argument with specific examples, such as the carbon footprint of server farms and the benefit of reduced local hardware.
环境议题包括数据中心的能源消耗和电子垃圾。伦理讨论可能涉及人工智能偏见、人脸识别技术或数字鸿沟。一道 6 分的题目可能会问：“讨论对云计算日益依赖所引发的伦理和环境问题。”你的回答应提出平衡的观点，并给出具体例子，如服务器农场的碳足迹与减少本地硬件的好处。
9. Extended Response Strategies | 扩展回答策略
For high-tariff questions (4–6 marks), examiners look for precise terminology and a logical sequence. Use the 'PEEL' structure: Point, Evidence, Explanation, Link. If asked to recommend a network topology for a school, state your recommendation (Point), reference factors like cost and reliability (Evidence), explain why a star topology allows easy fault isolation (Explanation), and link back to the needs of the school (Link). Avoid vague statements; always underpin claims with technical facts.
对于高分值题目（4–6 分），考官看重精确的术语和逻辑顺序。使用“PEEL”结构：观点、证据、解释、联系。如果被问及为学校推荐一种网络拓扑结构，先陈述你的推荐（观点），引用成本和可靠性等因素（证据），解释星形拓扑为何便于故障隔离（解释），然后联系回学校的需要（联系）。避免模糊的说法；始终用技术事实支撑论断。
Time management is crucial. Allocate roughly one minute per mark. For a 6-mark question, spend no more than 7 minutes. Plan briefly in the margin: bullet-point your key arguments before writing. This prevents you from rambling and ensures you cover all strands of the mark scheme. Eduqas mark schemes often split marks into 'band descriptors'; thus, a well-structured and technically accurate answer will reach the top band.
时间管理至关重要。大约按每分钟一分的节奏分配。对于一道 6 分题，花的时间不要超过 7 分钟。在页边空白处简单规划：先用要点列出关键论点再动笔。这能防止你跑题，并确保覆盖评分标准的所有方面。Eduqas 的评分标准常将分数划分为“等级描述符”；因此，结构清晰、技术准确的答案才能达到最高等级。
10. Common Pitfalls and How to Avoid Them | 常见失分点与应对方法
One of the most frequent mistakes is confusing similar-sounding terms. For instance, the Address Bus carries memory addresses, while the Data Bus carries actual data. Mixing them up in a diagram labelling question loses easy marks. Another common error is forgetting to convert units when calculating file sizes: if width and height are in pixels and colour depth is in bits, your result will be in bits – you may need to convert to bytes or kilobytes.
最常见的错误之一是混淆发音相似的术语。例如，地址总线传输内存地址，而数据总线传输实际数据。在示意图标注题中把它们搞混会白白丢分。另一个常见错误是在计算文件大小时忘记换算单位：如果宽度和高度以像素为单位，色深以比特为单位，那么得到的结果是以比特为单位的——你可能需要转换成字节或千字节。
In programming questions, missing out the initialisation step in a loop (e.g., count = 0 before a WHILE loop) or forgetting to increment a counter causes logic errors. Always dry-run your pseudocode with a simple test case. In Boolean logic, misreading a circuit diagram order, especially with cascading gates, leads to an incorrect truth table. Work from left to right, labelling intermediate outputs.
在编程题中，遗漏循环中的初始化步骤（例如在 WHILE 循环之前设置 count = 0）或忘记递增计数器会导致逻辑错误。务必用一个简单的测试用例来手动执行你的伪代码。在布尔逻辑中，误读电路图顺序，尤其是级联门，会造成错误的真值表。从左到右进行分析，标注中间输出。
11. Top Revision Techniques for Year 10 | Year 10 最佳复习技巧
Begin by organising your revision around the specification, not just the textbook. Download the Eduqas specification and use it as a tick-list, highlighting each bullet point once you are confident. Past papers should be used actively: sit a paper under timed conditions, then mark it using the official mark scheme. Focus on the questions you got wrong and study the model answers to understand the examiners' phrasing. Create flashcards for key definitions, such as 'volatile memory', 'protocol' and 'encryption'.
从围绕考试大纲而非仅依赖教材组织复习开始。下载 Eduqas 的考试大纲，将其用作检查清单，每掌握一个知识点就划掉一个要点。积极使用历年真题：在计时条件下完成一套试卷，然后用正式评分标准进行批改。专注于你做错的题目，研究标准答案来理解考官的表达方式。为关键定义制作抽认卡，比如“易失性存储器”、“协议”和“加密”。
Interleaving topics is more effective than block revision. Instead of studying all of data representation on one day, mix it with a programming task and a networks question. This strengthens your ability to switch contexts, which mirrors the exam. Teach a concept to a friend or family member; if you can explain it clearly, you truly understand it. Finally, make sure you are getting enough sleep before the exam – cognitive performance drops significantly when you are tired.
交替学习不同主题比集中攻克一个模块更有效。与其在一天内学完所有数据表示的内容，不如将它与一个编程任务和一道网络题混合练习。这能增强你切换语境的能力，这也与考试形式相符。把一个概念讲给朋友或家人听；如果你能清晰地解释它，就说明你真正理解了。最后，确保考前有充足的睡眠——疲劳时认知能力会显著下降。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图