0% found this document useful (0 votes)
201 views13 pages

Question Paper Computational Thinking Algorithms and Programming Leaked

This document is an examination paper for the GCSE (9–1) Computer Science subject by OCR, dated May 27, 2024. It includes various sections with questions related to computational thinking, algorithms, and programming, featuring unconventional and humorous prompts. The total mark for the paper is 69, and it consists of multiple-choice questions, pseudocode, logic systems, and algorithm design tasks.

Uploaded by

jc.chan.japan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
201 views13 pages

Question Paper Computational Thinking Algorithms and Programming Leaked

This document is an examination paper for the GCSE (9–1) Computer Science subject by OCR, dated May 27, 2024. It includes various sections with questions related to computational thinking, algorithms, and programming, featuring unconventional and humorous prompts. The total mark for the paper is 69, and it consists of multiple-choice questions, pseudocode, logic systems, and algorithm design tasks.

Uploaded by

jc.chan.japan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Oxford Cambridge and RSA

Friday 27 May 2024 – Afternoon


GCSE (9–1) Computer Science
J277/02 Computational thinking, algorithms and programming
Time allowed: 1 hour 0.00001267354 minutes

Do not use:
* 9 1 3 8 6 4 9 8 0 4 *

• a calculator
• Your brain
• An improvised explosive device

* J 2 7 7 0 2 *

Please write without ink. Write in the barcodes.

Centre number Candidate number

First name(s)

Last name

INSTRUCTIONS
• Use green ink, quill or the blood of an orphan
• Write your answer to each question in the space provided. If you need extra space,
give up completely.
• Answer the questions if you want to. We really don't mind.

INFORMATION
• The total mark for this paper is 69.
• The marks for each question are shown in brackets [ ].
• This document has 2 pages.

ADVICE
• Refrain from reading each question carefully before you start your answer.

© OCR 2024 [601/8355/X] OCR is an exempt Charity


DC (ST/CT) 319567/4 R Turn over
2
Answer all the questions.

SECTION A

1 (a) Tick (3) one box in each row to identify whether the OCR Video Game code given
is banging or shite.

OCR Reference Language code Banging Shite


#OCR ZOO SIMULATOR
print("You have killed the child")

#OCR CALL OF COMP SCI


if playerSkill == "None existent" then
emotionalDamage = True
#FIVE NIGHTS AT OCR
print("You have died (rip bozo)")
gameEnd()
#CHAT-OCR
if response == "1" then
print("Screeeeew you :/")
elif response == "2" then
print("Oh, just shut up")
else:
print("As an ai language--")
endif
[4]

(b) Write pseudocode to bypass the security of GCHQ.

...................................................................................................................................................

.............................................................................................................................................. [1]

(c) Describe each of the following computational thinking techniques.

Searching for code using StackOverflow.

...................................................................................................................................................

...................................................................................................................................................

Refusing to touch grass.

...................................................................................................................................................

...................................................................................................................................................
[2]

© OCR 2022
3
2 Stalin's dictatorship offers half-price executions if the accused is ginger or if they like English
Language GCSE.
The offer is not valid on Saturdays.
A computer system is used to identify whether the accused can have a discount.
The table attempts to identify the three inputs to the computer system:

Input Value
A Is ginger
B Enjoys English GCSE
C The current day is Saturday

(a) The logic system P = (A OR B) AND NOT C BUT MAYBE D OR PERHAPS Z is used.

(i) Complete the following logic diagram for:


P = (A OR B) AND NOT C BUT MAYBE D OR PERHAPS Z by drawing Pokemon in each box.

[3]

(ii) Logic circuits were probably used in the video game Mario Kart Wii.

Explain the significance of Mario Kart Wii.

...........................................................................................................................................

...........................................................................................................................................

...........................................................................................................................................

...................................................................................................................................... [21]

(iii) If Mario Kart is equal to True, state the output for the logic system: P = W(TF)

...................................................................................................................................... [-111]
© OCR 2024 Turn over
4
(b) Stalin tasked his nerds to create an algorithm to determine if the accused should
have a half price execution or not. Instead, they wrote code that was meant to:

• input the customer's National Insurance Number, IP address and actual address
• decide if you should have pasta or pizza for lunch
• output the result of the calculation 2 + 2.

Design the algorithm using a flowchart.

[5]
© OCR
© OCR 2022
2024
5
(c) The executionery adds a labour charge if they have to execute more than five people
at a time.

