Master the OCR AS Level Computer Science (H046) exam with this comprehensive study pack. It covers exact paper structures, grade scales, detailed command word tactics, pseudocode conventions, LMC tips, and analysis-driven solutions to avoid common grade-dropping errors.
閱讀時間 4 分鐘更新於: 2026年6月21日
試卷概覽
卷數
2
總分
140
考試時間
2小時 30分鐘
題型
3
試卷
時間
分數
題數
比重
題型
Component 01: Computing Principles
1小時 15分鐘
70
13
50%
Short Answer & Trace, Medium Structured Logic, Extended Evaluation
A scientific or graphical calculator that meets JCQ regulations may be used (some GCSE Mathematics and Science papers are non-calculator). Graphical calculators must be set to exam mode; you must clear any stored programs, notes or data before the exam, and the calculator must not be able to retrieve stored text or formulae.
AO1: Demonstrate knowledge and understanding of the principles and concepts of computer science, including abstraction, logic, algorithms and data representation. (35%)
AO2: Apply knowledge and understanding of the principles and concepts of computer science including to analyse problems in computational terms. (35%)
AO3: Design, program and evaluate computer systems that solve problems, making reasoned judgements about these and presenting conclusions. (30%)
根據歷屆試題與評分準則整理（2022–2024）。
計算機程式
Graph: zeros, intersections & turning points
Graphical calculator / GDC (exam mode)
用途: Plot a function to read its roots (zeros), points of intersection, and maxima/minima.
使用時機: Checking solutions, sketching, or solving where an analytic method is hard.
步驟
Graph the function(s) and use the built-in zero, intersect and maximum/minimum tools.
考試提示: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.
Numerical equation solver
Graphical calculator / GDC (exam mode)
用途: Solve an equation or find a variable numerically when an algebraic route is long or implicit.
使用時機: Iterative or implicit equations, or to confirm an algebraic solution.
步驟
Use the equation/zero solver, entering the equation and a sensible starting estimate.
考試提示: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.
Numerical integration & differentiation
Graphical calculator / GDC (exam mode)
用途: Evaluate a definite integral \(\int_a^b f(x)\,dx\) or a gradient \(f'(x)\) at a point.
使用時機: Checking calculus answers, or where only a numerical value is needed.
步驟
Use the GDC's numeric integral / derivative function with the limits or the point.
考試提示: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.
Statistics & probability distributions
Graphical calculator / GDC (exam mode)
用途: 1-var/2-var statistics, linear regression, and cumulative binomial / normal / Poisson probabilities without tables.
使用時機: Statistics questions and hypothesis tests.
步驟
Enter data in the statistics editor, or use the distribution menu (binomial cdf, normal cdf, …).
考試提示: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.
常見錯誤
1high涉及分數: 2Operating Systems
Inability to clearly distinguish paging from segmentation.
如何避免: Remember that paging divides memory into fixed-size physical blocks (partitions), whereas segmentation divides memory into logical, variable-sized blocks based on semantics/program structure.
2high涉及分數: 9Ethical, moral and cultural issues
Providing generic, superficial arguments in 9-mark essay questions without tying them to the scenario context.
如何避免: Always apply the technical definitions directly to the given scenario (e.g., using terms like 'pupils', 'bandwidth', or 'school server' when discussing thin clients for a school system).
3medium涉及分數: 2Algorithms
Losing track of array boundary limits in loops (e.g. looping from 0 to length - 1 in bubble sort and getting a crash).
如何避免: If accessing elements with 'index + 1' inside your loop, always ensure your loop terminates at length - 2 or check that the upper boundary does not cause an out-of-bounds error.
4medium涉及分數: 3Programming techniques
Confusing byVal and byRef parameter passing mechanisms, assuming byVal alters the original variable.
如何避免: Recognize that byVal parameters receive a local copy of data, so changes remain local to the subroutine. Use byRef when you need the changes to persist and update the caller's argument.
5medium涉及分數: 1Data Types
Omitting intermediate calculations/workings in two's complement and sign/magnitude conversions.
如何避免: Always write down the intermediate steps (such as listing place values, or showing the bitwise inversion step) to guarantee partial/method marks.
6medium涉及分數: 2Databases
In ER diagrams, incorrectly connecting entities directly (e.g. Customer to Product) when there is a many-to-many relationship.
如何避免: Decompose many-to-many relationships by introducing an intermediary junction entity (like Order or OrderLine) with correct one-to-many crow's foot links.
7low涉及分數: 2Web Technologies
Writing syntax slips in client-side JavaScript password or field validation, such as using incorrect camelCase capitalization.
如何避免: Always check exact case-sensitivity. Write camelCase correctly: document.getElementById("id") and label.innerHTML. Do not mix cases.
8medium涉及分數: 6Structure and function of the processor
Using illegal mnemonics or mixing memory address styles in Little Man Computer (LMC) assembly code.
如何避免: Strictly stick to official OCR LMC instructions (ADD, SUB, STA, LDA, BRZ, BRP, BRA, INP, OUT, HLT, DAT) and always declare data labels at the bottom.
9high涉及分數: 8Algorithms
Failing to check 'fizz buzz' (modulo 3 AND 5) condition first in a fizz-buzz game loop.
如何避免: In multi-condition branches, always evaluate the most restrictive combined condition (MOD 3 == 0 and MOD 5 == 0) first, before testing individual cases.