100% found this document useful (1 vote)

893 views

iG Computer Science - Question paper 1 ( Jun 2024)

Uploaded by

kyalsinthantliu

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

100% found this document useful (1 vote)

893 views

iG Computer Science - Question paper 1 ( Jun 2024)

Uploaded by

kyalsinthantliu

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/ 36

Please check the examination details below before entering your candidate information

Candidate surname Other names

Centre Number Candidate Number

Pearson Edexcel International GCSE (9–1)

Thursday 23 May 2024
Afternoon (Time: 2 hours) Paper
reference 4CP0/01
Computer Science  

PAPER 1: Principles of Computer Science

You must have: Total Marks

Pseudocode command set (enclosed)

Instructions
•• Use black ink or ball-point pen.
Fill in the boxes at the top of this page with your name,
centre number and candidate number.
•• Answer all questions.
Answer the questions in the spaces provided
– there may be more space than you need.

Information
•• The total mark for this paper is 80.
The marks for each question are shown in brackets
– use this as a guide as to how much time to spend on each question.
• You are not allowed to use a calculator.
Advice
•• Read each question carefully before you start to answer it.
Try to answer every question.
•• Check your answers if you have time at the end.
Marks will not be awarded for using product or trade names in answers without
further explanation.

Turn over

P75736A
©2024 Pearson Education Ltd.
F:1/1/1/e2
*P75736A0128*
Answer ALL questions. Write your answers in the space provided.
Some questions must be answered with a cross in a box . If you change your mind about an

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
answer, put a line through the box and then mark your new answer with a cross .
1 There are different ways to connect computers in a network.
(a) Give two differences between a WAN and a LAN.
(2)

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

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

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

(b) Give one security risk of connecting computers in a network.

(1)

2
*P75736A0228* 
(c) Figure 1 shows a network topology.
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

Figure 1

(i) State the name of this network topology.

(1)

(ii) State one drawback of using this network topology.

(1)

(iii) A fault tolerant network delivers a reliable service.

Explain one reason why this topology is fault tolerant.
(2)

3
 *P75736A0328* Turn over
(d) Identify which layer of the 4‑layer TCP/IP model is responsible for transferring
packets across a network.
(1)

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
A Application layer

B Transport layer

C Network layer

D Data link layer

(e) Here is the address for a web page.

https://www.pearson.com/computing/specification.html
(i) State the protocol being used.
(1)

(ii) Give the name of the document being retrieved.

(1)

(Total for Question 1 = 10 marks)

4
*P75736A0428* 
Turn over
5
*P75736A0528*
BLANK PAGE


DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
2 Computer systems use hardware and software.
(a) Two types of software are application software and system software.

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
(i) State the purpose of application software.
(1)

(ii) One function of an operating system is to provide a user interface.

State three other functions of an operating system.
(3)

3 ............................ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ............................................................................................................................................ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

6
*P75736A0628* 
(b) Computers use different types of storage.
(i) Explain one reason why computers need both RAM and ROM.
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

(2)

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

(ii) Describe how data is read from a magnetic hard drive.

(3)

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

(c) Computers perform the fetch‑decode‑execute cycle.

Complete the table by writing the numbers 1 to 4 in the sequence number
column to put each stage in the correct order.

Stage Sequence number

The instruction is placed onto the data bus

The Arithmetic and Logic Unit (ALU) performs a calculation

The address of the next instruction is placed onto the address bus

The instruction is decoded by the control unit

(4)

7
 *P75736A0728* Turn over
(d) Identify which one of these buses is unidirectional.
(1)

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
A Address bus

B Control bus

C System bus

D Data bus
(Total for Question 2 = 14 marks)

8
*P75736A0828* 
Turn over
9
*P75736A0928*
BLANK PAGE


DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
3 Computers use binary to represent and store data.
(a) Two images are stored.

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
• Image 1 has a colour depth of 8 bits.
• Image 2 has a colour depth of 16 bits.

(i) State the number of colours that can be represented in Image 1.

(1)

(ii) Image 2 is 1920 pixels wide by 1080 pixels high.

Construct an expression to show the file size of the image in mebibytes.
You do not need to do the calculation.
(3)

(iii) One pixel in Image 1 is represented by the unsigned binary integer

