Computer Science Paper 1 SL Markscheme
Computer Science Paper 1 SL Markscheme
MARKSCHEME
November 2014
COMPUTER SCIENCE
Standard Level
Paper 1
9 pages
–2– N14/4/COMSC/SP1/ENG/TZ0/XX/M
General
A markscheme often has more specific points worthy of a mark than the total allows. This is intentional.
Do not award more than the maximum marks allowed for that part of a question.
When deciding upon alternative answers by candidates to those given in the markscheme, consider the
following points:
Each statement worth one point has a separate line and the end is signified by means of
a semi-colon (;).
An alternative answer or wording is indicated in the markscheme by a “/”; either wording can
be accepted.
If the candidate’s answer has the same meaning or can be clearly interpreted as being the
same as that in the markscheme then award the mark.
Mark positively. Give candidates credit for what they have achieved and for what they have
got correct, rather than penalizing them for what they have not achieved or what they have
got wrong.
Occasionally, a part of a question may require a calculation whose answer is required for
subsequent parts. If an error is made in the first part then it should be penalized. However, if
the incorrect answer is used correctly in subsequent parts then follow through marks should
be awarded. Indicate this with “FT”.
General guidance
Issue Guidance
Answering • In the case of an “identify” question read all answers and mark positively up to the
more than maximum marks. Disregard incorrect answers.
the quantity • In the case of a “describe” question, which asks for a certain number of facts
of responses eg “describe two kinds”, mark the first two correct answers. This could include two
prescribed descriptions, one description and one identification, or two identifications.
in the • In the case of an “explain” question, which asks for a specified number of
questions explanations eg “explain two reasons …”, mark the first two correct answers.
This could include two full explanations, one explanation, one partial explanation etc.
–4– N14/4/COMSC/SP1/ENG/TZ0/XX/M
2. (a) Part of a processor that performs arithmetic and logical operations; [1 mark]
(b) Part of processor which coordinates all activities in processor and all other parts
within a computer; [1 mark]
(b) A VPN;
Accept other possible answers. [1 mark]
(c) Award [2 marks] for benefits, [2 marks] for problems, up to [4 marks max].
Benefits
Savings in fuel cost and commuting time;
An opportunity to work at your own pace / more comfortable;
Increased productivity;
An opportunity to work in an undisturbed environment;
Chose their own work hours;
Convenience of not having to travel;
Problems
Employers can claim the employees are part time consultants or the like to avoid paying
benefits like insurance, medical plans, taxes;
The strain on families that result when a family member works at home;
At-home employees miss interaction with co-workers at the office;
At-home employees think they work too much, employers think they do not
work enough;
Employees cannot monitor employees;
Expense of setting up a VPN; [4 marks]
–5– N14/4/COMSC/SP1/ENG/TZ0/XX/M
A B X
true true false
false true true
true false true
false false false [4 marks]
K K>1 P output
3 true 1 3
2 true 2 2
1 false 2 2
Note: candidates are not expected to produce the whole trace table, only the outputs. [3 marks]
8. (a) A set of rules to coordinate data transmission (between a sender and a receiver); [1 mark]
9. (a) Award up to [5 marks max]. Award [1 mark] for each labelled flow chart symbol.
[5 marks]
Note: Accept answers that assume the user still has a copy of the “lost” data. [3 marks]
–7– N14/4/COMSC/SP1/ENG/TZ0/XX/M
Example:
Not appropriate, as beta testing involves other people, but the timescale may not
permit this;
However the involvement of other people provides increased objectivity;
Therefore alpha-testing is better; [3 marks]
(ii) First defining the problem and then designing algorithms/coding; [1 mark]
11. (a) (i) Program crashes / run time error / exception / out of bounds error [1 mark]
Example 1
SUM = 0
loop for I=0 to 5
SUM = SUM + NUMBERS[I]
end loop
output SUM/6
Example 2
SUM=0
K = 0
loop while K<=5
SUM = SUM + NUMBERS[K]
K = K +1
end loop
output SUM/6 [4 marks]
–9– N14/4/COMSC/SP1/ENG/TZ0/XX/M
(c) (i) Award [1 mark] for showing the largest and [1 mark] for showing smallest
number at correct position in the array.
Example 1
MAX=0
K=1
loop while K<=5
if NUMBERS[K] > NUMBERS[MAX]
MAX=K
end if
K=K+1
end loop
// MAX contains the value of maxPos()
Example 2
MAXPOS = 0
MAXVALUE = NUMBERS[MAXPOS]
loop for K = 1 to 5
if NUMBERS[K] > MAXVALUE
MAXVALUE = NUMBERS[K]
MAXPOS = K
endif
end loop
// MAXPOS contains the value of maxPos() [4 marks]