S… Saved Download free for 30 days

81% (31) · 63K views · 132 pages

Answers Key IGCSE Computer Science 2nd Edition Hodder
CourseBook by David Watson

This document provides answers to exam-style questions and activities from the Cambridge IGCSE and O
Level Computer Science Student's Book. It includes answers related to data representation… Full description

Uploaded by alfaazmcs on Feb 10, 2024

AI-enhanced description

Save 81% 19% Embed Share Print Report

Download now 7 / 132 Find in document

Download as pdf or txt

Cambridge IGCSE™ and O Level Computer Science

Answers to Student’s Book

Exam-style questions and sample answers have been written by the authors. References to
assessment and/or assessment preparation are the publisher’s interpretation of the syllabus
requirements and may not fully reflect the approach of Cambridge Assessment International
Education. Cambridge International recommends that teachers consider using a range of teaching
and learning resources in preparing learners for assessment, based on their own professional
judgement of their students’ needs.
Cambridge Assessment International Education bears no responsibility for the example answers to
questions taken from its past question papers which are contained in this publication.
The questions, example answers, marks awarded and/or comments that appear in this digital
material were written by the author(s). In examination, the way marks would be awarded to
answers like these may be different.

1 Data representation
Answers to activities
1.1
a 51
b 127
c 153
d 116
e 255
f 15
g 143
h 179
i 112
j 238
k 487
l 1364
m 3855
n 1992
o 2047
p 31984
q 16141
r 49983
s 34952
t 32767

Cambridge IGCSE and O Level Computer Science Teacher's Guide 1

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

1.2
a 00101001
b 01000011
c 01010110
d 01100100
e 01101111
f 01111111
g 10010000
h 10111101
i 11001000
j 11111111
k 1000000011101000
l 0000001101111000
m 0000111111111111
n 0100000000010000
o 1111001101100011
1.3
a C3
b F7
c 27F
d 4EE
e 1E1
f 89E
g (0)4FE
h (0)E9C
i FF7D
j 67AE
1.4
a 0110 1100
b 0101 1001
c 1010 1010
d 1010 0000 0000
e 0100 0000 1110
f 1011 1010 0110
g 1001 1100 1100
h 0100 0000 1010 1010
i 1101 1010 0100 0111
j 0001 1010 1011 0000

Cambridge IGCSE and O Level Computer Science Teacher's Guide 2

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

1.5
a 107
b 156
c 74
d 255
e 511
f 2561
g 2996
h 3240
i 4782
j 44425
1.6
a 62
b E3
c 1EA
d 1FF
e 33A
f 3E8
g A4A
h E9F
i FA7
j 1388
1.7
1 Student investigation
2 a 35, 37, 8B
b C9, 7A, CC
c C, 6F, 51
1.8
a 10000011
b 01100110
c 01111011
d 10110110
e 01101111
f 10110111
g 01111110
h 01110000
i 11111110
j 11011101

Cambridge IGCSE and O Level Computer Science Teacher's Guide 3

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

1.9
a 98 = 01100010 and 15 = 00001111; sum = 01110001 (= 113)
b 29 = 00011101 and 88 = 01011000; sum = 01110101 (= 117)
c 49 = 00110001 and 100 = 01100100; sum = 10010101 (= 149)
d 51 = 00110011 and 171 = 10101011; sum = 11011110 (= 222)
e 82 = 01010010 and 69 = 01000101; sum = 10010111 (= 151)
f 100 = 01100100 and 140 = 10001100; sum = 11110000 (= 240)
g 19 = 00010011 and 139 = 10001011; sum = 10011110 (= 158)
h 203 = 11001011 and 30 = 00011110; sum = 11101001 (= 233)
i 66 = 01000010 and 166 = 10100110; sum = 11101000 (= 232)
j 211 = 11010011 and 35 = 00100011; sum = 11110110 (= 246)
1.10
1 a 89 = 01011001 and 175 = 10101111; sum = 1 00001000 (= 8)
overflow error has occurred (9 bits)
b 168 = 10101000 and 99 = 01100011; sum = 1 00001011 (= 11)
overflow error has occurred (9 bits)
c 88 = 01011000 and 215 = 11010111; sum = 1 00101111 (= 47)
overflow error has occurred (9 bits)
2 a 1101 1111 0010 1010 – result is correct
b 1 1110 1011 1110 0100 – overflow error has occurred
1.11
1 a denary value = 64 + 32 + 8 = 104

0 0 0 0 1 1 0 1
b denary value is 13 (104 ÷ 8) therefore shift three places right is the same as division
by 23 (i.e. 8)
c denary value = 15

