0420 Computer Studies: MARK SCHEME For The October/November 2014 Series
0420 Computer Studies: MARK SCHEME For The October/November 2014 Series
0420 Computer Studies: MARK SCHEME For The October/November 2014 Series
This mark scheme is published as an aid to teachers and candidates, to indicate the requirements of
the examination. It shows the basis on which Examiners were instructed to award marks. It does not
indicate the details of the discussions that took place at an Examiners’ meeting before marking began,
which would have considered the acceptability of alternative answers.
Mark schemes should be read in conjunction with the question paper and the Principal Examiner
Report for Teachers.
Cambridge will not enter into discussions about these mark schemes.
Cambridge is publishing the mark schemes for the October/November 2014 series for
most Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
non-volatile memory
3 (a) FALSE – encryption only stops data being read / making sense (but does not prevent
the act of hacking)
FALSE – data when backed up could still have the virus attached to it
– when the backed up data is re-loaded at a later date, the virus could be
loaded again into the system together with the stored data
TRUE – tapping into a Wi-Fi network is relatively easy (even when the network is
protected by passwords)
1 mark for each correct TRUE / FALSE with correct corresponding reason
[3]
(b) (i) drop down boxes help defeat spyware / key logging software [1]
(ii) – to ensure that it was in fact Felipe who logged on last time [1]
– an additional authentication check
– security purposes as these files are needed to access the Expert System
– licence agreement to only allow an authorised number of computers to access Expert
System
– the extra files need to be accessed for the Expert System to work
[2]
– chess games
– oil / mineral prospecting
– tax calculations
– weather forecasting
– identify plants / animals/chemical compounds
– careers guidance
– car engine tuning
[1]
num
n mbeer of
o poss
p sible b
binary
y inputt
c mbin
com nattionns for
f a22-inputt lo
ogic
c 0
g e ciircu
gate uit
o put fro
outp om the
e lo
ogicc ga
ate:
1 1
base 10 (de
b ( nary) vaalue
e off the
fo owing bin
ollo nary
y num
n mbeer:
4 2 1 4
1 1 0
wha
w at iss th
he out
o tputt fro
om
m the
a orith
algo hmm:
y=1
fo
or x = 1 tot 4 6
y=y*x
ne extt x
p nt y
prin
n mbe
num er of
o byte
b es form
f med frrom
m 8 bitts 20
0
x
e arre 2
Iff there by
yte
es in
n a Mbytte,
24
4
w at iss th
wha v ue of x?
he valu
m rk fforr ea
1 mar ach orrrec
h co ct line (m
max
x 5)
5
[5
5]
© Ca
amb
brid
dge
e In
nterrnattion
nal Ex
xam
mina
atio
ons
s 20
014
4
Page 5 Mark Scheme Syllabus Paper
Cambridge IGCSE – October/November 2014 0420 13
6 1 mark for each error located with corresponding correction (description or corrected pseudocode
acceptable)
error: lines 50 and 60: value of count causes a problem e.g. loop never ending
correction: either count = 19 on line 50
or count = count + 1 between lines 30 and 40
or any other correct solution
(e) blogs
[1]
8 (a)
duul a f x na c c x e oy uov .
< - - - - - - - - - - - - - - 1 mark - - - - - - - - - - - - - -> <- - - - - - - - - - 1 mark - - - - - - - - ->
[2]
(b)
c o m p u t i n g i s f u n .
<- - - - - - - - - - - - - 1 mark - - - - - - - - - - - - -> <- - - - - - - - - 1 mark - - - - - - - - ->
[2]
9 (a) 1 mark for input device + 1 mark for its matching use
input device: magnetic stripe reader / chip and PIN reader / card reader
use: reading credit / debit card details
(b) 1 mark for each different output device + 1 mark for its matching use
– pressure sensor
– example of sensor to detect if door closed / open e.g. magnetic field sensor, proximity
sensor
– moisture / humidity sensor
– temperature / infrared sensor
[2]
11
START
day = 1
11 (1 mark)
reading = 1
5
(1 mark)
Yes
7 4
No
10/12
(1 mark)
12/10
Yes
6
1
No (1 mark)
(1 mark)
2 STOP
No
Yes
is days 9
<= 365 ? (1 mark)
[6]
1
1 mark 1 mark
OR
1 mark 1 mark
13 (a)
T1 T2 T3 A B C OUTPUT
0 0 0
3 2 1
1 4 8 7
2 6 0 3
1 5 6 9
2 4 11 3
0 0 0
2, 2, 1
If no marks are awarded for the columns then 1 mark can be given for correct initialisation of
T1, T2 & T3 as shown in the first row above.
[5]
(b) – any data set (except 0, 0, 0) where 2/3 of the numbers are the same e.g. 2, 8, 8
– flowchart does not allow for numbers which have the same value
[2]
Reg 2: 1 0 0 1 0 0 1
Reg 3: 1 0 0 1 0 1 0
Reg 4: 1 0 0 1 1 0 0
Reg 5: 0 1 1 0 0 0 0
(b) 8
Reg 1: 0
Reg 2: 0
Reg 3: 1
Reg 4: 1
Reg 5: 0
15
5 (a)
(
A B C X
0 0 0 0
1m
mark
0 0 1 0
0 1 0 0
mark
1m
0 1 1 1 [4
4]
1 0 0 0
mark
1m
1 0 1 0
1 1 0 0
mark
1m
1 1 1 1
[4
4]
( ) 1m
(b) marrk for
f corre ect NO
ORR ga
ate
e an
nd 1 ma
ark for corr
c recct N
NAN
ND
D gate
e in
n co
orrrect positio
ons
s on
n le
eft
h nd sid
han s de of
o dia
d agra
amm.
X
B
[2
2]
(
(c) [ A = NO
NOT 1 OR
R B = NOT
N T1] 1 mar
m rk
A D
AN 1 mar
m rk
[ B = 1 AN
AND C = NO
OT 1 ] 1 mar
m rk
O her no
Oth otations wh
hic
ch are
a e accce
epttab
ble:
(NOOT A ORR NO
N T B)
B AN
AND (B
B AND
D NOT
N TCC)
_ _ _
A + B)
(A B . (B
B . C)
C
(A
A' + B')
B . (B . C')
[3
3]
© Ca
amb
brid
dge
e In
nterrnattion
nal Ex
xam
mina
atio
ons
s 20
014
4
Page 13 Mark Scheme Syllabus Paper
Cambridge IGCSE – October/November 2014 0420 13
16 Marking points:
largest = 0
smarket1 = 0: smarket2 = 0 1 mark
for item = 1 to 1000 1 mark
input price1, price2
if price1 > price2 then smarket1 = smarket1 + 1 1 mark
if price2 > price1 then smarket2 = smarket2 + 1 1 mark
difference = price1 – price2 1 mark
if difference < 0 then difference = - difference 1 mark
if difference > largest then largest = difference 1 mark
next item
output smarket1, smarket2, largest 1 mark
(max 6)
[6]