1100 1010
Identify the denary equivalent.
(1)
A 54

B 191

C 202

D –74

10
*P75736A01028* 
(b) A register holds the value 1100 0001 as an 8‑bit binary value in two’s complement.
(i) Convert the two’s complement binary integer 1100 0001 to denary.
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

(2)

(ii) Give the result of applying an arithmetic shift left by one to the binary pattern
1100 0001
(1)

(iii) The value 1111 1111 is added to the value 1100 0001 stored in the register.
An error occurs.
Explain this error.
(2)

11
 *P75736A01128* Turn over
(c) The ASCII code for the character 1 is 011 0001
(i) Give the ASCII code for the character 5

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
(1)

(ii) Give two benefits of using ASCII to encode characters.

(2)

(Total for Question 3 = 13 marks)

12
*P75736A01228* 
13
Turn over
*P75736A01328*
BLANK PAGE


DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
4 Peter and Marie are employees at a research facility.
(a) Peter is creating a predator‑prey population simulation of rabbits and foxes.

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
He creates rules to simulate the movement and feeding patterns for each animal
over time.
One benefit of the predator‑prey simulation is that it is simpler than monitoring
real life animal populations.
Explain one other benefit of using this simulation.
(2)

(b) Identify the computational model in which several computer systems work
together to achieve a goal.
(1)
A Sequential model

B Parallel model

C Multi‑agent model

D Input‑process‑output model

(c) Employees at the research facility use a biometric identifier to login to

the network.
Describe one other security measure that could be used to ensure that an
employee is who they claim to be.
(2)

14
*P75736A01428* 
(d) Marie is a researcher in nanotechnology.
(i) State what is meant by the term nanotechnology.
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

(1)

(ii) Give one application of nanotechnology.

(1)

(e) Marie has a mobile phone.

The address of the device is:
2024:0eb8:3c4d:0015:0000:0000:1a2f:1a2b
Describe the relationship between the structure of this address and the total
number of bits required to store it.
(3)

15
 *P75736A01528* Turn over
(f ) The research facility is considering introducing cameras and facial recognition
software to monitor the work and movement of people on and around its site.

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
Discuss the privacy issues that need to be considered when deciding whether or
not to install this new system.
(6)

(Total for Question 4 = 16 marks)

16
*P75736A01628* 
17
Turn over
*P75736A01728*
BLANK PAGE


DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
5 A team is developing a computer game.
(a) Complete the table by adding a tick () to show the characteristics of program

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
language translators.
You may select more than one translator per characteristic.
(3)

Translator

Characteristic Assembler Interpreter Compiler

Does not have to be present

in memory to execute the
translated code.
Translates high level language
source code.
Executes high level code until either
the program has finished, or a syntax
error is encountered.
Translates low level language source
code into machine code.

(b) Luca is testing the computer game.

The computer that he is using is an older model with a processor that runs at a
low clock speed.
Explain one drawback of testing the game using this computer.
(2)

18
*P75736A01828* 
(c) Anna uses utility software.
Complete the table by adding the type of utility software she should use to solve
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

each issue.

Issue Utility software

Her word processor cannot read all of

a file because it is corrupt.
She has a JPEG image and needs to
send it to a publisher who can only
read PNG image files.
There has been a flood and files on
a server have been damaged, but
Anna needs to access her data.
Her hard drive is running very slowly
when she tries to access a file.

(4)

19
 *P75736A01928* Turn over
(d) Tarik is writing an instruction manual for the computer game.
He decides to use software to compress the instruction manual before emailing it

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
to a proofreader for checking.
State and justify the most appropriate compression method.
(3)
Method

Justification

(e) Members of the team developing the game are either coders or designers.
Coders (C) write the application code.
Designers (D) design the graphics for the game and write instruction manuals.
Team members have one role only.
Construct a logic statement, using AND, OR and NOT with the letters C and D, to
show the conditions for being a member of the team.
(3)

(Total for Question 5 = 15 marks)

20
*P75736A02028* 
21
Turn over
*P75736A02128*
BLANK PAGE


DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
6 Pseudocode and flowcharts are used to create algorithms.
(a)6.The
Pseudocode
number ofand flowcharts
minutes a trainare used or
is early to late
create
arealgorithms.
recorded each day for a week.

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
• (a)
A The
valuenumber
of 0 is of minutesif athe
recorded train
train is is on time.
early or late are recorded each day for a week.