1 1 1 1 0 0 0 0
d denary value is 240 (15 × 16) therefore shift four places left is the same as multiplication
by 24 (i.e. 16)
2 a 29 = 00011101 and 51 = 00110011
b sum = 01010000
c 00001010
d 75 = 01001011
e 01010101
f 10101010

Cambridge IGCSE and O Level Computer Science Teacher's Guide 4

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

1.12
1 a 00100111
b 01000010
c 01011000
d 01100110
e 01101111
f 01111101
g 01001101
h 00010100
i 00110001
j 00111000
2 a 85
b 51
c 76
d 126
e 15
f 125
g 65
h 30
i 113
j 120
1.13
a 11101110
b 11100001
c 11010001
d 11000001
e 10101000
f 10100100
g 10011100
h 11111111
i 11110000
j 10000001

Cambridge IGCSE and O Level Computer Science Teacher's Guide 5

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

1.14
a −51
b −66
c −17
d −121
e −96
f −7
g −81
h −1
i −127
j −10
1.15
1 i The number of possible colours of a group of pixels (usually three or four) based on
the bit depth.
ii The coding system for all the characters on a standard keyboard and control codes;
extended ASCII, gives another 128 codes to allow for characters in non-English alphabets
and for some graphical characters to be included.
iii The coding system which represents all the languages of the world (the first 128 characters
are the same as ASCII code).
iv The number of sound samples taken per second.
v Images which are made up of pixels.
2 i, ii, iii each colour is 28 = 256
iv 256 × 256 × 256 = 16 777 216 possible colours
3 They both increase the size of the sound file.
1.16
1 1920 × 1536 = 2 949 120 pixels
colour depth = 16  16 × 2 949 120 = 47 185 920 bits
bits (÷ 8)  5 898 240 bytes
(÷ (1024 × 1024))  5.625 MiB
2 1024 × 1536 = 1 572 864 pixels
colour depth = 24  24 × 1 572 864 = 37 748 736 bits
bits (÷ 8)  4 718 592 bytes
16 GiB = 17 179 869 bytes
 number of photos = (17 179 869)/(4 718 592) = 3640 photos
3 a sample size = 44 100 × 8 × 2 (two tracks) = 705 600 bits
b file size = 44 100 × 8 × 30 × 2 (two tracks) = 21 168 000 bits
bytes (÷ 8)  2 646 000 bytes = 2.5 MiB

Cambridge IGCSE and O Level Computer Science Teacher's Guide 6

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Unlock this document Answers to Student’s Book

Upload to download
Upload a document to download this
document or subscribe to read and
4 sample size = 44 100 × 16 × 210 × 2 (two songs) = 296 352 000 bits Start your 30 day free trial
download. bytes ( 8)  37 044 000 bytes  35.33 MiB
÷

 OR 20 full songs

740 MiB CD can store 740/35.33 = 20.94

Answers to exam-style questions

Unlock this page after an ad 8
Answers to questions 6 and 7 in this section are example answers for past paper questions. The details of
the relevant past paper can be found with the corresponding exam-style question in the Student’s Book.

1 a i The number of bits used to represent sound amplitude.

ii Better sound quality
Less sound distortion Answers to Student’s Book
b i The number of pixels that make up an image; for example, an image could contain
÷
4096 × 3192 pixels (i.e. 12 738 656 pixels in total).
4 bits
ii 16 colours 
4
sample size = 44 100 × 16 × 210 × 2 (two songs) = 296 352 000 bits
 iii 16 384 × 512 = 8 388 608 pixels 
bytes ( 8) 37 044 000 bytes 35.33 MiB
Complimentary
Colour depth = 256 (8 bits perLounge
pixel) Access
740 MiB CD can store 740/35.33 = 20.94 20 full songs
 8 388 608More
× 8points, more
= 67 108 security
864 bits more convenience. with…
ICICI Bank Coral Credit Card. Apply now!
 (67 108 864/(1024
SPONSORED × 1024 × 1024))
BY are
ICICI =answers
BANK 0.0625 GiB
APPLY
pastNOW
Answers
Answers toto exam-style questions
questions 6 and 7 in this section example for paper questions.
The details of
the relevant
iv The developer may wish to use lossy compression and use the JPEG format toBook.
past paper can be found with the corresponding exam-style question in the Student’s save
1 a i space on their camera and/or computer.
The number of bits used to represent sound amplitude.
2 a The ii editor decides how many bits to represent the sound amplitude. Increasing the number
Better sound quality
of bits to represent sound amplitude increases accuracy; this is sampling resolution.
The Less
editorsound distortion
also decides how many samples per second should be taken; this is the sampling
b i
rate The
– thenumber
higher of
thepixels
numberthatofmake
soundupsamples
an image;
perfor example,
second, an image
the better could contain
the quality of the
sound4096 × 3192 pixels (i.e. 12 738 656 pixels in total).
recording.
ii
b The 4editor
bits 16 colours
will use lossy format, for example, MP3 format, which uses perceptual music
iii
shaping, which removes sounds the ear cannot hear properly, therefore the sound quality is
16 384 × 512 = 8 388 608 pixels

