In-depth Analysis of OCR Year 12 Computer Science Past Papers | 历年真题深度解析

📚 In-depth Analysis of OCR Year 12 Computer Science Past Papers | 历年真题深度解析

Welcome to this in‑depth exploration of OCR A‑Level Computer Science past papers for Year 12. By analysing real exam questions and their mark schemes, we will uncover the key concepts, common pitfalls, and the precise language that examiners expect. From processor architecture to ethical dilemmas, you will learn how to structure answers for maximum marks and build a robust revision strategy.

欢迎深入解析OCR A‑Level计算机科学历年真题（Year 12）。通过分析真实考题和评分标准，我们将揭示核心概念、常见误区以及考官期待的准确表述。从处理器架构到道德困境，你将学会如何组织答案以获取最高分，并建立扎实的复习策略。

1. Processor Architecture: The Fetch–Decode–Execute Cycle | 处理器架构：取指–解码–执行周期

A common 4‑mark question asks: “Describe the steps that occur during the fetch stage of the fetch–decode–execute cycle.” The model answer must be methodical. First, the content of the Program Counter (PC) is copied to the Memory Address Register (MAR). Then the address is placed onto the address bus, a read signal is sent, and the instruction stored at that memory location travels via the data bus into the Memory Data Register (MDR). Finally, the instruction is transferred to the Current Instruction Register (CIR) and the PC is incremented. Examiners penalise omission of the bus transfer steps or confusing the MDR with the CIR.

一道常见的4分题会问：“描述取指–解码–执行周期的取指阶段发生的步骤。”模型答案必须条理清晰。首先，程序计数器（PC）的内容被复制到内存地址寄存器（MAR）。随后地址被放到地址总线上，发出读信号，该内存位置存储的指令经数据总线进入内存数据寄存器（MDR）。最后，指令被传送到当前指令寄存器（CIR），并且PC递增。考官会扣分如果你遗漏总线传输步骤或者混淆MDR和CIR。

In the decode stage, the Control Unit (CU) decodes the instruction held in the CIR. The execute stage then carries out the operation, which may involve the ALU, additional memory accesses, or writing back to registers. For higher‑mark questions, always link the role of the control bus in coordinating these operations.

在解码阶段，控制单元（CU）对CIR中的指令进行解码。执行阶段随后执行操作，可能涉及ALU、额外的内存访问或写回寄存器。对于分值较高的问题，一定要将控制总线协调这些操作的作用联系起来。

2. Memory Technologies: RAM, ROM and Virtual Storage | 内存技术：RAM、ROM 与虚拟存储

An OCR paper might ask: “Compare the characteristics of RAM and ROM, giving an example of the use of each.” RAM is volatile (loses data when power is off), read‑write, and used as main memory for currently running programs and data. ROM is non‑volatile, can be read but not written to during normal operation, and stores firmware or the bootstrap loader. A strong answer mentions that ROM retains its contents without power, making it ideal for the initial program that starts the computer.

OCR试卷可能会问：“比较RAM和ROM的特性，并分别举例说明其用途。”RAM是易失性的（断电时数据丢失），可读写，用作主存以存放当前运行的程序和数据。ROM是非易失性的，正常操作时只读，存储固件或引导加载程序。优秀的答案会提到ROM可以在断电后保留内容，因此非常适合存放启动计算机的初始程序。

Virtual storage (paging) is another favourite topic. When asked “Explain why virtual memory is needed and how it works,” describe how the operating system swaps pages between RAM and secondary storage when RAM is full. Emphasise that it gives the illusion of a larger main memory but at the cost of performance due to disk thrashing.

虚拟存储（分页）是另一大热门考点。当问到“解释为什么需要虚拟内存及其工作原理”，应当说明当RAM满时操作系统如何在RAM和辅助存储器之间交换页面。强调它给人提供了更大主存的假象，但代价是因磁盘抖动而降低性能。

3. Network Fundamentals: Topologies and Protocols | 网络基础：拓扑结构与协议

When a question gives a diagram of a star topology and asks for two advantages, you could write: “In a star network, if one cable fails, only that workstation is affected; the rest of the network continues to operate. It is also easy to isolate faults and add new devices without disrupting the network.” Always contrast with a bus topology if asked for a disadvantage of the other.

当试题给出星型拓扑结构图并要求写出两个优点时，你可以写：“在星型网络中，若一根线缆出现故障，只有该工作站受影响；网络其余部分仍可继续运行。此外，它易于隔离故障且添加新设备不会中断网络。”若被问到某种拓扑的缺点，要始终与总线拓扑进行对比。

Protocol questions require precise definitions. A typical 3‑mark item: “Describe the role of the TCP in the TCP/IP stack.” Answer: TCP breaks data into packets, assigns sequence numbers, and reassembles them at the destination. It also handles error checking and retransmission of lost packets, ensuring reliable delivery. Relate this to the IP protocol, which handles addressing and routing.

