📚 Year 11 OCR Computer Science: Practical Assessment Essentials | 11年级 OCR 计算机科学：实验/实践考核要点
In the OCR GCSE (9–1) Computer Science course, practical programming skills are not assessed via a separate non-exam assessment. Instead, they are woven into the written examination, primarily in Paper 2 – Computational thinking, algorithms and programming. This article covers the core practical competencies you need to demonstrate: thinking computationally, reading and writing pseudocode, tracing code, designing algorithms and testing solutions. Mastering these areas will help you tackle any programming question with confidence.
在OCR GCSE (9–1) 计算机科学课程中，实践编程能力并非通过独立的非考试评估来考查，而是融合在笔试中，尤其是试卷二：计算思维、算法与编程。本文涵盖你需要展示的核心实践能力：计算思维、伪代码读写、代码追踪、算法设计和解决方案测试。掌握这些要点将帮助你自信应对任何编程题目。
1. Understanding the Practical Component | 了解实践考核部分
OCR's J277 specification requires you to apply programming techniques in a written context. You will be given code written in OCR's exam reference language, or sometimes in Python, and asked to trace it, debug it, complete it or write a short algorithm from scratch.
OCR的J277大纲要求你在书面情境中应用编程技巧。题目会给出用OCR考试参考语言（有时是Python）编写的代码，要求你追踪执行、调试、补全或从头编写一段简短算法。
The practical marks are embedded inside Paper 2, alongside questions on computational logic, data representation and theory. Therefore, every mark you gain from programming questions directly depends on how well you handle variables, loops, conditionals and subroutines under exam conditions.
实践题的分数融入在试卷二中，与计算逻辑、数据表示和理论题并存。因此，你在编程题中获得的每一分，都直接取决于在考试条件下对变量、循环、条件判断和子程序的运用能力。
2. Mastering Pseudocode | 掌握伪代码
OCR does not insist on a specific programming language; instead it provides an official pseudocode guide. You need to be fluent in its syntax for input/output, assignment, selection and iteration. For example: OUTPUT 'Enter age', age ← USERINPUT, IF age >= 18 THEN ... ENDIF. Practice converting everyday problems into this notation.
OCR不坚持使用某一种特定编程语言，而是提供了一套官方伪代码指南。你需要熟练掌握其输入/输出、赋值、选择和迭代语法。例如：OUTPUT 'Enter age'、age ← USERINPUT、IF age >= 18 THEN …… ENDIF。练习将日常问题转为这种表示法。
Examiners expect you to follow the pseudocode conventions, especially the left arrow (←) for assignment and the use of proper indentation. Marks are often lost when candidates mix real Python code with pseudocode or use ambiguous phrases like 'add one to score'. Stick to the guide.
考官希望你遵循伪代码约定，特别是用左箭头（←）表示赋值，并使用正确的缩进。考生常因将真实的Python代码与伪代码混用，或使用“给score加一”这样含糊的表述而丢分。务必遵照指南。
3. Flowchart Design | 流程图设计
Flowcharts appear regularly as a way to express algorithms. You must recognise and draw the standard symbols: a rounded rectangle for start/stop, a parallelogram for input/output, a rectangle for processes, and a diamond for decisions. Arrows show the flow of control.
流程图经常被用来表达算法。你必须能识别并绘制标准符号：圆角矩形表示开始/结束，平行四边形表示输入/输出，矩形表示处理步骤，菱形表示决策。箭头表示控制流向。
In the exam, you may be asked to complete a partially drawn flowchart, trace the output of a given flowchart, or draw one for a described problem. Always label decision branches clearly (Yes/No or True/False) and make sure every path leads somewhere meaningful.
考试中可能会要求你补全一个部分绘制好的流程图、追踪给定流程图的输出，或为描述的问题绘制流程图。始终清晰标注决策分支（是/否或真/假），并确保每条路径都有明确去向。
4. Programming Fundamentals | 编程基础
Solid command of data types (integer, real, Boolean, character, string), constants, variables, and arithmetic operations is essential. Understand operator precedence: brackets first, then * / DIV MOD, then + -. Know how to use DIV (integer division) and MOD (remainder) correctly.
牢固掌握数据类型（整数、实数、布尔、字符、字符串）、常量和变量以及算术运算至关重要。理解运算符优先级：先括号，然后 * / DIV MOD，再 + -。知道如何正确使用 DIV（整数除法）和 MOD（取余）。
Be prepared to write selection statements (IF…THEN…ELSE… using AND, OR and NOT. Ensure you use the correct comparison operators: =, ≠, <, >, ≤, ≥.
准备好编写选择语句（IF…THEN…ELSE…ENDIF）和嵌套选择。在处理多个条件时，可以用 AND、OR 和 NOT 进行逻辑组合。确保使用正确的比较运算符：=、≠、<、>、≤、≥。
Iteration is tested heavily. You should be comfortable with count-controlled loops (FOR i ← 1 TO n ... NEXT i), condition-controlled loops (WHILE condition DO ... ENDWHILE) and repeat-until loops (REPEAT ... UNTIL condition). Pay attention to loop termination conditions to avoid infinite loops.
迭代是考查重点。你应该熟练掌握计数控制循环（FOR i ← 1 TO n ... NEXT i）、条件控制循环（WHILE condition DO ... ENDWHILE）和 repeat-until 循环（REPEAT ... UNTIL condition）。注意循环终止条件以避免死循环。
5. Data Structures | 数据结构
One-dimensional arrays (lists) are the most common data structure in OCR exams. You must be able to declare an array, initialise it, access elements by index, update values and traverse the structure using a loop. Remember that indices often start at 0, but in pseudocode they can start at 1 – read the question carefully.
一维数组（列表）是OCR考试中最常见的数据结构。你必须能够声明数组、进行初始化、通过索引访问元素、更新值以及使用循环遍历结构。注意索引通常从0开始，但在伪代码中可能从1开始——仔细读题。
Two-dimensional arrays (tables) also appear, particularly in questions involving a grid of values. Know how to declare a 2D array, access an element like grid[row, column], and process it with nested loops.
二维数组（表格）也会出现，尤其是在涉及网格数据的问题中。要知道如何声明二维数组，访问如grid[row, column]的元素，并使用嵌套循环进行处理。
6. String Manipulation | 字符串操作
Many practical problems involve extracting information from text. OCR expects you to use functions like LENGTH(str), SUBSTRING(str, start, length), LEFT(str, n), RIGHT(str, n) and concatenation using the + operator. Know how to convert between string and numeric types when needed.
许多实际题目涉及从文本中提取信息。OCR要求你会使用LENGTH(str)、SUBSTRING(str, start, length)、LEFT(str, n)、RIGHT(str, n)等函数，以及用 + 运算符进行连接。懂得在需要时进行字符串与数值类型的转换。
Practice problems that involve searching for a character, counting occurrences, or building a new string based on a pattern. For example, extracting initials from a full name by splitting on spaces requires careful use of substring and position finding.
练习涉及搜索字符、统计出现次数或根据模式构建新字符串的问题。例如，从全名中提取首字母并由空格分割，就需要精细使用取子串和位置查找。
7. File Handling | 文件处理
Although you do not sit at a real computer during the exam, OCR expects you to know the logical steps for reading from and writing to files. Pseudocode includes: OPEN 'filename' FOR READ, READ line, and WRITE data TO file. You must close the file with CLOSE 'filename'.
尽管考试时并不使用真实计算机，OCR仍希望你掌握从文件读取和写入文件的逻辑步骤。伪代码包括：OPEN 'filename' FOR READ、READ line 和 WRITE data TO file。必须用CLOSE 'filename'关闭文件。
Common tasks include processing a text file line by line until the end-of-file marker is reached, counting words, or filtering records that meet a condition. Always initialise appropriate variables before the loop, and handle the situation where the file might be empty.
常见任务包括逐行处理文本文件直到文件结束标志，统计单词数，或筛选满足条件的记录。务必在循环之前初始化合适的变量，并处理文件可能为空的情况。
8. Testing and Debugging | 测试与调试
You are expected to identify and correct errors in given code. This includes syntax errors (missing quotes, incorrect spelling of keywords), logic errors (the program runs but gives the wrong result) and runtime errors (division by zero, opening a non-existent file).
你应当能识别并纠正给定代码中的错误。这包括语法错误（漏掉引号、关键字拼写错误）、逻辑错误（程序能运行但结果错误）和运行时错误（除以零、打开不存在的文件）。
Effective testing involves choosing suitable test data: normal data, boundary data (values at the edge of acceptance, e.g. 0, 100, or an empty string), and erroneous data that should be rejected. Always state the expected outcome for each test case and compare it with the actual result.
有效的测试需要选择合适的测试数据：正常数据、边界数据（处于接受范围边缘的值，如0、100或空字符串），以及应当被拒绝的错误数据。始终写明每个测试用例的预期结果，并与实际结果进行比较。
9. Trace Tables | 追踪表
Trace tables are a powerful tool for understanding how an algorithm executes. You create columns for each variable (and sometimes for conditions or output) and step through the code line by line, recording how values change. This technique is almost always required in one of the exam questions.
追踪表是理解算法如何执行的有力工具。你为每个变量（有时还包括条件或输出）创建列，然后逐行执行代码，记录数值变化。这种方法几乎每次考试都会要求使用。
When completing a trace table, carefully update the values in the correct order. If a line contains a conditional statement, write the condition outcome (True/False) before evaluating the branch. Practise with nested loops and functions that return values; these can be tricky to trace.
完成追踪表时，需按正确顺序仔细更新数值。如果某行包含条件语句，先记录条件结果（真/假），再执行相应分支。多练习嵌套循环和带返回值的函数追踪，这些容易出错。
Below is a simple example of a trace table for a loop summing numbers 1 to n:
| Line | n | total | count | Output |
|---|---|---|---|---|
| 1 | 3 | - | - | - |
| 2 | 3 | 0 | 0 | - |
| 3 | 3 | 0 | 1 | - |
| 4 | 3 | 1 | 1 | - |
| 5 | 3 | 1 | 2 | - |
| 4 | 3 | 3 | 2 | - |
| 5 | 3 | 3 | 3 | - |
| 4 | 3 | 6 | 3 | - |
| 5 | 3 | 6 | 4 | 6 |
一个对1到n求和的追踪表简易示例如上。注意循环结束条件判断后输出 final total。
10. Common Algorithms | 常见算法
You must be ready to implement or trace standard algorithms. Linear search checks each element in turn until a match is found; binary search requires a sorted list and repeatedly divides the search interval in half. Know the advantages of each and be able to calculate the maximum number of comparisons.
你必须能够实现或追踪标准算法。线性搜索依次检查每个元素直到找到匹配项；二分搜索需要有序列表，并反复将搜索区间减半。了解各自的优势，并能计算最大比较次数。
Sorting algorithms like bubble sort and merge sort are explicitly mentioned. Bubble sort works by repeatedly stepping through the list, swapping adjacent items that are out of order. Merge sort uses a divide-and-conquer approach, splitting the list into smaller sub-lists, sorting them and merging back. You may be asked to describe, trace or compare their efficiency.
明确提及了冒泡排序和归并排序等排序算法。冒泡排序通过反复遍历列表，交换相邻乱序项实现；归并排序采用分治法，将列表拆分为更小的子列表，排序后再合并。你可能需要描述、追踪或比较它们的效率。
11. Error Types | 错误类型
are broken (e.g. missing ENDIF). Logic errors produce unexpected results, such as using < instead of ≤, causing the boundary value to be excluded. Runtime errors happen during execution, like referencing an index that does not exist.
识别错误类别有助于你写出更好的代码，并在调试题中得分。语法错误发生在违反语言规则时（如漏掉ENDIF）。逻辑错误产生意外结果，例如使用 < 而不是 ≤，导致边界值被排除。运行时错误在执行过程中发生，如引用不存在的索引。
When asked to debug, read the error description carefully and trace backwards. Often a single misplaced instruction or wrong variable name is the culprit. Write down the corrected version using exact pseudocode.
遇到调试要求时，仔细阅读错误描述并逆向追踪。通常一条位置错误的指令或错误的变量名是罪魁祸首。用精确的伪代码写出修正版本。
12. Time Management for Practical Questions | 实践题的时间管理
In Paper 2, programming questions can be time-consuming. Allocate roughly 1.5 minutes per mark across the whole paper. If a 6-mark algorithm-writing question feels overwhelming, break it into steps: identify inputs/outputs, plan variables, draft the structure, then write the solution. A partial correct attempt can still gain the majority of marks.
在试卷二中，编程题可能很耗时。整张卷子大约按每分1.5分钟分配时间。如果一道6分的算法编写题感觉棘手，把它拆成步骤：明确输入/输出，规划变量，拟定结构，然后写出解答。部分正确的尝试仍能获得大部分分数。
For trace table questions, do not rush; one mistake early on propagates. Use the table to verify your mental execution. If you find yourself stuck on a particularly tricky line, finish the rest of the table and come back. Often later entries reveal what should have happened earlier.
面对追踪表问题时，不要匆忙；早期的一个错误会持续影响后续。借助表格来验证你的心智执行。如果卡在某个特别棘手的行，先完成表格其余部分再回头检查，往往后续条目能揭示前期应有的状态。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图