June 2023 QP - Paper 2 OCR Computer Science GCSE

Sep 5, 2026

GCSE Computer Science examination paper focused on computational thinking, algorithms, and programming. The assessment includes classification of programming languages as low-level or high-level, pseudocode practice for arithmetic operations, operator completion in partial algorithms, and tracing a loop-based routine using a trace table. Additional sections require identification and correction of syntax versus logic errors in a flawed array-summing algorithm, and explanation of variables within an insertion sort pseudocode procedure.

LanguageEnglish

CategoryExam

FormatPDF

Pages20

Reading Time50 min

AccessFree to download

SECTION A

Question 1

Question 2

Question 3

Oxford Cambridge and RSA Thursday 25 May 2023 – Afternoon GCSE (9–1) Computer Science J277/02 Computational thinking, algorithms and programming Time allowed: 1 hour 30 minutes Do not use: • a calculator PMT | Please write clearly in black ink. Do not write in the barcodes. | | | | | --- | --- | --- | --- | | Centre number | | Candidate number | | | First name(s)
Last name | | | | INSTRUCTIONS • Use black ink. • Write your answer to each question in the space provided. If you need extra space use the lined pages at the end of this booklet. The question numbers must be clearly shown. • Answer all the questions. INFORMATION • The total mark for this paper is 80. • The marks for each question are shown in brackets [ ] . • This document has 20 pages. ADVICE • Read each question carefully before you start your answer. © OCR 2023 [601/8355/X] DC (ST) 326517/4 OCR is an exempt Charity Turn over PMT 2 SECTION A 1 (a) The table contains four statements about programming languages. Tick (3) one box in each row to identify whether each statement describes a low-level programming language or a high-level programming language. | Statement | Low-level | High-level | | --- | --- | --- | | The same language can be used on computers that use different hardware | | | | It allows the user to directly manipulate memory | | | | It allows the user to write English-like words | | | | It always needs to be translated into object code or machine code | | | [4] (b) The variables num1 and num2 store integers. Write pseudocode to add the integers stored in num1 and num2 . Store the result in a variable with the identifier total ................................................................................................................................................... .............................................................................................................................................. [ 1] (c) Three incomplete pseudocode algorithms are given with a description of the purpose of each algorithm. Write the missing arithmetic operator for each algorithm. (i) Outputting 12 to the power of 2. print(12 2) [1] (ii) Working out if a number is odd or even. number = 53 if number 2 == 0 then print("Even number") else print("Odd number") endif [1] PMT 3 (iii) Finding the difference between two measurements. measurement1 = 300 measurement2 = 100 difference = measurement1 measurement2 [1] (d) Read the following pseudocode algorithm: 01 start = 3 02 do 03 print(start) 04 start = start - 1 05 until start == -1 06 print("Finished") Complete the following trace table for the given algorithm. | Line number | start | Output | | --- | --- | --- | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | [3] © OCR 2023 Turn over PMT 4 2 This pseudocode algorithm totals all the numbers in the 0-indexed array scores 01 total = 0 02 for scoreCount = 1 to scores.length – 1 03 scores[scoreCount] = total + total 04 next scoreCount 05 print(total) The function length returns the number of elements in the array. The algorithm contains several errors. Two types of errors in a program are syntax and logic errors. (a) State what is meant by a syntax error and a logic error. Syntax error .............................................................................................................................. ................................................................................................................................................... Logic error ................................................................................................................................ ......................................................

FAQs

What programming language features are students asked to compare?

Students compare four statements to decide whether each describes a low-level or a high-level programming language, including direct memory manipulation, English-like wording, hardware independence, and whether translation to machine code is always required.

What kinds of pseudocode tasks appear in the paper?

Tasks include writing pseudocode to add two integers, supplying missing arithmetic operators in incomplete algorithms, and completing a trace table for a loop that prints values and a final message.

How do the questions test understanding of errors and sorting algorithms?

Students define syntax versus logic errors, then identify and rewrite corrected lines to fix logic issues in a flawed array-totaling algorithm. Another question evaluates understanding of insertion sort by asking about the purpose of a temporary variable in the pseudocode.

Sep 5, 2026

Upload by Jordan Avery