协议问题需要准确定义。一个典型的3分题：“描述TCP在TCP/IP协议栈中的作用。”答案：TCP将数据拆分为数据包，分配序号，并在目的地重组。它还会进行错误检查及丢失数据包的重传，确保可靠交付。要将此与处理寻址和路由的IP协议联系起来。

4. Data Representation: Binary, Hex, and Negative Numbers | 数据表示：二进制、十六进制与负数

Converting a negative decimal to two’s complement binary is a frequently examined skill. For example, “Represent −27 in 8‑bit two’s complement.” The correct method: write +27 in binary (00011011), invert all bits (11100100), and add 1 (11100101). Examiners look for the explicit showing of the inversion and the addition step; simply giving the final pattern without working often loses marks.

将负十进制数转换为二进制补码是一个常考技能。例如，“用8位补码表示 −27。”正确的方法是：写出 +27 的二进制（00011011），将所有位翻转（11100100），再加1（11100101）。考官会期待看到明确的翻转和加一步骤；只给出最终模式而没有过程往往会丢分。

Floating‑point representation, using a mantissa and exponent, can appear in a small calculation question. Make sure you can normalise a binary floating‑point number, adjusting the exponent accordingly, and demonstrate how increasing the number of bits for the mantissa improves precision while more exponent bits increase range.

浮点数表示（使用尾数和指数）可能会以小计算题的形式出现。确保你能将二进制浮点数规格化，相应调整指数，并说明增加尾数位数如何提高精度，而增加指数位数则扩大范围。

5. Logic Gates and Boolean Simplification | 逻辑门与布尔代数化简

Consider a past paper question: “Simplify the Boolean expression F = A • (A + B).” Applying the absorption law, F = A. Then “Draw the logic circuit for the simplified expression.” This tests both algebraic skill and the ability to translate expressions into NAND‑only or NOR‑only gates, which OCR frequently asks. Practise rewriting an expression using De Morgan’s theorem to convert AND‑OR circuits to NAND‑NAND.

考虑一道历年真题：“化简布尔表达式 F = A • (A + B)。”应用吸收律得 F = A。然后“画出简化后表达式的逻辑电路图。”这既考查代数技巧，也考查将表达式转换为仅用与非门或或非门的能力——OCR经常考。练习使用德摩根定理将AND‑OR电路改写为NAND‑NAND结构。

When simplifying with Karnaugh maps for 3 or 4 variables, always draw the grid, label rows and columns correctly, and circle the largest possible groups in powers of 2. The simplified sum‑of‑products must be clearly derived. A typical deduction is forgetting to consider ‘don’t care’ conditions or wrapping the map edges.

当用卡诺图化简3或4变量时，务必绘制网格，正确标注行和列，并圈出尽可能大的2的幂次组。化简后的与或式必须清晰地推导出来。典型的扣分点是忘记考虑“无关”条件或忘记卡诺图的边缘卷绕。

6. Operating Systems: Scheduling and Interrupts | 操作系统：调度与中断

A 6‑mark question: “Explain how a priority‑based scheduling algorithm works and give one advantage and one disadvantage.” Outline that each process is assigned a priority; the scheduler selects the highest‑priority ready process. Advantage: critical tasks get immediate CPU time. Disadvantage: lower‑priority processes may suffer starvation. Include a brief comparison with round‑robin to demonstrate deeper understanding.

一道6分题：“解释基于优先级的调度算法如何工作，并给出一个优点和一个缺点。”概述：每个进程分配一个优先级，调度程序选择优先级最高的就绪进程。优点：关键任务立即获得CPU时间。缺点：低优先级进程可能发生饥饿。简要对比轮转调度以展示更深入的理解。

Interrupt handling: “Describe the steps the CPU takes when an interrupt occurs.” The sequence—finish current instruction, save PC and registers onto the stack, load the address of the Interrupt Service Routine (ISR) from the interrupt vector, execute the ISR, restore registers, and resume the interrupted program—must be delivered in correct temporal order. Missing the stack usage is a common error.

中断处理：“描述发生中断时CPU采取的步骤。”顺序为——完成当前指令，将PC和寄存器保存到栈中，从中断向量加载中断服务程序（ISR）的地址，执行ISR，恢复寄存器，并恢复被中断的程序——必须按照正确的时间顺序呈现。遗漏栈的使用是一个常见错误。

7. Searching and Sorting Algorithms | 查找与排序算法

A typical written question: “Trace the binary search algorithm to find the value 17 in the sorted array [2, 5, 8, 12, 17, 23, 29, 31].” Show the low, high, and mid indices at each step, and state when the item is found or the search ends. Many answers fail to initialise low and high correctly or forget to calculate the midpoint using integer division.