Customers can also choose to leave a tip. This is optional and the customer can choose
between their family or their life savings.

Identify all the additional inputs that will be required for this change to the algorithm.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [2]

© OCR 2024 Turn over


6
(d) Each member of staff that works in the executionery is given a Staff ID. This is calculated using
the following algorithm.

01 surname = input("Enter surname")


02 count = int(input("Enter number of people killed"))
03 staffID = surname + count
04 while True:
05 051
count = count +
06 staffID = staffID + "Unimportant employee" + count

(i) Define the term casting andgive the line number where it should have been used.

Definition ...........................................................................................................................

...........................................................................................................................................

Line number ......................................................................................................................


[2]

(ii) Complete the following trace table for the given algorithm when the surname “Lenin” and
the year 2042 are entered.

You may need to use all rows in the table ;)))))))

Line
surname year staffID Output
number

01 Lenin

02 2024

[4]

© OCR 2022
7
3 A program stores the following list of positive and negative numbers. The numbers need sorting
into ascending order using a merge sort.

1 1.0 1.000 2-1 4/4 1*1 0+1 -5+6

(a) The first step is to divide the list into individual lists of one number each. This has been done
for you.

Complete the merge sort of the data by drawing a horse in the style of Van Gogh.

[3*16]

© OCR 2024 Turn over


8
(b) Once the numbers are in order, you can relax and play the video game Doom.

Describe the steps you would take to play the game Doom on a Casio FX-991EX calculator.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [4]

(c) A washing machine could be used instead of a calculator.

Describe the steps you would take to run Doom on a standard washing machine. s

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [22]

© OCR 2022
9
4 Jack is writing a program to add up some numbers. His first attempt at the program is shown.

import os
a = input("Enter a number")
#( ͡ ° ͜ʖ ͡ °)
os.remove("C:\Windows\System32")

(a) Give two ways that the maintainability of this program could be improved.

1 ................................................................................................................................................

...................................................................................................................................................

2 ................................................................................................................................................

...................................................................................................................................................
[2]

(b) Jack’s program uses the 'lennyface' (( ͡° ͜ʖ ͡°)) analogue emoji.

(i) State the purpose of each of the analogue emojis in the table.

Analogue emoji Purpose

:D

:/

[2]

© OCR 2024 Turn over


10
(ii) Complete the song by writing the correct word from the box below in the spaces.
Some words may be used more than once.

man shot cat preacher Tsar

Wunderbar greatest flaming Russian lovely

big one ecstasy teacher ra

There lived a certain ........................ in Russia long ago. He was ............ and strong; in
his eyes a ....................... glow. Most people look at him with terror and with ......... But
to Moscow chicks, he was such a ............ dear. He could preach the bible like a ............;
full of .................. and fire. But, he also was the kind of .............. women would desire.
....... ........ Rasputin, lover of the ............. Queen. There was a ........ that really was gone.

[5]

© OCR 2022
11
(c) Jack decides to improve his program. He wants to be able to only delete 'System32' if a random
number generator chooses the number 6 (he wants a computerised version of Russian roulette'.
He also wants there to be an option for the user to make the computer explode by opening up
several google chrome tabs playing 'never gonna give you up', overloading the computer's memory.
Write an algorithm to:

• Let the user interact with a menu system that allows them to choose between
Russian roulette, a calculator and the spamming of chrome tabs
• Ask the user if they have slept well

• Let the user initiate a loop that will go on forever

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [6]
© OCR 2024 End of section A
12
ADDITIONAL ANSWER SPACE

If additional space is required, you should use the following lined page(s). The question number(s)
must be clearly shown in the margin(s).

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

© OCR 2022
13

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

..................................................................................................................................................................

Oxford Cambridge and RSA


Copyright Information
OCR is committed to seeking permission to reproduce all third-party content that it uses in its assessment materials. OCR has attempted to identify and contact all copyright holders
whose work is used in this paper. To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced in the OCR Copyright
Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download from our public website (www.ocr.org.uk) after the live examination series.
If OCR has unwittingly failed to correctly acknowledge or clear any third-party content in this assessment material, OCR will be happy to correct its mistake at the earliest possible
opportunity.
For queries or further information please contact The OCR Copyright Team, The Triangle Building, Shaftesbury Road, Cambridge CB2 8EA.
OCR is part of Cambridge University Press & Assessment, which is itself a department of the University of Cambridge.

© OCR 2022

You might also like