essentially retained.
Colour depth = 256 (8 bits per pixel)

Lossless files would be larger than lossy files for little improvement in sound quality.
8 388 608 × 8 = 67 108 864 bits
c i RLE is a form of lossless compression. It reduces the size of a string of adjacent,
(67 108 864/(1024 × 1024 × 1024)) = 0.0625 GiB
iv identical data, for example, repeated colours of an image. The repeating string is
The developer may wish to use lossy compression and use the JPEG format to save
encoded into two values; one value represents the number of identical items and the
space on their camera and/or computer.
second value represents the code of the data item (ASCII code).
2 a
The editor decides how many bits to represent the sound amplitude. Increasing the number
ii 3G 2W 4G 9W 4G 2W 1G 2W 2G 2W 1G (W = 1 and G = 0)
of bits to represent sound amplitude increases accuracy; this is sampling resolution.
 30 21 40 91 40 21 10 21 20 21 10
The editor also decides how many samples per second should be taken; this is the sampling
8 × 4 grid = 32 bytes
rate – the higher the number of sound samples per second, the better the quality of the
RLE
sound code = 11 × 2 = 22 bytes
recording.
b
The  RLEwill
editor saves
use10 bytes
lossy of memory/storage
format, for example, MP3 format, which uses perceptual music
shaping, which removes sounds the ear cannot hear properly, therefore the sound quality is
essentially retained.
Lossless files would be larger than lossy files for little improvement in sound quality.
c i
RLE is a form of lossless compression. It reduces the size of a string of adjacent,
identical data, for example, repeated colours of an image. The repeating string is
encoded into two values; one value represents the number of identical items and the
second value represents the code of the data item (ASCII code).

ii IGCSE
Cambridge 3G 2W and O Level
4G 9W 4G 2WComputer
1G 2WScience
2G 2W Teacher's
1G (W = 1Guide
and G = 0) 7
© David Watson and Helen Williams 2021
30 21 40 91 40 21 10 21 20 21 10
8 × 4 grid = 32 bytes

RLE code = 11 × 2 = 22 bytes
RLE saves 10 bytes Ad Download to read ad-free
of memory/storage

Answers to Student’s Book

3 a32 + 16 + 4 + 2 = 54 (base 10)

Cambridge IGCSE and O Level Computer Science Teacher's Guide
0 0 0 and
b i Watson
David 1 1 0Helen
1 1 Williams 2021 7
©
ii 16 + 8 + 2 + 1 = 27 (base 10)
c i 11011000
ii 128 + 64 + 16 + 8 = 216 (base 10)
Therefore two places shift to the left = multiply by 4 (2 2)
4 a Parts i to iii
0 1 1 1 1 0 1 1
0 0 1 1 0 1 1 1
1 0 1 1 0 1 0 0
b i 123 + 55 = 0 1 1 1 1 0 1 1 + 0 0 1 1 0 1 1 1 = 1 0 1 1 0 0 1 0 (178)
ii 123 + 180 = 0 1 1 1 1 0 1 1 + 1 0 1 1 0 1 0 0 = 1 0 0 1 0 1 1 1 1 (47), which is
incorrect; overflow has occurred
c i 01110100
two’s complement gives: 1 0 0 0 1 1 0 0 ( −116)
ii −112 = 1 0 0 1 0 0 0 0
iii 1 0 1 1 1 0 0 1 = −128 + (32 + 16 + 8 +1) = −128 + 57 = −71
d i 01101000
ii 10011000
5 a A picture element is the smallest element used to make up an image; each pixel is
represented by a minimum of 8 bits and 3 pixels are needed to make up the RGB colours.
b The number of possible colours of a group of pixels (usually three or four) based on the
bit depth.
c 1140 × 1080 = 1 231 200 pixels
 1 231 200 × 24 = 29 548 800 bits
 (29 548 800)/8 = 3 693 600 bytes
Memory card is 32 × (1024 × 1024 × 1024) bytes
 number of photos = (32 × 1024 × 1024 × 1024)/(3 693 600) = 9302 photos
d Use file compression (e.g. JPEG) which reduces the size of the files/images being stored.
Therefore more files/images can be stored on a memory stick.