• A negative
• A valuevalue
of 0isisrecorded
recordedififthe
thetrain
trainisisearly.
on time.
• • A negative
A positive value
value is is recorded
recorded if theistrain
if the train late. is early.
• A positive value is recorded if the train is late.
The algorithm in Figure 2 has been created to calculate and output the total
The algorithm in Figure 1 has been created to calculate and output the total
number of trains that were early, on time or late.
number of trains that were early, on time or late.
01
02 SET arrival TO [-2, 1, 5, 0, -3, 4, 1]
03
04 SET early TO 0
05 SET late TO 0
06 SET index TO 0
07
08 WHILE NOT (index > LENGTH(arrival)) DO
09
10 IF arrival[index] >= 0 THEN
11 SET late TO arrival[index]
12 ELSE
13 IF arrival[index] < 0 THEN
14 SET early TO early + 1
15 END IF
16 END IF
17
18 SET index TO index + 1
19
20 END WHILE
21
22 SEND "Trains early: " & early TO DISPLAY
23 SEND "Trains on time: " & (late + early) TO DISPLAY
24 SEND "Trains late: " & late TO DISPLAY
25

Figure 1
Figure 2

Identify the type of iteration construct used in Figure 2.

(1)
Identify the type of iteration construct used in Figure 1.
A Post‑conditioned loop
(1)
B Count
 A controlled loop
Post-conditioned loop
 B Count controlled loop
C Array loop
 C Array loop
 D Pre-conditioned
D Pre‑conditioned loop loop

22
18
*P75736A02228* 
(b) There are four errors in the pseudocode in Figure 2.
Write the correct code for lines 08, 10, 11 and 23
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

(i) Line 08
(1)

(ii) Line 10
(1)

(iii) Line 11
(1)

(iv) Line 23
(1)

23
 *P75736A02328* Turn over
(d) In the game FizzBuzz a user enters a number.
These conditions apply:

DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
• if the number is divisible by 3 the program displays Fizz
• if the number is divisible by 5 the program displays Buzz
• if the number is divisible by both 3 and 5 the program displays FizzBuzz
• if the number is not divisible by either 3 or 5, the program displays the
number entered.
Hint: If one number is divisible by another number there is no remainder.
These are the components needed for the flowchart.

Start Stop

Get
number

Is number Is number Is number

divisible by 3? divisible by 5? divisible by 5?

Display Display
number Fizz

Display Display
Buzz FizzBuzz

Draw the flowchart for the algorithm used in the game in the box on the
next page.
Use each component once.
Do not add any additional components.
Use as many arrows and yes/no labels as you need.
(6)

24
*P75736A02428* 
Draw your flowchart here.
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA

(Total for Question 6 = 12 marks)

TOTAL FOR PAPER = 80 MARKS

25
 *P75736A02528*
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA


*P75736A02628*
BLANK PAGE

26
27
*P75736A02728*
BLANK PAGE


DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA


*P75736A02828*
BLANK PAGE

28
Pearson Edexcel International GCSE (9–1)
Thursday 23 May 2024
Paper
reference 4CP0/01
Computer Science
 

Component 1
Pseudocode command set

Resource Booklet
Do not return this Booklet with the question paper.

Turn over

P75736A
©2024 Pearson Education Ltd.
F:1/1/1/e2
*P75736A*
Pseudocode command set
Questions in the written examination that involve code will use this pseudocode
for clarity and consistency. However, students may answer questions using any
valid method.
Data types
INTEGER
REAL
BOOLEAN
CHARACTER
Type coercion
Type coercion is automatic if indicated by context. For example 3 + 8.25 = 11.25
(integer + real = real)
Mixed mode arithmetic is coerced like this:

INTEGER REAL

INTEGER INTEGER REAL

REAL REAL REAL