一道典型的笔试题：“跟踪二分查找算法在有序数组 [2, 5, 8, 12, 17, 23, 29, 31] 中查找值 17。”展示每一步的 low、high 和 mid 索引，并说明何时找到元素或查找结束。许多答案未能正确初始化 low 和 high，或忘记使用整数除法计算中点。

For sorting algorithms, you may be asked to “Complete the first two passes of a bubble sort on [9, 3, 6, 1, 4].” Sketch the array after each comparison and swap. Then discuss how an insertion sort would differ, noting that insertion sort builds a sorted sub‑list and shifts elements rather than pairwise swapping.

对于排序算法，可能要求“对 [9, 3, 6, 1, 4] 完成冒泡排序的前两趟”。画出每次比较和交换后的数组。然后讨论插入排序有何不同，注意插入排序是构建一个有序子列表并进行元素移位，而非成对交换。

8. Recursion and Iteration in Programming | 编程中的递归与迭代

An OCR question might provide a recursive function, such as def factorial(n), and ask you to trace its execution for factorial(4). State the base case (when n ≤ 1, return 1) and the call stack unwinding. Explain that each recursive call consumes stack space, which can lead to a stack overflow if the recursion depth is too large, a critical difference from iteration.

OCR题目可能会给一个递归函数，例如 def factorial(n)，并要求跟踪 factorial(4) 的执行过程。说明基线条件（当 n ≤ 1 时返回 1）及调用栈的回退过程。解释每次递归调用都会消耗栈空间，若递归深度过大可能导致栈溢出，这是与迭代的关键区别。

When evaluating recursion versus iteration, reference both readability and efficiency. Recursion can express some solutions (tree traversal, divide‑and‑conquer) more naturally, but iteration with a loop avoids the overhead of multiple function calls and is generally more memory‑efficient.

在比较递归和迭代时，要同时提及可读性和效率。递归能更自然地表达某些解决方案（树的遍历、分治），而使用循环的迭代避免了多重函数调用的开销，通常内存效率更高。

9. Ethical, Legal and Environmental Impacts | 道德、法律与环境影响

Extended‑response questions on legal acts require specific references. For “Discuss the impact of the Data Protection Act 2018 on a company collecting customer data,” you must state principles such as data must be processed lawfully, kept secure, not kept longer than necessary, and that individuals have the right to access their data. Link to real‑world consequences like fines and reputational damage.

关于法律的扩展回答题需要具体引用。对于“讨论《2018年数据保护法》对收集客户数据的公司的影响”，你必须陈述相关原则，如数据必须合法处理、保持安全、保存时间不超过必要期限，以及个人有权访问自己的数据。要联系罚款和声誉损害等现实后果。

Environmental questions often link to e‑waste and energy consumption of data centres. A balanced answer acknowledges both the negative (toxic materials, carbon footprint) and positive (paperless offices, teleconferencing reducing travel) aspects, supported by examples. Examiners reward evidence of broad reading.

环境类问题常联系电子废弃物和数据中心的能耗。一个平衡的答案应承认负面影响（有毒物质、碳足迹）和正面影响（无纸化办公、减少出行需求的远程会议），并用例子加以支持。考官会奖励广泛阅读的证据。

10. Exam Technique: Deconstructing a Past Paper Question | 考试技巧：解构一道真题

Let’s deconstruct a 9‑mark question: “A small business is upgrading its computer systems. Discuss the factors, including hardware, software and human aspects, that the business should consider.” First, underline key terms to ensure you cover all three areas. Allocate 3 marks to each: hardware could be processor speed, RAM, storage type; software includes OS compatibility, application needs, licensing costs; human aspects cover training, usability, ergonomics. Plan bullet points for each before writing.

我们来解构一道9分题：“一家小企业正在升级其计算机系统。讨论该企业应考虑的因素，包括硬件、软件和人文方面。”首先，在关键词下划线以确保覆盖所有三个领域。每个方面分配3分：硬件可以包括处理器速度、RAM、存储类型；软件包括操作系统兼容性、应用需求、许可费用；人文方面涵盖培训、可用性、人体工学。写作前先为每个方面列出要点。

In your answer, use paragraphs for each area, give specific examples (e.g., SSD vs HDD, cloud‑based software vs on‑premises), and finish with a concise judgement that ties the factors together. Avoid vague statements like “hardware must be good”—instead, “a multi‑core processor with at least 8 GB RAM would support concurrent tasks efficiently.” This specificity is what separates a grade C from an A.

在答案中，每个方面用一段，给出具体例子（例如 SSD 与 HDD、基于云的软件与本地部署），并以一个简洁的判断句将各因素联系起来作为结尾。避免模糊的陈述，如“硬件要好”——而应写“具有多核处理器和至少8 GB RAM可高效支持并发任务”。这种具体性正是C等成绩与A等的分水岭。

---

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）