OCRAS Level29 resources

OCR AS Level Computer Science Past Papers

Download OCR AS Level Computer Science (H046) past papers and mark schemes. Computer Principles and Algorithms and Problem Solving components. 4 resources.

πŸ“…June 2016 – presentπŸ“„29 resources availableβœ…Free to download

Download Past Papers

Type
Year

29 of 29 resources β€” page 1 of 2

June 2023

8 files
πŸ“‹

Computer Science – Modified papers

Modified Paper
πŸ“Š

Computer Science – Examiners’ report – Algorithms and problem solving

Examiner Report
πŸ“„

Computer Science – Question paper – Algorithms and problem solving

Question Paper
πŸ“Š

Computer Science – Examiners’ report – Computing principles

Examiner Report
βœ…

Computer Science – Mark scheme – Algorithms and problem solving

Mark Scheme
βœ…

Computer Science – Mark scheme – Computing principles

Mark Scheme
πŸ“‹

Computer Science – Modified papers

Modified Paper
πŸ“„

Computer Science – Question paper – Computer principles

Question Paper

June 2022

5 files
πŸ“‹

Computer Science – Modified papers

Modified Paper
βœ…

Computer Science – Mark scheme – Algorithms and problem solving

Mark Scheme
βœ…

Computer Science – Mark scheme – Computing principles

Mark Scheme
πŸ“‹

Computer Science – Modified papers

Modified Paper
πŸ“„

Computer Science – Question paper – Computer principles

Question Paper

November 2021

3 files
πŸ“Š

Computer Science – Examiners’ report

Examiner Report
πŸ“Š

Computer Science – Examiners’ report

Examiner Report
πŸ“‹

Computer Science – Modified papers

Modified Paper

November 2020

8 files
πŸ“Š

Computer Science – Examiners’ report

Examiner Report
πŸ“Š

Computer Science – Examiners’ report

Examiner Report
πŸ“‹

Computer Science – Modified papers

Modified Paper
πŸ“„

Computer Science – Question paper – Computer principles

Question Paper
βœ…

Computer Science – Mark scheme – Algorithms and problem solving

Mark Scheme
βœ…

Computer Science – Mark scheme – Computer principles

Mark Scheme
πŸ“‹

Computer Science – Modified papers

Modified Paper
πŸ“„

Computer Science – Question paper – Algorithms and problem solving

Question Paper

Unknown

1 file
πŸ“Š

Computer Science – Examiners’ report – Computing principles

Examiner Report

Computer Architecture, Data Representation, and Algorithm Design at AS Level

