📚 Past Paper Analysis for IGCSE OCR Computer Science | IGCSE OCR 计算机：历年真题解析
Preparing for the IGCSE OCR Computer Science exam (J277) requires not only understanding key concepts but also familiarity with the style and demands of past paper questions. This article provides a comprehensive breakdown of typical topics tested across years, with paired English and Chinese explanations to reinforce learning. Whether you are tackling Paper 1 (Computer Systems) or Paper 2 (Computational Thinking, Algorithms & Programming), the following analysis will sharpen your exam technique and boost your confidence.
备考IGCSE OCR计算机科学考试（J277），不仅需要理解关键概念，还要熟悉历年真题的题型与要求。本文全面剖析多年来的常见考点，配以中英双语讲解，以巩固学习。无论你面对的是试卷一（计算机系统）还是试卷二（计算思维、算法与编程），以下分析都将提升你的应试技巧并增强信心。
1. Exam Structure and Assessment Overview | 考试结构与评估综述
The OCR J277 qualification consists of two written papers. Paper 1 (Computer Systems) covers the theoretical underpinnings of computing, including systems architecture, memory, storage, networks, security, and ethical issues. Paper 2 (Computational Thinking, Algorithms & Programming) focuses on algorithm design, programming concepts, logic, and data representation. Each paper is 1 hour 30 minutes long, with 80 marks available. Past papers reveal a consistent demand for precise technical vocabulary and the ability to apply knowledge to unfamiliar scenarios.
OCR J277 资格认证包含两份笔试。试卷一（计算机系统）涵盖计算理论基础，包括系统架构、内存、存储、网络、安全及伦理问题。试卷二（计算思维、算法与编程）侧重算法设计、编程概念、逻辑和数据表示。每份试卷时长1小时30分钟，满分为80分。历年真题表明，考试始终要求使用精确的技术词汇，并具备将知识应用于陌生情境的能力。
Understanding the format helps you allocate revision time effectively. Paper 1 questions often use multiple-choice, short-answer, and extended writing, while Paper 2 includes trace tables, algorithm completion, and code interpretation. Many questions require step-by-step explanations, not just final answers.
理解试卷格式有助于有效分配复习时间。试卷一常采用选择题、简答题和拓展写作题，试卷二则包含追踪表、算法补全和代码解读。许多问题需要逐步解释，而不只是给出最终答案。
2. Algorithms – Searching and Sorting | 算法 — 搜索与排序
A favourite past paper topic is the comparison of searching and sorting algorithms. Students must describe linear search, binary search, bubble sort, merge sort, and insertion sort, often in the context of real data sets. A typical question: ‘Describe how a binary search finds the value 23 in the sorted list [2, 5, 11, 17, 23, 34, 42].’ The answer must explain selecting the middle element, comparing, and halving the search space until the value is found or the subarray is empty.
历年真题常考搜索与排序算法的比较。学生需要描述线性搜索、二分搜索、冒泡排序、归并排序和插入排序，通常结合实际数据集。典型题目如：“描述二分搜索如何在有序列表 [2, 5, 11, 17, 23, 34, 42] 中查找值 23。”答案必须解释选取中间元素、比较和反复对半缩小搜索范围，直到找到目标或子数组为空。
Bubble sort questions ask for the state of the list after each pass. For example, sorting [9, 4, 7, 1] in ascending order: first pass compares adjacent pairs and swaps, resulting in [4, 7, 1, 9]. The examiner expects precise pass-by-pass diagrams or bullet points. Merge sort requires splitting into single-element lists and then merging in order, often assessed with a diagram.
冒泡排序题要求列出每趟排序后的列表状态。例如，对 [9, 4, 7, 1] 进行升序排序：第一趟比较相邻元素并交换，得到 [4, 7, 1, 9]。考官希望看到逐趟的精确图表或要点。归并排序要求拆分为单一元素列表，再有序合并，通常用流程图评估。
Common pitfalls include confusing binary search precondition (list must be sorted) and misapplying algorithms. Always state the difference in efficiency: binary search is O(log n), linear search is O(n).
常见陷阱包括混淆二分搜索的前提条件（列表必须有序）和错误地应用算法。务必说明效率差异：二分搜索时间复杂度为 O(log n)，线性搜索为 O(n)。
3. Programming Fundamentals and Pseudocode | 编程基础与伪代码
Paper 2 heavily features pseudocode interpretation and generation. OCR uses a specific pseudocode syntax resembling Python. You must be able to read and write sequences, selection (if…then…else), and iteration (for, while loops). A past question might give a pseudocode fragment and ask for the output, such as:
试卷二大量考察伪代码的理解与编写。OCR 使用类似 Python 的特定伪代码语法。你必须能够读写顺序结构、选择结构（if…then…else）和循环结构（for、while 循环）。真题可能给出伪代码片段并要求写出输出，例如：
x ← 3 FOR i ← 1 TO 4 x ← x + i NEXT i PRINT x
The correct answer is 13, because x becomes 3+1=4, +2=6, +3=9, +4=13. Marks are often lost by forgetting to initialise correctly or missing edge counters.
正确答案是 13，因为 x 依次变为 3+1=4，+2=6，+3=9，+4=13。常因忘记正确初始化或遗漏循环计数边界而失分。
Another classic question involves string manipulation: given a variable ‘word ← ‘computer”, extract substrings or count characters. For instance, output word[2:5] would yield ‘mpu’ if indexing starts at 0. Understanding 0-based indexing versus 1-based is critical.
另一经典题型涉及字符串操作：给定变量 word ← ‘computer’，提取子串或统计字符数。例如，若索引从 0 开始，输出 word[2:5] 将得到 ‘mpu’。理解基于 0 的索引与基于 1 的索引至关重要。
When writing your own pseudocode, structure is essential. Use indentation and comments to make logic clear. Practice with past trace table questions, where you simulate variable values line by line.
在自行编写伪代码时，结构至关重要。使用缩进和注释使逻辑清晰。结合历年追踪表题目进行练习，逐行模拟变量值。
4. Data Representation – Binary, Hex, Images, Sound | 数据表示 — 二进制、十六进制、图像、声音
Data representation is the backbone of Paper 1. Being able to convert between denary, binary, and hexadecimal is mandatory. Past papers often ask: ‘Convert the denary number 173 into an 8-bit binary number.’ The answer is 10101101. Another frequent request: ‘Convert the binary number 11010110 into hexadecimal.’ That is D6.
数据表示是试卷一的核心。必须掌握十进制、二进制和十六进制之间的转换。真题常问：“将十进制数 173 转换为 8 位二进制数。”答案为 10101101。另一个常见要求：“将二进制数 11010110 转换为十六进制。”答案是 D6。
Questions on image representation ask about resolution, colour depth, and file size. For example: ‘Calculate the file size of an image with resolution 800×600, 16-bit colour depth.’ The formula is width × height × colour depth in bits, then convert to bytes. So 800 × 600 × 16 = 7 680 000 bits, divided by 8 = 960 000 bytes, approximately 0.92 MB. Using exact powers of 2 for kilobytes (1024 bytes) is advised.
图像表示题考察分辨率、色彩深度和文件大小。例如：“计算分辨率为 800×600、色彩深度为 16 位的图像文件大小。”公式为宽度 × 高度 × 色彩深度（位），然后换算为字节。因此 800 × 600 × 16 = 7 680 000 位，除以 8 = 960 000 字节，约 0.92 MB。建议使用精确的 2 的幂（1024 字节）作为千字节。
Sound representation involves sampling rate, bit depth, and the Nyquist theorem. A typical question: ‘Explain why increasing the sampling rate improves sound quality.’ You must state that more samples per second capture higher frequencies, resulting in a more accurate reproduction of the original analogue wave. Examiner feedback often notes that candidates confuse sample rate with bit depth.
声音表示涉及采样率、位深度和奈奎斯特定理。典型题目：“解释为何提高采样率能改善音质。”必须说明每秒采样点更多，可捕捉更高频率，使原始模拟波形的再现更准确。考官反馈常指出考生混淆采样率和位深度。
5. Computer Systems – CPU, Memory, Storage | 计算机系统 — CPU、内存、存储
The CPU section covers the Von Neumann architecture, with emphasis on the fetch-decode-execute cycle. Past paper questions regularly ask for the role of the Program Counter (PC), Memory Address Register (MAR), Memory Data Register (MDR), and Accumulator. For example: ‘Describe what happens during the decode phase of the FDE cycle.’ A full-mark answer explains that the instruction in the CIR is split into opcode and operand, then the control unit interprets the opcode.
CPU 部分涵盖冯·诺依曼架构，重点在取指-译码-执行周期。真题经常询问程序计数器（PC）、内存地址寄存器（MAR）、内存数据寄存器（MDR）和累加器的作用。例如：“描述 FDE 周期译码阶段发生的事情。”满分答案需解释 CIR 中的指令被拆分为操作码和操作数，然后控制单元对操作码进行译码。
Memory and storage distinctions are a guaranteed topic. RAM is volatile, ROM is non-volatile; virtual memory is used when RAM overflows. Candidates must be able to compare magnetic, solid-state, and optical storage in terms of capacity, speed, durability, and portability. A typical 4-mark ‘compare’ question might ask to evaluate SSDs and HDDs for a laptop upgrade.
内存与存储的区别是必考内容。RAM 易失，ROM 非易失；当 RAM 不足时使用虚拟内存。考生必须能够从容量、速度、耐用性和便携性方面比较磁存储、固态存储和光存储。典型 4 分“比较”题可能要求就笔记本电脑升级评估固态硬盘和机械硬盘。
6. Networks and Topologies | 网络与拓扑
Networking questions test knowledge of LAN vs WAN, client-server vs peer-to-peer, and hardware like routers, switches, and NICs. Past papers often present a scenario—a school or office—and ask to recommend a topology with justification. A star topology is frequently praised for its robustness: if one cable fails, only that node is disconnected, unlike a bus topology where the whole network can go down.
网络题考查局域网与广域网、客户端-服务器与对等网络，以及路由器、交换机和网卡等硬件设备。真题常设置一个场景（学校或办公室），要求推荐一种拓扑结构并说明理由。星形拓扑因其健壮性常受推崇：一条电缆故障只影响该节点，不像总线拓扑那样可能导致整个网络瘫痪。
The TCP/IP stack and protocol layers appear regularly. You should be able to describe the function of each layer and common protocols: HTTP, HTTPS, FTP, SMTP, IMAP. For example, ‘Explain why HTTPS is used instead of HTTP when transmitting sensitive data.’ The response should mention encryption and the use of SSL/TLS to provide secure communication.
TCP/IP 协议栈和分层模型经常出现。应能描述各层功能及常见协议：HTTP、HTTPS、FTP、SMTP、IMAP。例如：“解释传输敏感数据时为何使用 HTTPS 而非 HTTP。”回答需提及加密及使用 SSL/TLS 以提供安全通信。
7. Network Security Threats and Defenses | 网络安全威胁与防御
Threats such as malware, phishing, brute-force attacks, and SQL injection are standard. A typical past paper question defines a scenario and asks to identify the threat and suggest prevention methods. For instance, an employee receives an email requesting login credentials—this is phishing. A strong answer suggests staff training, spam filters, and two-factor authentication.
恶意软件、网络钓鱼、暴力破解和 SQL 注入等威胁是标准考点。典型真题会描述一个场景，要求识别威胁并提出防范措施。例如，一名员工收到要求提供登录凭证的邮件——这就是网络钓鱼。高分答案会建议员工培训、垃圾邮件过滤和双因素认证。
Prevention methods include firewalls, anti-malware, and penetration testing. When describing a firewall, state that it monitors incoming and outgoing traffic based on predetermined security rules. For ethical hacking questions, differentiate between white-hat and black-hat intentions.
防御措施包括防火墙、反恶意软件和渗透测试。在描述防火墙时，说明它根据预定安全规则监控进出流量。针对道德黑客问题，要区分白帽和黑帽意图。
8. Logic Gates and Boolean Logic | 逻辑门与布尔逻辑
Logic gates (AND, OR, NOT, NAND, NOR, XOR) and their truth tables are tested every year. You may be asked to draw a circuit for a Boolean expression like Q = (A AND B) OR (NOT C). Understanding how to combine gates and complete truth tables for up to three inputs is essential.
逻辑门（AND、OR、NOT、NAND、NOR、XOR）及其真值表每年必考。可能要求为布尔表达式 Q = (A AND B) OR (NOT C) 绘制逻辑电路。理解如何组合逻辑门并为最多三路输入填写真值表至关重要。
A common higher-tariff question gives a real-world scenario, such as a car buzzer that sounds when the driver’s door is open and the seatbelt is not fastened. You’d derive the Boolean expression, draw the logic circuit, and explain. Practising linking abstract logic to practical systems is key.
常见的高分题给出实际情境，例如：驾驶员车门打开且安全带未系时蜂鸣器响。你需要推导布尔表达式、绘制逻辑电路并解释。练习将抽象逻辑与实践系统相联系是关键。
9. Ethical, Legal, and Environmental Issues | 伦理、法律与环境问题
Extended-writing questions often address the digital divide, data privacy, and the Computer Misuse Act. For example, ‘Discuss the ethical implications of using artificial intelligence in hiring processes.’ A top-band answer would cover bias in training data, transparency, and accountability, while also referencing the Equality Act.
拓展写作题常涉及数字鸿沟、数据隐私和《计算机滥用法》等。例如：“讨论在招聘流程中使用人工智能的伦理影响。”最高分答案会涉及训练数据的偏见、透明度及问责制，并引用《平等法案》。
Environmental impact of e-waste and energy consumption of data centres are also common. You must be able to suggest how technology can both cause and solve environmental problems. Past questions have linked the carbon footprint of cryptocurrency mining to sustainability debates.
电子垃圾对环境的影响和数据中心的能耗也是常见内容。必须能够说明技术如何既导致又解决环境问题。历年题目已将加密货币挖矿的碳足迹与可持续发展辩论联系起来。
10. Common Past Paper Pitfalls and Exam Technique | 真题常见陷阱与应试技巧
One of the most repeated mistakes is not reading the command word: ‘describe’ requires a step-by-step account, while ‘explain’ requires reasons. If a question says ‘state’, a short answer suffices; for ‘discuss’, you need both sides. Time management is critical—allocate roughly one minute per mark.
最常见的错误之一是没看清指令词：“describe”要求逐步叙述，而“explain”要求给出原因。如果问题是“state”，简短回答即可；对于“discuss”，则需要兼顾正反两面。时间管理至关重要——大约每分钟得一分。
In trace table questions, many candidates skip writing variable names at the top, losing easy marks. Always label columns clearly. For 6-mark code-writing tasks, use meaningful variable names and consistent pseudocode syntax. Even if your logic is correct, messy presentation can hinder the examiner’s understanding.
在追踪表题目中，许多考生漏写顶部的变量名，白白失分。务必清晰地标注各列。对于 6 分代码编写任务，使用有意义的变量名和一致的伪代码语法。即使逻辑正确，潦草的呈现也会影响考官理解。
Finally, practice with official OCR past papers under timed conditions. Mark your answers against the published mark schemes, noting where keywords are required—terms like ‘volatile’, ‘fetches the next instruction’, or ‘layer 3’ often carry specific marks. Repetition builds speed and precision.
最后，限时练习 OCR 官方真题。对照发布的评分方案批改答案，注意那些要求关键词的地方——“volatile”、“fetches the next instruction”或“layer 3”等术语往往有特定分值。反复练习可提升速度和准确性。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导