Coercion can be made explicit. For example, RECEIVE age FROM (INTEGER) KEYBOARD
assumes that the input from the keyboard is interpreted as an INTEGER, not a STRING.
Constants
The value of constants can only ever be set once. They are identified by the keyword
CONST. Two examples of using a constant are shown.
CONST REAL PI
SET PI TO 3.14159
SET circumference TO radius * PI * 2
Data structures
ARRAY
STRING
Indices start at zero (0) for all data structures.
All data structures have an append operator, indicated by &.
Using & with a STRING and a non-STRING will coerce to STRING. For example, SEND ‘Fred’
& age TO DISPLAY, will display a single STRING of ‘Fred18’.

2 P75736A

Identifiers
Identifiers are sequences of letters, digits and ‘_’, starting with a letter, for example:
MyValue, myValue, My_Value, Counter2
Functions
LENGTH()
For data structures consisting of an array or string.
RANDOM(n)
This generates a random number from 0 to n.
Comments
Comments are indicated by the # symbol, followed by any text.
A comment can be on a line by itself or at the end of a line.
Devices
Use of KEYBOARD and DISPLAY are suitable for input and output.
Additional devices may be required, but their function will be obvious from the context.
For example, CARD_READER and MOTOR are two such devices.
Notes
In the following pseudocode, the < > indicates where expressions or values need to be
supplied. The < > symbols are not part of the pseudocode.

P75736A 3
 Turn over
Variables and arrays

Syntax Explanation of syntax Example

SET Counter TO 0
SET Variable TO <value> Assigns a value to a variable.
SET MyString TO ‘Hello world’

Computes the value of an

SET Sum TO Score + 10
SET Variable TO <expression> expression and assigns to
SET Size to LENGTH(Word)
a variable.

Assigns a value to an element SET ArrayClass[1] TO ‘Ann’

SET Array[index] TO <value>
of a one-dimensional array. SET ArrayMarks[3]TO 56

Initialises a one-dimensional
SET Array TO [<value>, ...] SET ArrayValues TO [1, 2, 3, 4, 5]
array with a set of values.

SET Array [RowIndex, Assigns a value to an element

SET ArrayClassMarks[2,4] TO 92
ColumnIndex] TO <value> of a two dimensional array.

Selection

Syntax Explanation of syntax Example

IF <expression> THEN IF Answer = 10 THEN

If <expression> is true then
<command> SET Score TO Score + 1
command is executed.
END IF END IF

IF <expression> THEN IF Answer = ‘correct’ THEN

If <expression> is true then first
<command> SEND ‘Well done’ TO DISPLAY
<command> is executed,
ELSE ELSE
otherwise second
<command> SEND ‘Try again’ TO DISPLAY
<command> is executed.
END IF END IF

4 P75736A

Repetition

Syntax Explanation of syntax Example

WHILE <condition> DO Pre-conditioned loop. Executes WHILE Flag = 0 DO

<command> <command> whilst SEND ‘All well’ TO DISPLAY
END WHILE <condition> is true. END WHILE

Post-conditioned loop.
REPEAT Executes REPEAT
<command> <command> until <condition> SET Go TO Go + 1
UNTIL <expression> is true. The loop must execute UNTIL Go = 10
at least once.

Count controlled loop. The

REPEAT <expression> TIMES REPEAT 100-Number TIMES
number of times <command>
<command> SEND ‘*’ TO DISPLAY
is executed is determined by
END REPEAT END REPEAT
the expression.

FOR <id> FROM <expression>

Count controlled loop. FOR Index FROM 1 TO 10 DO
TO
Executes SEND ArrayNumbers[Index]
<expression> DO
<command> a fixed number of TO DISPLAY
<command>
times. END FOR
END FOR
FOR <id> FROM <expression>
TO FOR Index FROM 1 TO 500 STEP
<expression> STEP Count controlled loop using 25 DO
<expression> DO a step. SEND Index TO DISPLAY
<command> END FOR
END FOR
SET WordsArray TO [‘The’, ‘Sky’,
‘is’, ‘grey’]
FOR EACH <id> FROM SET Sentence to ‘‘
Count controlled loop.
<expression> DO FOR EACH Word FROM
Executes for each element of
<command> WordsUArray DO
an array.
END FOREACH SET Sentence TO Sentence &
Word & ‘ ‘
END FOREACH

P75736A 5
 Turn over
Input/output

Syntax Explanation of syntax Example

SEND ‘Have a good day.’ TO

SEND <expression> TO DISPLAY Sends output to the screen.
DISPLAY