OCR AS Level Computer Science (H046) covers the theoretical foundations of computing and the practical skills of algorithm design and programming through two examined components. The specification develops students' understanding of how computers work, how data is represented and processed, and how problems can be broken down and solved algorithmically. Component 1: Computer Principles (H046/01, 1 hour 30 minutes, 70 marks) covers the theoretical foundations: the structure and function of the processor (the fetch-decode-execute cycle, the roles of registers β€” MAR, MDR, PC, ACC, CIR β€” the ALU, control unit, and cache memory), primary and secondary storage (RAM, ROM, HDD, SSD, optical media β€” their characteristics and appropriate uses), data representation (binary and hexadecimal number systems, two's complement for signed integers, floating-point representation, ASCII and Unicode for characters, bitmap and vector graphics, sampling and bit depth for sound), networking (LAN, WAN, the OSI model, protocols β€” TCP/IP, HTTP, FTP, DNS β€” and network security), and software (operating system functions, language translators β€” assembler, compiler, and interpreter β€” and system software). Component 2: Algorithms and Problem Solving (H046/02, 1 hour 30 minutes, 70 marks) is computational in character. It assesses algorithm design using pseudocode and flowcharts, data structures (arrays, stacks, queues, linked lists, and binary search trees), sorting algorithms (bubble sort, merge sort, insertion sort β€” and their time complexity using Big-O notation), searching algorithms (linear search and binary search), graph algorithms (Dijkstra's shortest path and depth-first and breadth-first traversal), programming concepts (variables, data types, selection, iteration, subroutines, and recursion), and computational thinking (decomposition, abstraction, pattern recognition, and algorithmic thinking). Students are expected to trace, write, and evaluate algorithms in OCR pseudocode notation.

Exam Paper Structure

Component 1No calculator

Computer Principles

⏱ 1 hour 30 minutes🎯 70 marksπŸ“Š 50%% of grade
Processor architecture and the fetch-decode-execute cycleData representation: binary, hex, two's complementStorage media and networkingOperating systems and language translators
Component 2No calculator

Algorithms and Problem Solving

⏱ 1 hour 30 minutes🎯 70 marksπŸ“Š 50%% of grade
Algorithm design in pseudocode and flowchartsData structures: stacks, queues, treesSorting and searching algorithms with Big-O analysisGraph algorithms and computational thinking

Key Information

Exam BoardOCR
Specification CodeH046
QualificationAS Level
Grading ScaleA–E
Assessment Type2 written papers
Number Of Papers2
Exam Duration1 hour 30 minutes per paper
Total Marks140 (70 + 70)
Calculator StatusNot required; pseudocode reference card provided
Available SessionsJune 2016 – present
Total Resources4

Key Topics in Computer Science

Topics you need to know

Binary and hexadecimal number systemsTwo's complement and floating-point representationProcessor registers and the fetch-decode-execute cycleAlgorithm tracing with trace tablesBubble sort, merge sort, binary searchBig-O time complexityComputational thinking: decomposition and abstraction

Exam Command Words

Command wordWhat the examiner expects
TraceComplete a trace table by following the algorithm step-by-step
StateGive a concise factual answer without explanation
DescribeGive an account of a process, system, or feature in sufficient detail
JustifyGive reasons for a choice or claim, referencing the relevant technical principle

Typical Grade Boundaries

GradeApproximate mark needed
A70–85%
B58–69%
C46–57%
D34–45%
E22–33%

⚠️ OCR AS Computer Science grade boundaries vary by session.

Two's Complement Arithmetic, Algorithm Tracing, and Big-O Complexity Analysis

Data representation questions require fluency in converting between number bases. For binary to decimal: multiply each bit by its place value (2⁷, 2⁢, ..., 2⁰) and sum. For hexadecimal to binary: convert each hex digit independently to a 4-bit binary group. For two's complement negative numbers: invert all bits then add 1. For example, to represent βˆ’25 in 8-bit two's complement: write +25 as 00011001, invert to get 11100110, add 1 to get 11100111. To check: 11100111 = βˆ’128 + 64 + 32 + 0 + 0 + 4 + 2 + 1 = βˆ’25. Practise this conversion direction and its reverse until it is automatic. For algorithm tracing questions, use a trace table with a column for each variable and one for any output. Initialise all variables as shown in the algorithm, then work through each line in strict order, updating variable values with each assignment and recording output when print statements are reached. Loop questions require careful tracking of the loop counter variable β€” common errors include failing to update the counter, applying the termination condition incorrectly, or missing the last iteration. Big-O notation questions ask about the time complexity of algorithms in terms of input size n. Binary search is O(log n) because each step halves the search space. Bubble sort and insertion sort are both O(nΒ²) in the worst case because for n items, up to n passes of up to n comparisons may be needed. Merge sort is O(n log n) β€” significantly more efficient for large inputs. For a question asking you to 'justify' a Big-O complexity: state the number of operations required in terms of n, explain why additional input causes this proportional increase, and compare it with alternative complexities where the question asks for comparison.

More OCR AS Level Subjects

Explore other AS Level subjects from OCR

Related Past Papers

AI-Powered Revision

Meet your AI Tutor

Get clear explanations, worked examples, and step-by-step guidance on any AS Level Computer Science topic. Your personal AI tutor, free to try.

βœ“ No credit card requiredβœ“ Covers all OCR topicsβœ“ Instant answers