Cambridge IGCSE and O Level Computer Science Teacher's Guide 8

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

6 a • image converted from analogue to digital

• image turned into pixels
• each pixel is given a binary value
• pixels form a grid/pattern
• each pixel has associated colour
• pixels are stored in sequence
• meta data stored (dimensions, colour depth, etc.)
• for example, JPEG, raw, TIFF, PSD, PNG
b Lossy:
• lossy would reduce file size more than lossless
• unnecessary data removed from the file
• images can be of similar quality/won’t notice any difference
• no requirement for files to be the same as the original
• can send photos faster/faster to upload

7 a Hours 0 0 0 0 0 0 1 0

Minutes 0 0 0 1 1 1 1 1

Seconds 0 0 1 1 1 0 1 0

b 00000101=5
0 0 0 1 1 0 1 0 = 26
0 0 1 1 0 1 1 1 = 55
Time shown as:

8 a 64 GiB = 64 × 1024 × 1024 KiB

 (64 × 1024 × 1024)/10 = 6 710 886 photos
b i Use JPEG lossy file compression
ii • saves storage space
• faster to send photos by email
• quicker to download/upload photos
iii loss of quality
c i Each primary colour intensity needs to be stored as a byte to allow for sufficient
different colour variations.
ii 28 × 28 × 28 = 256 × 256 × 256 = 16 777 216

Cambridge IGCSE and O Level Computer Science Teacher's Guide 9

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

Cambridge IGCSE and O Level Computer Science Teacher's Guide 10

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Cambridge IGCSE™ and O Level Computer Science

Answers to Student’s Book

Exam-style questions and sample answers have been written by the authors. References to
assessment and/or assessment preparation are the publisher’s interpretation of the syllabus
requirements and may not fully reflect the approach of Cambridge Assessment International
Education. Cambridge International recommends that teachers consider using a range of teaching
and learning resources in preparing learners for assessment, based on their own professional
judgement of their students’ needs.
Cambridge Assessment International Education bears no responsibility for the example answers to
questions taken from its past question papers which are contained in this publication.
The questions, example answers, marks awarded and/or comments that appear in this digital
material were written by the author(s). In examination, the way marks would be awarded to
answers like these may be different.

2 Data transmission

Answers to activities
2.1
1 Parts i and ii
• picture and sound out of synchronisation
• packets arriving at different times
• pauses in the video
• time delay in assembling packets
• degraded video and sound
• caused by competing traffic on the communications link
• possible 'drop out'
• packets take different routes, so some may get lost
2 • web page divided into data packets
• each packet has an IP address of the destination
• routers check header against IP address values to determine next router to send data packet
• hop value checked to see if it is zero
• destination computer reassembles data packets to build up the web page
3 a This takes all the 1-values in the payload and adds them together to generate a hex number.
• this hex value is stored in the trailer
• receiving computer carries out the same calculation on received payload
• if values match, data packets has been received error-free
• if values do not match, data packet needs to be re-sent
b 29 1-bits  1D in hex. If recalculated value doesn’t equal 1D hex then it needs to be re-sent.
4 a • packets keep 'bouncing around' from router to router and never reach the destination
• use hop numbers; if hop number = 0 then the packet is deleted and is therefore lost

Cambridge IGCSE and O Level Computer Science Teacher's Guide 1

© David Watson and Helen Williams 2021

Ad Download to read ad-free

Answers to Student’s Book

b • apply a hop number …

• … each time a data packet reaches a router, the hop number is decreased by 1
• … once the hop number = 0, and the destination hasn’t been reached, then the data
packet is deleted
c • each packet takes a different route …
• … therefore if a packet is intercepted, hacker still won’t have the whole message
2.2
1 i data sent one bit at a time over a single channel in both directions, but not at the same time
ii several bits of data sent down multiple channels in both directions, at the same time
iii data sent one bit at a time over a single channel in one direction only
2 i serial, simplex data transmission
ii parallel, simplex data transmission
iii parallel, full-duplex data transmission
iv serial, full-duplex data transmission
v parallel, simplex data transmission
2.3

Statement True False

Packets have a header which contains the IP address of the sender and

the receiver

Packets don’t require any form of error checking 

USBs use a protocol that allows for error-free data transmission


between device and computer

Serial data transmission suffers from data skewing 

The longest cable length supported by USB is 5 metres or less 

Simplex data transmission occurs when data is transmitted one bit at


a time
Ad
Full-duplex data transmission involves sending 8 bits of data at a time 
___
USB uses serial data transfer 

Packet switching prevents loss of any data packets 