RECEIVE Name FROM (STRING)

KEYBOARD
RECEIVE <identifier> FROM
RECEIVE LengthOfJourney
(type) Reads input of specified type.
FROM (INTEGER) CARD_READER
<device>
RECEIVE YesNo FROM
(CHARACTER) CARD_READER

File handling

Syntax Explanation of syntax Example

Reads in a record from a <file>

and assigns to a <variable>.
READ <File> <record> READ MyFile.doc Record
Each READ statement reads a
record from the file.

Writes a record to a file.

WRITE MyFile.doc Answer1,
WRITE <File> <record> Each WRITE statement writes a
Answer2, ‘xyz 01’
record to the file.

Subprograms

Syntax Explanation of syntax Example

PROCEDURE CalculateAverage
PROCEDURE <id>
(Mark1, Mark2, Mark3)
(<parameter>, …)
BEGIN PROCEDURE
BEGIN PROCEDURE Defines a procedure.
SET Avg to (Mark1 + Mark2 +
<command>
Mark3)/3
END PROCEDURE
END PROCEDURE
FUNCTION AddMarks (Mark1,
FUNCTION <id>
Mark2, Mark3)
(<parameter>, …)
BEGIN FUNCTION
BEGIN FUNCTION
Defines a function. SET Total to (Mark1 + Mark2 +
<command>
Mark3)/3
RETURN <expression>
RETURN Total
END FUNCTION
END FUNCTION
Calls a procedure or a
<id> (<parameter>, …) Add (FirstMark, SecondMark)
function.

6 P75736A

Arithmetic operators

Symbol Description

+ Add

- Subtract

/ Divide

* Multiply

^ Exponent

MOD Modulo

DIV Integer division

Relational operators

Symbol Description

= equal to

<> not equal to

> greater than

>= greater than or equal to

< less than

<= less than or equal to

Logical operators

Symbol Description

Returns true if both conditions

AND
are true.
Returns true if any of the
OR
conditions are true.
Reverses the outcome of the
NOT expression; true becomes false,
false becomes true.

P75736A 7

BLANK PAGE

8 P75736A


