Professional Documents
Culture Documents
9691 w15 Ms Complete
9691 w15 Ms Complete
9691 w15 Ms Complete
9691 COMPUTING
9691/11 Paper 1 (Written Paper), maximum raw mark 75
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
Input devices
Output devices
Data compression
Baseband
A method of checking for the successful
transmission of a sequence of bits
Parallel
Packet switching
[6]
If more than two ticks then take away 1 mark for each incorrect tick.
motion
oxygen
acidity (pH)
pressure
humidity
[2]
– greater security than “public” line / less likely to be “tapped into” / hacked than a
public line
– faster data transmission
– doesn’t share data with other users
– lower level of latency (less time between initiating a request and receiving an
answer)
– always available
– no rental costs from public companies [2]
(ii) Serial
Full-duplex
5 (a) Bus
Benefits
– requires less cabling (than other two)
– cheapest (of the three) to set up
– easier to expand the network
– one node fails the rest still operate
Drawbacks
– if there is a fault in central cable, whole network goes down
– number of nodes/stations is limited
– doesn’t work well under heavy load
– less secure (than others)
– difficult to isolate a fault / troubleshoot
Star
Benefits
– each node/station has its own cable
– failure on one connection doesn’t affect others
– different communication methods possible for different branches
– easier to identify faults / troubleshoot
– easier to expand the network
– network is more secure
Drawbacks
– if the central hub fails, whole network goes down
– more expensive (than others) to set up
– number of nodes/stations that can be added depends on capacity of hub
Ring
Benefits
– traffic is uni-directional so has fast data transmission
– works better than bus under heavy loading
– possible to form very large networks
– no need for a central server
– less costly to set up than a star network
Drawbacks
– faulty connection / failed node can shut down whole network
– more difficult to expand the network
– less secure (than star)
– difficult to find faults/troubleshoot [6]
(b) Four from (need some correct description as well as just hardware name)
– hub
– forwards data/packets to all the devices connected to it
– bridge
– device/software used to connect two or more segments so they can communicate
– switch
– reads the IP/MAC address of all the devices connected to it; the switch reads the
destination address of the data/packet and sends the data to the destination device
only
– gateway
– a network point that acts as an entrance to another network (using a different
protocol)
– router
– operates at the network layer (layer 3) //
routing data between nodes //
if the router receives a packet which doesn’t have a known destination address, it
forwards the packet to the default gateway
– server
– there are many dedicated servers, such as a file server, which have different tasks
within the network environment
6 (a)
T
1 mark
1 mark
X
1 mark
V
1 mark
Accept other correct alternative diagrams
[4]
(b)
Input Output
Working space
T P V X
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
[4]
7 (a)
START
Distance ← 1
READ
SpeedCheck
Is SpeedCheck Yes
< MaxSpeed
[Distance]?
3
No 1 mark
Yes
1 5
1 mark No
No
6
Yes
1 mark
No
4
Yes
[3]
END
(b) Three from (need name + description which fits scenario) for 1 mark
– testing
– check to make sure the program works correctly / ensure there are no errors
– documentation
– creating a user manual for the control room staff / technical documentation for the
programmers/operations staff
– implementation / installation
– evaluation
– checking the new software system meets all of the requirements [3]
– corrective
– errors have been found in the software which need to be corrected / not found
during testing
– perfective
B: 85 [2]
(ii)
1 0 1 1 0 1 0 0
[1]
8 (a) (i) Navigation buttons // move to a different screen // move backwards and forwards [1]
(iii) Slider, which is labelled 0 and 20, arrow pointer indicates current value
Accept sensible alternatives [2]
9691 COMPUTING
9691/12 Paper 1 (Written Paper), maximum raw mark 75
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
Page 2 Mark Scheme Syllabus Paper
Cambridge International AS/A Level – October/November 2015 9691 12
– spreadsheet
– to produce graphs/charts to show her results
– to carry out calculations on her results
– database
– use of queries (to group and calculate totals, sub–totals, etc.)
– use of the ‘report’ facility
– NE store data
– presentation software
– to present her findings to teachers/other pupils using slides/sound/animation [6]
(iii) – usually less expensive; the development costs can be spread over many purchasers
of the software
– they are frequently more sophisticated since the money generated from large sales
(often global) allows more development work to be done
– there will usually be user groups who can give help and support
– the ability to export/import files into/from other packages is often easier since they
are more likely to be compatible
– the software is available immediately/readily; there is no need to wait while it is
being written and developed
– the software is usually relatively “bug free” since it has been highly developed using
feedback and targeted user groups. [2]
(ii) – these are designed and written to meet the user’s specific requirements;
consequently they will be more efficient and won’t contain unwanted features
– software developer can develop it so that it will not interfere with other software
being used by the exam board; this will avoid any software clashes
– it is often easier to use since the software can be written in conjunction with the end
users in mind (the users get exactly what they need)
– any modifications needed (e.g. due to changes in the business requirements) can
be done more easily and more quickly since the changes are probably specific to
the exam board
– usually better customer support since the users can be in direct contact with the
software designers/writers [2]
CLI:
– commands/instructions need to be typed in/entered
– user needs to remember the commands/use the correct syntax
– user needs to have some knowledge of how computers work
– user has more control over computer
– needs less system/memory resources
– user is in direct communication with the computer
– it is difficult to edit commands once they have been entered
– accesses the whole of the operating system
GUI:
– only need to click/select an icon to carry out function
– (standard) icons represent (intuitive) applications
– menus are used to select action/options
– use a windows, icons, menus and pointers environment (not just WIMP) [4]
Problem identification
Maintenance
(Feasibility Study)
Testing//implementation
//installation Analysis
(System
Design
Development)
[5]
4 (a)
[5]
(b) RAM
– stores the camera settings input by the user (focus, shutter speed, etc.)
ROM
– stores camera’s factory settings/start up routines when camera switched on
(d) (i) the size of the file is reduced (by removing unnecessary/redundant data) [1]
[4]
[5]
– the key parts of the digital image of the worker’s face …/biometric comparison
– are compared to image of worker stored in computer memory/on chip on card
– card details need to match/find database details
– worker keys in his PIN into the reader
– the keyed in number is compared …
… the PIN stored on the chip embedded in the card
– compares the card details with those stored on the computer
– compares card details with photo check details
– Decision – the worker must pass both checks [4]
serial transmission
– data is transmitted bit by bit along a single wire/channel [2]
rules base
– rules are applied to the facts
– allows inference engine/set of rules to draw conclusions/make decisions
inference engine
– applies the rules in the rules base to the facts/knowledge (if not already stated)
– acts as a kind of reasoning engine
– uses the facts/knowledge stored in the knowledge base [3]
1 mark X
1 mark
Single NOR gate 2 marks, also a single 3 input OR gate at end. [6]
inputs output
Working
A B C X
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1
[4]
(ii)
0 1 0 0 1 1 1 0
[1]
(iv) 31 [1]
8 (a)
zone 1 zone 2 zone 3 zone 4 zone 5
TN20
VK15
TX15 VK30
(b)
– flip direction of graphic
… face left for west/right for east
(c) (i) Updating the screen (display) in line with the changed data list values [1]
(ii) Train data is continually changing/Display must reflect reality of the train network/data list
is dynamic/or by example [1]
(d) Max. 2 marks for hardware and max 2 marks for software
– remote camera optical character recognition used from the captured image
– database
… stores/continually updates the data list data
– software calculating speed/position and comparing for that part of track [4]
9691 COMPUTING
9691/13 Paper 1 (Written Paper), maximum raw mark 75
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
Input devices
Output devices
Data compression
Baseband
A method of checking for the successful
transmission of a sequence of bits
Parallel
Packet switching
[6]
If more than two ticks then take away 1 mark for each incorrect tick.
motion
oxygen
acidity (pH)
pressure
humidity
[2]
– greater security than “public” line / less likely to be “tapped into” / hacked than a
public line
– faster data transmission
– doesn’t share data with other users
– lower level of latency (less time between initiating a request and receiving an
answer)
– always available
– no rental costs from public companies [2]
(ii) Serial
Full-duplex
5 (a) Bus
Benefits
– requires less cabling (than other two)
– cheapest (of the three) to set up
– easier to expand the network
– one node fails the rest still operate
Drawbacks
– if there is a fault in central cable, whole network goes down
– number of nodes/stations is limited
– doesn’t work well under heavy load
– less secure (than others)
– difficult to isolate a fault / troubleshoot
Star
Benefits
– each node/station has its own cable
– failure on one connection doesn’t affect others
– different communication methods possible for different branches
– easier to identify faults / troubleshoot
– easier to expand the network
– network is more secure
Drawbacks
– if the central hub fails, whole network goes down
– more expensive (than others) to set up
– number of nodes/stations that can be added depends on capacity of hub
Ring
Benefits
– traffic is uni-directional so has fast data transmission
– works better than bus under heavy loading
– possible to form very large networks
– no need for a central server
– less costly to set up than a star network
Drawbacks
– faulty connection / failed node can shut down whole network
– more difficult to expand the network
– less secure (than star)
– difficult to find faults/troubleshoot [6]
(b) Four from (need some correct description as well as just hardware name)
– hub
– forwards data/packets to all the devices connected to it
– bridge
– device/software used to connect two or more segments so they can communicate
– switch
– reads the IP/MAC address of all the devices connected to it; the switch reads the
destination address of the data/packet and sends the data to the destination device
only
– gateway
– a network point that acts as an entrance to another network (using a different
protocol)
– router
– operates at the network layer (layer 3) //
routing data between nodes //
if the router receives a packet which doesn’t have a known destination address, it
forwards the packet to the default gateway
– server
– there are many dedicated servers, such as a file server, which have different tasks
within the network environment
6 (a)
T
1 mark
1 mark
X
1 mark
V
1 mark
Accept other correct alternative diagrams
[4]
(b)
Input Output
Working space
T P V X
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
[4]
7 (a)
START
Distance ← 1
READ
SpeedCheck
Is SpeedCheck Yes
< MaxSpeed
[Distance]?
3
No 1 mark
Yes
1 5
1 mark No
No
6
Yes
1 mark
No
4
Yes
[3]
END
(b) Three from (need name + description which fits scenario) for 1 mark
– testing
– check to make sure the program works correctly / ensure there are no errors
– documentation
– creating a user manual for the control room staff / technical documentation for the
programmers/operations staff
– implementation / installation
– evaluation
– checking the new software system meets all of the requirements [3]
– corrective
– errors have been found in the software which need to be corrected / not found
during testing
– perfective
B: 85 [2]
(ii)
1 0 1 1 0 1 0 0
[1]
8 (a) (i) Navigation buttons // move to a different screen // move backwards and forwards [1]
(iii) Slider, which is labelled 0 and 20, arrow pointer indicates current value
Accept sensible alternatives [2]
9691 COMPUTING
9691/21 Paper 2 (Written Paper), maximum raw mark 75
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
1 (a)
Field
Example of size
Field Identifier Data type
input data (in marks
bytes)
10
course STRING (approx.) 1
CourseCode 015110217
code (not text/alphanumeric) (accept
a range)
30
STRING Programming (approx.)
title Title
(not text/alphanumeric) for Beginners (accept
a range)
1
tutor
(3-letter STRING 3/6
Tutor PGL
initials) (not text/alphanumeric)
session
duration in SessionHours REAL/FLOAT/SINGLE 2.5 4/8 1
hours
CURRENCY/FLOAT/DECIMAL
fee ($) CourseFee
SINGLE/REAL/DOUBLE 25.50 8 / 16 1
date
course StartDate DATE/REAL (STRING) 03/11/2015 8 (10)
starts
1
date
course EndDate DATE/REAL (STRING) 03/12/2015 8 (10)
ends
[max 5]
Example Pascal
TYPE CourseRecordType = RECORD
CourseCode: STRING[10];
Title: STRING[30];
Tutor: STRING[3];
Day: BYTE;
IsLabBased: Boolean;
SessionHours: REAL;
CourseFee: Currency;
StartDate: TDateTime;
EndDate: TDateTime;
END; [4]
(c) Note that some candidates may already have done this in part (b). In that case, give marks
according to part (b).
WITH DummyRecord DO
BEGIN
CourseCode :='';
Title := ''; [1]
Tutor := '';
Day := 0;
IsLabBased := FALSE;
SessionHours := 0; [1]
CourseFee := 0;
StartDate:= 01/01/2010
EndDate := 01/01/2010 [1]
END;
FOR i := 1 to 50 DO [1]
Course[i] := DummyRecord; [1]
Alternative:
VAR Course : ARRAY[1..50] OF CourseRecordType [2]
FOR i := 1 to 50 DO [1]
BEGIN
Course[i].CourseCode :='';
Course[i].Title := ''; [1]
Course[i].Tutor := '';
Course[i].Day := 0;
Course[i].IsLabBased := FALSE;
Course[i].SessionHours := 0; [1]
Course[i].Course Fee := 0;
Course[i].StartDate:= 0;
Course[i].EndDate := 0; [1]
END;
[1]
[max 6]
Do not penalise again for incorrect data type
Example pseudocode:
OPENFILE CourseData.DAT for READING // for INPUT
i ← 1
WHILE NOT EOF(CourseData.DAT)
READ record FROM FILE
Course[i] ← record
i ← i + 1
ENDWHILE
CLOSEFILE CourseData.DAT [max 6]
Example pseudocode:
PROCEDURE SortData(NumberOfCourses)
x ← 0
// NoSwaps ← FALSE (required for WHILE loop)
REPEAT // WHILE NoSwaps = FALSE
x ← x + 1
NoSwaps ← TRUE
FOR y ← 1 TO NumberOfCourses - x
IF Course[y].CourseFee > Course[y + 1].CourseFee
THEN
NoSwaps ← FALSE
TempRecord ← Course[y]
Course[y] ← Course[y + 1]
Course[y + 1] ← TempRecord
ENDIF
ENDFOR
UNTIL NoSwaps = TRUE // ENDWHILE
ENDPROCEDURE [max 6]
Example PASCAL
FUNCTION DenaryDigit(Letter : CHAR) : INTEGER;
BEGIN
CASE Letter OF
'K': DenaryDigit := 0;
'D': DenaryDigit := 1;
'L': DenaryDigit := 2;
'C': DenaryDigit := 3;
'F': DenaryDigit := 4;
'H': DenaryDigit := 5;
'B': DenaryDigit := 6;
'G': DenaryDigit := 7;
'E': DenaryDigit := 8;
'A': DenaryDigit := 9;
ELSE
DenaryDigit:= -1
END;
END; [max 5]
(ii)
'G' 7 normal
"LED" 0
20 1 L 2
100 2 E 8
110 3 D 1 110
[5]
(iii) 1 mark per line of pseudocode correctly written in the high-level language chosen.
1 mark for declarations:
Example Pascal:
BEGIN
Denary := 0; // [1]
WriteLn(Denary); // [1]
END; // [1]
[10]
(iii) Variable watch allows tester to see the current contents of a variable
// Used to see how variable contents change when stepping through program
Tester chooses variables to watch [2]
9691 COMPUTING
9691/22 Paper 2 (Written Paper), maximum raw mark 75
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
1 (a)
Example Marks
Field size
Field Identifier Data type of input
(in bytes)
data
30 approx.
STRING How to
Title Title
(not text) (accept a
solve it
range)
1
STRING 20 approx.
Author Author
(not text) G Polya (accept a
range)
International
Standard STRING / 97806911 13
ISBN 1
Book LONGINT 19663 minimum
Number
CURRENCY/FLOAT
Price($) BookPrice /SINGLE/REAL 12.50 8/16/32/64 1
/DOUBLE/DECIMAL
Rating INTEGER/BYTE
(Range 0 to 4
Rating /CHARACTER 4/1 1
5) /STRING(1)
[max 5]
Example Pascal:
(c) – set up a dummy record // assign each field a dummy value // use a constructor
– …and store this in every element of the array // loop 100 times
Example pseudocode:
Example pseudocode:
TopRatingSoFar 0
i 0
REPEAT
i i + 1
IF TopRatingSoFar < Book[i].Rating
THEN
TopRatingSoFar Book[i].Rating
TopBookTitle Book[i].Title
ENDIF
UNTIL Book[i].Title = ""
OUTPUT TopBookTitle
Alternative answer:
TopRatingSoFar 0
FOR i TO 100
IF TopRatingSoFar < Book[i].Rating
THEN
TopRatingSoFar Book[i].Rating
TopBookTitle Book[i].Title
ENDIF
ENDFOR
OUTPUT TopBookTitle [max 6]
Example PASCAL:
(ii)
'V' 5 normal
'I' 1 normal
"MDCLI" 0
1650 4 'L' 50
(ii) 1 mark per line of pseudocode correctly written in the high-level language chosen:
RomanNumber "MDCLI"
Denary 0
FOR i 1 TO LENGTH(RomanNumber)
ThisLetter MID(RomanNumber, i, 1)
ThisNumber NumeralValue(ThisLetter)
Denary Denary + ThisNumber
ENDFOR
Example Pascal:
RomanNumber := 'MDCLI';
Denary := 0;
FOR i := 1 TO LENGTH(RomanNumber) DO
BEGIN
ThisLetter := MIDSTR(RomanNumber, i, 1);
ThisNumber := NumeralValue(ThisLetter);
Denary := Denary + ThisNumber;
END;
WriteLn(Denary); [8]
(e) (i)
"IV" 'I' 1 0
-1 2 'V' 5 -1
5 4
1 mark for each row above (accept rows spread over more than one row) [2]
(ii)
"XY" 'X' 10 0
2 'Y' -1 10
-1 9
Change required:
3 (a) Also give credit for answers to “why” rather than “how”
(iii) Variable watch allows tester to see the current contents of a variable
// Used to see how variable contents change when stepping through program
Tester chooses variables to watch [2]
9691 COMPUTING
9691/23 Paper 2 (Written Paper), maximum raw mark 75
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
1 (a)
Field
Example of size
Field Identifier Data type
input data (in marks
bytes)
10
course STRING (approx.) 1
CourseCode 015110217
code (not text/alphanumeric) (accept
a range)
30
STRING Programming (approx.)
title Title
(not text/alphanumeric) for Beginners (accept
a range)
1
tutor
(3-letter STRING 3/6
Tutor PGL
initials) (not text/alphanumeric)
session
duration in SessionHours REAL/FLOAT/SINGLE 2.5 4/8 1
hours
CURRENCY/FLOAT/DECIMAL
fee ($) CourseFee
SINGLE/REAL/DOUBLE 25.50 8 / 16 1
date
course StartDate DATE/REAL (STRING) 03/11/2015 8 (10)
starts
1
date
course EndDate DATE/REAL (STRING) 03/12/2015 8 (10)
ends
[max 5]
Example Pascal
TYPE CourseRecordType = RECORD
CourseCode: STRING[10];
Title: STRING[30];
Tutor: STRING[3];
Day: BYTE;
IsLabBased: Boolean;
SessionHours: REAL;
CourseFee: Currency;
StartDate: TDateTime;
EndDate: TDateTime;
END; [4]
(c) Note that some candidates may already have done this in part (b). In that case, give marks
according to part (b).
WITH DummyRecord DO
BEGIN
CourseCode :='';
Title := ''; [1]
Tutor := '';
Day := 0;
IsLabBased := FALSE;
SessionHours := 0; [1]
CourseFee := 0;
StartDate:= 01/01/2010
EndDate := 01/01/2010 [1]
END;
FOR i := 1 to 50 DO [1]
Course[i] := DummyRecord; [1]
Alternative:
VAR Course : ARRAY[1..50] OF CourseRecordType [2]
FOR i := 1 to 50 DO [1]
BEGIN
Course[i].CourseCode :='';
Course[i].Title := ''; [1]
Course[i].Tutor := '';
Course[i].Day := 0;
Course[i].IsLabBased := FALSE;
Course[i].SessionHours := 0; [1]
Course[i].Course Fee := 0;
Course[i].StartDate:= 0;
Course[i].EndDate := 0; [1]
END;
[1]
[max 6]
Do not penalise again for incorrect data type
Example pseudocode:
OPENFILE CourseData.DAT for READING // for INPUT
i ← 1
WHILE NOT EOF(CourseData.DAT)
READ record FROM FILE
Course[i] ← record
i ← i + 1
ENDWHILE
CLOSEFILE CourseData.DAT [max 6]
Example pseudocode:
PROCEDURE SortData(NumberOfCourses)
x ← 0
// NoSwaps ← FALSE (required for WHILE loop)
REPEAT // WHILE NoSwaps = FALSE
x ← x + 1
NoSwaps ← TRUE
FOR y ← 1 TO NumberOfCourses - x
IF Course[y].CourseFee > Course[y + 1].CourseFee
THEN
NoSwaps ← FALSE
TempRecord ← Course[y]
Course[y] ← Course[y + 1]
Course[y + 1] ← TempRecord
ENDIF
ENDFOR
UNTIL NoSwaps = TRUE // ENDWHILE
ENDPROCEDURE [max 6]
Example PASCAL
FUNCTION DenaryDigit(Letter : CHAR) : INTEGER;
BEGIN
CASE Letter OF
'K': DenaryDigit := 0;
'D': DenaryDigit := 1;
'L': DenaryDigit := 2;
'C': DenaryDigit := 3;
'F': DenaryDigit := 4;
'H': DenaryDigit := 5;
'B': DenaryDigit := 6;
'G': DenaryDigit := 7;
'E': DenaryDigit := 8;
'A': DenaryDigit := 9;
ELSE
DenaryDigit:= -1
END;
END; [max 5]
(ii)
'G' 7 normal
"LED" 0
20 1 L 2
100 2 E 8
110 3 D 1 110
[5]
(iii) 1 mark per line of pseudocode correctly written in the high-level language chosen.
1 mark for declarations:
Example Pascal:
BEGIN
Denary := 0; // [1]
WriteLn(Denary); // [1]
END; // [1]
[10]
(iii) Variable watch allows tester to see the current contents of a variable
// Used to see how variable contents change when stepping through program
Tester chooses variables to watch [2]
9691 COMPUTING
9691/31 Paper 3 (Written Paper), maximum raw mark 90
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
(ii)
[2]
(d)
Creates a new record in the ORDER table
2 (a) (i) Building a model of the system // Models the behaviour of the system 1
The model records over time the result of changing parameters/conditions/
circumstances // predicts outcomes for the real-world scenario 1 [2]
(ii) 16 [1]
PC ← [PC] + 1
The contents of the Program Counter are incremented [1]
MDR ←[[MAR]]
The contents of the address currently in the Memory Address Register are copied to
the Memory Data Register [1]
CIR ← [MDR]
The contents of the Memory Data Register are copied to the Current Instruction
Register [1]
(ii)
Fetch Special purpose registers
Buses
stage (Contents shown in hex)
Address
PC MAR MDR CIR Data bus
bus
58
MAR ← [PC]
58
59
PC ← [PC] + 1
867A
MDR ←[[MAR]]
CIR ← [MDR] 867A
[max 5]
4 (a)
Register
[1]
LIX 400 3
[1]
LDD 401 616
[1]
LDI 401 96
[1]
LDX 401 63
(b) Use the text editor to write the assembly language program
PROG.ASM 1
REPEAT
PROG.ASM is input to the assembler software 1
IF errors reported
THEN
Amend PROG.ASM using the text editor 1
ENDIF
UNTIL No errors reported
Produce the PROG.EXE executable file 1
Run PROG.EXE 1 [max 4]
5 (a) (i)
PLYMOUTH
MUMBAI SINGAPORE
Root correct 1
Left subtree correct 1
Right subtree correct 1 [3]
(ii) Labelling ….
Root [1]
Left subtree // FT for their tree [1]
(ii)
RootPtr 1
1 3 LIMA 2
2 4 PARIS 5
3 6 KARACHI 0
4 0 MELBOURNE 0
5 0 WARSAW 0
6 0 CAPE TOWN 7
7 0 EDINBURGH 0
[4]
(ii) 6 [1]
(v) 11 [1]
7 (a) More than one program loaded into memory at the same time [1]
(ii)
9691 COMPUTING
9691/32 Paper 3 (Written Paper), maximum raw mark 90
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
1 (a) MEMBER (MemberID, – any two sensible attributes e.g. name, DOB [1]
COURSE – CourseID, Instrument, StartDate, Duration,
CourseTutor [1]
(iv)
Creates a new record in the
FALSE
TUTOR-INSTRUMENT table [1]
Make a change to all the existing records for all tutors FALSE [1]
(ii) 5A [1]
(iii) 8 [1]
(b)
Register transfer
Description
notation
(c) (i) Sends control signals (A. commands) from/to the processor and various
devices // individual lines are each dedicated to a particular signal // uses
timing signals to coordinate various actions 1
Examples:
Timing signal // reset // memory write/read // I/O operation completed //
interrupt 1 [2]
Address bus 1
Carries the memory address about to be accessed // it connects the Memory
Address Register to main memory // Address bus is uni-directional from the
processor 1 [4]
3 (a)
Register
(b) Use the text editor to create the assembly language program PROG.ASM
REPEAT
Can be
PROG.ASM is input to the assembler software [1]
reverse for
1 mark IF errors reported [1]
THEN
Amend PROG.ASM using the text editor [1]
ENDIF
4 (a) (i)
[4]
(b)
RootPtr 0
0 1 MELON 2
1 3 BEETROOT
2 4 TURNIP
3 APPLE
4 PARSNIP 5
5 6 SWEDE
6 QUINCE
Mark as follows:
Root showing 0 1
Data values in correct positions 1
Correct left pointers 1
Correct right pointers 1 [4]
IF IsFound = FALSE
THEN
OUTPUT SearchFood, "Not Found"
ENDIF
(d) (i)
Mark as follows:
Left subtree 1
Right subtree 1 [2]
5 (a) (i) Building a model of the system/real-life situation // Models the behaviour of the
system 1
R. ‘imitates’
The simulation records the result of some changing parameters/conditions/
circumstances 1 [2]
(c) (i) BEWARE : NOT traffic lane changes (given in the rubric)
(ii) 3 [1]
(iv) 0 [1]
Mark as follows:
FUNCTION StringFound( ….. 1
ThisArray : ARRAY OF STRING 1
ThisValue : STRING 1
RETURNS BOOLEAN // : BOOLEAN 1 [4]
9691 COMPUTING
9691/33 Paper 3 (Written Paper), maximum raw mark 90
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 2015 series for most
Cambridge IGCSE®, Cambridge International A and AS Level components and some
Cambridge O Level components.
(ii)
[2]
(d)
Creates a new record in the ORDER table
2 (a) (i) Building a model of the system // Models the behaviour of the system 1
The model records over time the result of changing parameters/conditions/
circumstances // predicts outcomes for the real-world scenario 1 [2]
(ii) 16 [1]
PC ← [PC] + 1
The contents of the Program Counter are incremented [1]
MDR ←[[MAR]]
The contents of the address currently in the Memory Address Register are copied to
the Memory Data Register [1]
CIR ← [MDR]
The contents of the Memory Data Register are copied to the Current Instruction
Register [1]
(ii)
Fetch Special purpose registers
Buses
stage (Contents shown in hex)
Address
PC MAR MDR CIR Data bus
bus
58
MAR ← [PC]
58
59
PC ← [PC] + 1
867A
MDR ←[[MAR]]
CIR ← [MDR] 867A
[max 5]
4 (a)
Register
[1]
LIX 400 3
[1]
LDD 401 616
[1]
LDI 401 96
[1]
LDX 401 63
(b) Use the text editor to write the assembly language program
PROG.ASM 1
REPEAT
PROG.ASM is input to the assembler software 1
IF errors reported
THEN
Amend PROG.ASM using the text editor 1
ENDIF
UNTIL No errors reported
Produce the PROG.EXE executable file 1
Run PROG.EXE 1 [max 4]
5 (a) (i)
PLYMOUTH
MUMBAI SINGAPORE
Root correct 1
Left subtree correct 1
Right subtree correct 1 [3]
(ii) Labelling ….
Root [1]
Left subtree // FT for their tree [1]
(ii)
RootPtr 1
1 3 LIMA 2
2 4 PARIS 5
3 6 KARACHI 0
4 0 MELBOURNE 0
5 0 WARSAW 0
6 0 CAPE TOWN 7
7 0 EDINBURGH 0
[4]
(ii) 6 [1]
(v) 11 [1]
7 (a) More than one program loaded into memory at the same time [1]
(ii)