AQA As and A Level Computer Science (P M Heathcote)
No ratings yet
AQA As and A Level Computer Science (P M Heathcote)
408 pages
Cambridge IGCSE Computer Science 2nd Edition Workbook 1 (Computer System) - Flipbook by Yahyashreaf - FlipHTML5
No ratings yet
Cambridge IGCSE Computer Science 2nd Edition Workbook 1 (Computer System) - Flipbook by Yahyashreaf - FlipHTML5
97 pages
Ocr A Level Computer Science For A Level Includes Annas Archive
No ratings yet
Ocr A Level Computer Science For A Level Includes Annas Archive
284 pages
AQA Comp Sci WB2 Answers Ms
No ratings yet
AQA Comp Sci WB2 Answers Ms
52 pages
1CP2 02 AdSAMS2 QU
No ratings yet
1CP2 02 AdSAMS2 QU
9 pages
2023 Mark Scheme
No ratings yet
2023 Mark Scheme
29 pages
Compsci Topic 7 Assessment Test
No ratings yet
Compsci Topic 7 Assessment Test
8 pages
MARKING SCHEME 1.3.1 Logic Gates
No ratings yet
MARKING SCHEME 1.3.1 Logic Gates
30 pages
Information and Communication Technology: Pearson Edexcel International GCSE
100% (1)
Information and Communication Technology: Pearson Edexcel International GCSE
20 pages
Computer Science: Pearson Edexcel GCSE
No ratings yet
Computer Science: Pearson Edexcel GCSE
20 pages
Paper 1 2023
100% (1)
Paper 1 2023
32 pages
Isaac Cs Gcse Book 2022
No ratings yet
Isaac Cs Gcse Book 2022
223 pages
4cp0-01-que-20240524
No ratings yet
4cp0-01-que-20240524
36 pages
GCSE L1 L2 Computer Science 2020 Sample Assessment Materials For Paper 1
No ratings yet
GCSE L1 L2 Computer Science 2020 Sample Assessment Materials For Paper 1
32 pages
2023 Specimen Paper 1b
No ratings yet
2023 Specimen Paper 1b
12 pages
CS past papers merged
No ratings yet
CS past papers merged
56 pages
Comsci 1 New
No ratings yet
Comsci 1 New
16 pages
4it1 01 Rms 20230824
No ratings yet
4it1 01 Rms 20230824
27 pages
Paper 1 Biology 2024 GCSE
No ratings yet
Paper 1 Biology 2024 GCSE
102 pages
02b IntGCSE Maths 4MB1 02 - November 2024 (PDF)
100% (1)
02b IntGCSE Maths 4MB1 02 - November 2024 (PDF)
36 pages
ICT Paper 2 Sample Paper (9-1) Mark Scheme PDF
No ratings yet
ICT Paper 2 Sample Paper (9-1) Mark Scheme PDF
11 pages
2023 Specimen Mark Scheme
No ratings yet
2023 Specimen Mark Scheme
14 pages
4ma1 1hr Rms 20220825 PDF
No ratings yet
4ma1 1hr Rms 20220825 PDF
23 pages
cs p1 fm 25
No ratings yet
cs p1 fm 25
12 pages
AQA COMP3 QP Jun14
No ratings yet
AQA COMP3 QP Jun14
36 pages
Paper 2 CS 2024
No ratings yet
Paper 2 CS 2024
24 pages
International Gcse: English As A Second Language
No ratings yet
International Gcse: English As A Second Language
4 pages
GCSE OCR J277 Question - Practice
100% (1)
GCSE OCR J277 Question - Practice
44 pages
Specimen (2023) QP - Paper 1 CAIE Computer Science GCSE
No ratings yet
Specimen (2023) QP - Paper 1 CAIE Computer Science GCSE
12 pages
Information and Communication Technology: Pearson Edexcel International GCSE
No ratings yet
Information and Communication Technology: Pearson Edexcel International GCSE
24 pages
Caie As Computer Science 9618 Practical Notes and Guide
No ratings yet
Caie As Computer Science 9618 Practical Notes and Guide
8 pages
IGCSE Computer Science - 2210 - Chapter 2
No ratings yet
IGCSE Computer Science - 2210 - Chapter 2
34 pages
G9 Logical Binary Shift (Past Paper) WS - Solved
No ratings yet
G9 Logical Binary Shift (Past Paper) WS - Solved
4 pages
Mock Exam Paper (Term 3) : Further Pure Mathematics
No ratings yet
Mock Exam Paper (Term 3) : Further Pure Mathematics
32 pages
A-Level Computer Science (7517) : Non-Exam Assessment (NEA) Guidance
No ratings yet
A-Level Computer Science (7517) : Non-Exam Assessment (NEA) Guidance
23 pages
Model Answer 4H 2017 January
No ratings yet
Model Answer 4H 2017 January
24 pages
9569/02 Computing
No ratings yet
9569/02 Computing
12 pages
Computer Science GCSE Knowledge Organisers
No ratings yet
Computer Science GCSE Knowledge Organisers
26 pages
OCR As and A Level Computer Science (Heathcote... (Z-Library)
No ratings yet
OCR As and A Level Computer Science (Heathcote... (Z-Library)
385 pages
Monday 11 May 2020: Information and Communication Technology (ICT)
100% (1)
Monday 11 May 2020: Information and Communication Technology (ICT)
20 pages
THEORY-IGCSE CS Notes - 241002 - 191305
No ratings yet
THEORY-IGCSE CS Notes - 241002 - 191305
22 pages
Cambridge IGCSE and O Level Computer Science Second Edition Boost Ebook
No ratings yet
Cambridge IGCSE and O Level Computer Science Second Edition Boost Ebook
1 page
01a 1MA1 1F November 2019 Examination Paper PDF
100% (1)
01a 1MA1 1F November 2019 Examination Paper PDF
20 pages
Caie As Computer Science 9618 Practical v3
No ratings yet
Caie As Computer Science 9618 Practical v3
9 pages
1ma1 3h Que 20221108 - 2
No ratings yet
1ma1 3h Que 20221108 - 2
24 pages
Mark Scheme h446 02
No ratings yet
Mark Scheme h446 02
29 pages
Chapter 1 IT 9626
No ratings yet
Chapter 1 IT 9626
36 pages
June 2023
No ratings yet
June 2023
32 pages
Ict - Igcse Ict Revision: 12 Grade ICT Week 03/oct - 07/oct
No ratings yet
Ict - Igcse Ict Revision: 12 Grade ICT Week 03/oct - 07/oct
21 pages
Paper 2 2023
No ratings yet
Paper 2 2023
24 pages
June 2019 (IAL) QP - S1 Edexcel
No ratings yet
June 2019 (IAL) QP - S1 Edexcel
24 pages
IGCSE Computer Science - 2210 - Chapter 1
No ratings yet
IGCSE Computer Science - 2210 - Chapter 1
27 pages
4mb1 02 Que 20240611
No ratings yet
4mb1 02 Que 20240611
32 pages
June 2017 QP - Paper 1F Edexcel Maths (A) IGCSE
0% (1)
June 2017 QP - Paper 1F Edexcel Maths (A) IGCSE
24 pages
Computer Science P1 Notes
No ratings yet
Computer Science P1 Notes
12 pages
Edexcel Jan 2020 M1 (QP + MS)
No ratings yet
Edexcel Jan 2020 M1 (QP + MS)
40 pages
s78972 International Gcse Esl 4es1 Sam 18 Paper 4
No ratings yet
s78972 International Gcse Esl 4es1 Sam 18 Paper 4
48 pages
4cp0- COMPUTER SCIENCE IGCSE EDXECEL PAPER 1 2024
No ratings yet
4cp0- COMPUTER SCIENCE IGCSE EDXECEL PAPER 1 2024
25 pages
4cp0 01 Que 20240524
No ratings yet
4cp0 01 Que 20240524
36 pages
Werpwokdfposkdpfoksdpf
No ratings yet
Werpwokdfposkdpfoksdpf
15 pages
COA Unit2 - G Maity
No ratings yet
COA Unit2 - G Maity
23 pages
2023 Cape CS Unit 1 P2 Clean
No ratings yet
2023 Cape CS Unit 1 P2 Clean
24 pages
Representation of Signed Numbers: 1. Sign-Magnitude (SM) Representation
No ratings yet
Representation of Signed Numbers: 1. Sign-Magnitude (SM) Representation
4 pages
Dac 707
No ratings yet
Dac 707
12 pages
Instant Ebooks Textbook (Ebook PDF) Digital Systems 12th Edition by Ronald Tocci Download All Chapters
100% (8)
Instant Ebooks Textbook (Ebook PDF) Digital Systems 12th Edition by Ronald Tocci Download All Chapters
51 pages
CENG240-2021 Week2 The World of PL and Data Representation
No ratings yet
CENG240-2021 Week2 The World of PL and Data Representation
72 pages
01 Computer Applications in Pharmacy Full Unit I
No ratings yet
01 Computer Applications in Pharmacy Full Unit I
12 pages
Introduction To Computer Systems and Software
No ratings yet
Introduction To Computer Systems and Software
35 pages
Computer Number Systems
No ratings yet
Computer Number Systems
14 pages
13.3 Real Numbers & Normalized Floating-Point
No ratings yet
13.3 Real Numbers & Normalized Floating-Point
17 pages
Digital Electronics Question Topic 1
No ratings yet
Digital Electronics Question Topic 1
26 pages
Tutorial 09 DSP IO Transceivers
No ratings yet
Tutorial 09 DSP IO Transceivers
161 pages
Final Digital Logic Design PPT
No ratings yet
Final Digital Logic Design PPT
140 pages
Lecture 3 - Bits, Bytes, and Integers
No ratings yet
Lecture 3 - Bits, Bytes, and Integers
78 pages
Unit-1_Slides_COA_updated
No ratings yet
Unit-1_Slides_COA_updated
66 pages
CP Lab Manual
No ratings yet
CP Lab Manual
190 pages
Coa Digital Tutorial Ques Ans
No ratings yet
Coa Digital Tutorial Ques Ans
129 pages
Architecture of IBM System - 360
100% (1)
Architecture of IBM System - 360
15 pages
Notes Final Mid HW Studio Quizes 4 1
100% (1)
Notes Final Mid HW Studio Quizes 4 1
83 pages
Numerical Methods For Physicists: Volker Hohmann Institute of Physics University of Oldenburg, Germany
No ratings yet
Numerical Methods For Physicists: Volker Hohmann Institute of Physics University of Oldenburg, Germany
90 pages
Unit-3 PPT Co
No ratings yet
Unit-3 PPT Co
24 pages
Arinc 429 PDF
No ratings yet
Arinc 429 PDF
32 pages
Digital Q Bank
No ratings yet
Digital Q Bank
17 pages
Finite Word Length Effects in DSP: Prepared BY Guided BY
No ratings yet
Finite Word Length Effects in DSP: Prepared BY Guided BY
28 pages
CSC2305 FIRST LECTURE NOTE
No ratings yet
CSC2305 FIRST LECTURE NOTE
40 pages
Fundementals of IT Unit I Notes
No ratings yet
Fundementals of IT Unit I Notes
23 pages
Chapter 5 Harris Module2
100% (1)
Chapter 5 Harris Module2
137 pages
Programming The 6502
100% (1)
Programming The 6502
420 pages
Simple Serial Protocol 1 PDF
No ratings yet
Simple Serial Protocol 1 PDF
19 pages
Digital System Designs
No ratings yet
Digital System Designs
168 pages

iG Computer Science - Question paper 1 ( Jun 2024)

Uploaded by

iG Computer Science - Question paper 1 ( Jun 2024)

Uploaded by

Please check the examination details below before entering your candidate information

Candidate surname Other names

Centre Number Candidate Number

Pearson Edexcel International GCSE (9–1)

PAPER 1: Principles of Computer Science

You must have: Total Marks

(b) Give one security risk of connecting computers in a network.

(i) State the name of this network topology.

(ii) State one drawback of using this network topology.

(iii) A fault tolerant network delivers a reliable service.

D Data link layer

(e) Here is the address for a web page.

(ii) Give the name of the document being retrieved.

(Total for Question 1 = 10 marks)

(ii) One function of an operating system is to provide a user interface.

(ii) Describe how data is read from a magnetic hard drive.

(c) Computers perform the fetch‑decode‑execute cycle.

Stage Sequence number

The instruction is placed onto the data bus

The Arithmetic and Logic Unit (ALU) performs a calculation

The instruction is decoded by the control unit

(i) State the number of colours that can be represented in Image 1.

(ii) Image 2 is 1920 pixels wide by 1080 pixels high.

(iii) One pixel in Image 1 is represented by the unsigned binary integer

(ii) Give two benefits of using ASCII to encode characters.

(Total for Question 3 = 13 marks)

(c) Employees at the research facility use a biometric identifier to login to

(ii) Give one application of nanotechnology.

(e) Marie has a mobile phone.

(Total for Question 4 = 16 marks)

Characteristic Assembler Interpreter Compiler

Does not have to be present

(b) Luca is testing the computer game.

Issue Utility software

Her word processor cannot read all of

(Total for Question 5 = 15 marks)

Identify the type of iteration construct used in Figure 2.

Is number Is number Is number

(Total for Question 6 = 12 marks)

TOTAL FOR PAPER = 80 MARKS

INTEGER INTEGER REAL

REAL REAL REAL

Syntax Explanation of syntax Example

Computes the value of an

Assigns a value to an element SET ArrayClass[1] TO ‘Ann’

SET Array [RowIndex, Assigns a value to an element

Syntax Explanation of syntax Example

IF <expression> THEN IF Answer = 10 THEN

IF <expression> THEN IF Answer = ‘correct’ THEN

Syntax Explanation of syntax Example

WHILE <condition> DO Pre-conditioned loop. Executes WHILE Flag = 0 DO

Count controlled loop. The

FOR <id> FROM <expression>

Syntax Explanation of syntax Example

SEND ‘Have a good day.’ TO

RECEIVE Name FROM (STRING)

Syntax Explanation of syntax Example

Reads in a record from a <file>

Writes a record to a file.

Syntax Explanation of syntax Example

DIV Integer division

<> not equal to

> greater than

>= greater than or equal to

< less than

<= less than or equal to

Returns true if both conditions

You might also like

IF <expression> THEN IF Answer = 10 THEN

IF <expression> THEN IF Answer = ‘correct’ THEN

WHILE <condition> DO Pre-conditioned loop. Executes WHILE Flag = 0 DO