Computer Science A Level Sample Green Book
Computer Science A Level Sample Green Book
Legal Notice All rights reserved. No part of this book may be reproduced, stored in a
retrieval system, or transmitted in any form, or by any means, electronic, mechanical,
photocopying, recording or otherwise, without prior written permission from Melbee Books.
The publishers made every effort to trace copyright holders, but if they have inadvertently
RYHUORRNHGDQ\WKH\ZLOOEHSOHDVHGWRPDNHWKHQHFHVVDU\DPPHQGPHQWVDWWKHÀUVW
opportunity.
MB
QUESTION 1
a) Convert 27 into
i) Binary,
ii) BCD, [3]
b) Convert ABC16 to decimal. [2]
c) Convert to decimal
i) Binary 1 0 1 0 1 1 0 1 [2]
ii) Octal 2753 [2]
SOLUTIONS
a) i) Power 25 24 23 22 21 20
Equivalent to 32 16 8 4 2 1
Binary equivalent 0 1 1 0 1 1
2710 = 011011
ii) 2 7
MB
0010 0111
BCD = 0010 0111
b) Power 162 161 160
Equivalent to 256 16 1
A(10) B(11) C(12)
MORE THAN BOOKS
(256 x 10) + (16 x 11) + (1 x 12)
= 2560 + 176 +12
= 2748
BC16 = 274810
c) i) Power 27 26 25 24 23 22 21 20
Equivalent to 128 64 32 16 8 4 2 1
Binary equivalent 1 0 1 0 1 1 0 1
128+32+8+4+1 =17310
512 64 8 1
2 7 5 3
(512 x 2) + (64 x 7) + (8 x 5) + (1 x 3)
= 1024 + 448 + 40 + 3
= 1515
QUESTION 3
ii)
MB [2]
Given that the ASCII Code for the character 1 is 110001, show how the test string ‘1332’
would be held in a 4-byte word. [4]
SOLUTIONS
a) i) 0.100000000 111110
0.100000000 -2
ii)
0.001 = 0.125
2 A10 F15
MORE THAN BOOKS
+ D13 F15
3 8 E
1 1
b) i) 13 – 00001101
32 – 00100000
ii) 1332 – 110001 110011 110011 110010
QUESTION 4
ʺ rɮƼNjsǣǣǼÌs_sŘNjɴ˦˧ǣʲ
i) Binary number stored in 8 bit byte [2]
ii) A hexadecimal number [2]
iii) A number stored in binary coded decimal (BCD). [2]
Eʺ r
ɮƼĶÞŘÌŸɠǼÌsEÞŘNjɴɚĶȖsŸ¯˦˧OŘEsȖǣs_ǼŸɠNjÞǼs_ŸɠŘǼÌssLJȖÞɚĶsŘǼŸOǼĶɚĶȖsɠÞǼÌ
minimum amount of calculation. [2]
FOR ORDERS AND ENQUIRIES:
2
(Or any other info about this book)
QUESTION 7
ʺ r ɮƼNjsǣǣǼÌs¯ŸĶĶŸɠÞض_sOÞŎĶŘȖŎEsNjǣÞŘǼɠŸǣOŸŎƼĶÞŎsŘǼEÞŘNjɴȖǣÞض˧EÞǼǣʲ
i) 127
ii) -27 [2]
Eʺ rɮƼĶÞŘȖǣÞضǼÌsEŸɚssɮŎƼĶsʰÌŸɠÌsɮ_sOÞŎĶOŘEsȖǣs_ǣǣÌŸNjǼÌŘ_¯ŸNjsɮƼNjsǣǣÞض
bytes that consist of 8 bits. [3]
c) Convert 1 0 1111 00102 to:
i) Octal
ii) Hexadecimal [2]
SOLUTION
a) 2 127
2 63 1
2 31 1
2 15 1
2 7 1
2 3 1
2 1 1
2 0 1
12710 = 0111 1111
MB
-27 2 27
2 13 1
2 6 1
2 3 0
2 1 1
2 0 1
+ 27 MORE THAN BOOKS
0001 1011
ŷŘs˅ǣOŸŎƼĶsŎsŘǼ ˠˠˠ˟˟ˠ˟˟
+ 1
ǻɠŸ˅ǣOŸŎƼĶsŎsŘǼ 1110 0101
b) ✓ Divide the bits into nibbles
✓ Change each nibble into decimal equivalent
✓ E.g. 0111 1111
7F
✓ 0111 11112 = 7Fhex
c) i) 001 011 110 010
1 3 6 2
10111100102 = 13628
ii) 0010 1111 0010
2 F 2
1011110 0102 = 2F2hex
FOR ORDERS AND ENQUIRIES:
5
(Or any other info about this book)
d) ASCII
• American Standard Code for Information Interchange.
• ǻÌsǣɴǣǼsŎȖǣsǣ˦EÞǼǣǼŸNjsƼNjsǣsŘǼsOÌOÌNjOǼsNjŘ_ǼÌssÞ¶ÌǼÌEÞǼǣŎsŘǣŸ¯
checking the rest.
• ˠˡ˧_Þ¯¯sNjsŘǼOÌNjOǼsNjǣOŘEsNjsƼNjsǣsŘǼs_ÞŘǼÌsǣǼŘ_Nj_ǢNÝÝOÌNjOǼsNjǣsǼʳ
d) EBICDIC
• Extended Binary coded Decimal Interchange code.
• Uses 8 bits to encode each character
• ȕǣs_EɴŎÞŘ¯NjŎsOŸŎƼȖǼsNjǣ
QUESTION 14
ʺ D ÞǼƼǼǼsNjŘǣOŘEsÞŘǼsNjƼNjsǼs_ÞŘŘȖŎEsNjŸ¯_Þ¯¯sNjsŘǼɠɴǣʳOŸŎƼȖǼsNjɠŸNj_OŸŘǼÞŘǣǼÌs
EÞǼƼǼǼsNjŘ˟ˠ˟ˠˠ˟˟ˠʳɟÌǼÞǣÞǼǣ_sOÞŎĶɚĶȖsÞ¯ÞǼNjsƼNjsǣsŘǼǣ
Þʺ ƼȖNjsEÞŘNjɴÞŘǼs¶sNj
ii) a BCD
Eʺ EÞŘNjɴƼǼǼsNjŘÞŘˠ˥˚EÞǼɠŸNj_NjsƼNjsǣsŘǼ_Þ¯¯sNjsŘǼ¯ŸNjŎǣŸ¯ÞŘ¯ŸNjŎǼÞŸŘʰǣȖOÌǣƼȖNjs
binary or BCD, as above or two ASCII characters. Name three different forms of information,
excluding those given above.
SOLUTIONS
a) i) 128 64 32 16 8 4 2 1
0 1 0 1 1 0 0 1
64 + 16 + 8 + 1 = 89
MB
ii) 8 9
1000 1001
BCD = 1000 1001
b) - Pixel,
- sound,
-
-
instruction,
Boolean,
MORE THAN BOOKS
- Unicode character,
- EBCDIC characters,
- signed integer,
˚ ʪŸǼÞضƼŸÞŘǼˀNjsĶˀʩɮs_ƼŸÞŘǼ
QUESTION 15
Using 8 bits to represent an integer in two’s complement form.
ʺ Ǣ ÌŸɠÌŸɠǼÌs_sOÞŎĶŘȖŎEsNjǣ̛˥ˢŘ_˚˥ˤɠÞĶĶNjsƼNjsǣsŘǼs_ʳ ʻˡʼ
Eʺ ǢÌŸɠǼÌsNjsǣȖĶǼŸEǼÞŘs_ɠÌsŘ̛˥ˢÞǣ__s_ǼŸ̛˥ˤȖǣÞضǼÌÞǣNjsƼNjsǣsŘǼǼÞŸŘʳNŸŎŎsŘǼŸŘ
your answer. [4]
c) Distinguish the following arithmetic errors ŸɚsNjʪŸɠ and ȖŘ_sNjʪŸɠŘ_¶ÞɚsŘsɮŎƼĶsŸ¯
each. [4]
QUESTION 16
ʺ ȕ ǣÞضǼÌsEÞŘNjɴŘȖŎEsNjˠˠˠ˟˟ˠˠˠˠˠˠˠ˟ˠǣŘsɮŎƼĶsʰǣÌŸɠÌŸɠǼŸȖǣsǼÌsEÞŘNjɴ
MB
NjsƼNjsǣsŘǼǼÞŸŘŸ¯ŘȖŎEsNjǼŸɠŸNjĨŸȖǼÞǼǣɚĶȖsÞŘÌsɮ_sOÞŎĶɠÞǼÌŎÞŘÞŎȖŎŎŸȖŘǼŸ¯
calculation. [3]
Eʺ ʪŸǼÞض˚ƼŸÞŘǼŘȖŎEsNjǣɴǣǼsŎȖǣsǣ˧˚EÞǼŘȖŎEsNjǣʰˤEÞǼǣ¯ŸNjǼÌsŎŘǼÞǣǣŘ_ˢEÞǼǣ¯ŸNj
sɮƼŸŘsŘǼʳNŸŘɚsNjǼǼÌs¯ŸĶĶŸɠÞضEÞŘNjɴŘȖŎEsNjǼŸ_sŘNjɴ˟ˠˠ˟ˠ˟ˠ˟ [2]
Oʺ ȕǣÞضŘ˧˚EÞǼEɴǼs¯ŸNjǼÌsŎŘǼÞǣǣŘ_Ř˧˚EÞǼEɴǼs¯ŸNjǼÌssɮƼŸŘsŘǼʰǣÌŸɠ˛ˠˤ̍ǣˡ
EɴǼsʰŘŸNjŎĶÞǣs_ʰʪŸǼÞضƼŸÞŘǼŘȖŎEsNjʳ [4]
SOLUTIONS
MORE THAN BOOKS
a) 0011 1001 1111 1101
3 9 F D = 39FD16
b) 01101 010
0.1101 + 2
011.01 = 3.25
Oʺ ȕ
ǣÞضŘ˧˚EÞǼEɴǼs¯ŸNjǼÌsŎŘǼÞǣǣŘ_Ř˧˚EÞǼEɴǼs¯ŸNjǼÌssɮƼŸŘsŘǼʰǣÌŸɠ˛ˠˤ̍ǣ
ˡEɴǼsʰŘŸNjŎĶÞǣs_ʰʪŸǼÞضƼŸÞŘǼŘȖŎEsNjʳ
00001111.1
11110000.1 = 1.0000100 +4
= 10000100 0000100
QUESTION 1
a) State one difference between Random Access Memory (RAM) and Read Only Memory (ROM).
[1]
Eʺ ŘsŎEs__s_ƼNjŸOsǣǣŸNjOŸŘǼÞŘǣĶĶǼÌsǣŸ¯ǼɠNjsŘss_s_ǼŸOŸŘǼNjŸĶŘȖǼŸŎǼÞOɠǣÌÞض
machine
i) State why the software is stored in ROM. [1]
ÞÞʺ rɮƼĶÞŘɠÌɴǼÌsǣŸ¯ǼɠNjsÞǣǣǼŸNjs_ÞŘNJŷōÌǣǣŸŎsŸ¯ǼÌsOÌNjOǼsNjÞǣǼÞOǣŸ¯NJōʳ ʻˡʼ
Oʺ ǢǼǼsǼÌNjssǼɴƼsǣŸ¯_ǼǣǼŸNjs_ÞŘNJōʳ ʻˢʼ
SOLUTION
a) RAM ROM
- RAM is volatile - ROM is non-volatile
- Data can be edited/changes - Data cannot be edited
- Data can be deleted - Data cannot be deleted
˚ɟŸNjĨÞضNjs - Non-working area
Eʺ Þʺ ˚NJs_ÞĶɴɚÞĶEĶsɠÌsŘǣɠÞǼOÌŸŘOŸŎƼȖǼsNj
- No need to alter software MB
ii) - Needs to be random access or access to data would be slow
˚ǻŸĶĶŸɠȖƼ¶Nj_ÞضŸ¯ǣŸ¯ǼɠNjs
Oʺ ˚ŷƼsNjǼÞضǣɴǣǼsŎ
˚ƻNjǼǣŸ¯ƼƼĶÞOǼÞŸŘǣŸ¯ǼɠNjsÞŘȖǣs
˚ȕǣsNjʩĶsǣOȖNjNjsŘǼĶɴEsÞضsɮsOȖǼs_
˚ÝŘǣǼNjȖOǼÞŸŘɠÞǼÞضƼNjŸOsǣǣÞض
- Data awaiting to be written to storage media
MORE THAN BOOKS
˚ÝŎŎs_ÞǼsNjsǣȖĶǼǣŸ¯ƼNjŸOsǣǣÞضɠÞǼÞضŸȖǼƼȖǼʳ
QUESTION 2
ʺ ^ sǣONjÞEsɠÌǼÌƼƼsŘǣɠÌsŘƼNjŸOsǣǣŸNjɠÌÞOÌÞǣOȖNjNjsŘǼĶɴɠŸNjĨÞضŸŘĠŸENjsOsÞɚsǣŘ
ÞŘǼsNjNjȖƼǼ¯NjŸŎŘsɮǼsNjŘĶǣŸȖNjOsʳ ʻˢʼ
Eʺ ǻÌsNƻȕÞǣOŸŘŘsOǼs_ǼŸŎÞŘŎsŎŸNjɴEɴǼÌNjssǣsƼNjǼsEȖǣsǣʳrɮƼĶÞŘǼÌsǼsNjŎʲ
i) Control bus
ii) Data bus
iii) Address bus [6]
SOLUTIONS
ʺ ˚NȖNjNjsŘǼ¯sǼOÌ˚sɮsOȖǼsOɴOĶsÞǣOŸŎƼĶsǼs_
- PC contents are saved for later reference
˚NŸŘǼsŘǼǣŸ¯ĶOǼÞɚsȖǣsNjƼNjŸ¶NjŎNjs¶ÞǣǼsNjǣNjsǣɚs_¯ŸNjĶǼsNjNjs¯sNjsŘOs
˚ǢŸȖNjOsŸ¯ÞŘǼsNjNjȖƼǼÞǣÞ_sŘǼÞʩs_
˚ÝŘǼsNjNjȖƼǼǣŸ¯ĶŸɠsNjƼNjÞŸNjÞǼɴNjs_ÞǣEĶs_
QUESTION 3
ʺ ^NjɠǼÌsĶŸ¶ÞOOÞNjOȖÞǼOŸNjNjsǣƼŸŘ_ÞضǼŸ
X = 1 if (A is 1 and B is 1) OR (B is 1 or C is NOT 1)
Eʺ NŸŎsȖƼɠÞǼÌǼÌsǼNjȖǼÌǼEĶs¯ŸNjǼÌsĶŸ¶ÞOǣǼǼsŎsŘǼÞŘʹ
SOLUTIONS
a)
MB
QUESTION 4
ʺ ǢǼsǼÌs¯ȖŘOǼÞŸŘǣŸ¯ǼÌs¯ŸĶĶŸɠÞضOŸŎƼȖǼsNjOŸŎƼŸŘsŘǼǣ
i) Processor [2]
ii) Main memory [2]
iii) Secondary storage [2]
Eʺ ^sǣONjÞEsNjs¶ÞǣǼsNjÞŘOŸŎƼȖǼÞضOŸŘǼsɮǼʳ ʻˠʼ
QUESTION 5
a) Describe the Von Neumann architecture
[3]
Eʺ Þʺ rɮƼĶÞŘɠÌǼǼÌsOOȖŎȖĶǼŸNjÌŸĶ_ǣŘ_ÌŸɠǼÌsOŸŘǼsŘǼǣOÌضs_ȖNjÞضǼÌs¯sǼOÌ˚
execution cycle. [3]
ÞÞʺ rɮƼĶÞŘɠÌǼǼÌsƼNjŸ¶NjŎOŸȖŘǼsNjʹƻNʺÌŸĶ_ǣŘ_ÌŸɠǼÌsOŸŘǼsŘǼǣOÌضs_ȖNjÞض¯sǼOÌ˚
execute cycle. [3]
SOLUTIONS MB
a) Von Neumann architecture
˚ǢÞضĶsƼNjŸOsǣǣŸNj
- Single bus for data and instructions
- Single memory for both data and instructions
˚ǢsLJȖsŘǼÞĶˀǣsNjÞĶƼNjŸOsǣǣÞضŸ¯ÞŘǣǼNjȖOǼÞŸŘǣʳ
Eʺ Þʺ
MORE THAN BOOKS
˚OOȖŎȖĶǼŸNjÌŸĶ_ǣǼÌsNjsǣȖĶǼǣŸ¯ǼÌsOĶOȖĶǼÞŸŘǣEs¯ŸNjsEsÞضƼǣǣs_ǼŸŎsŎŸNjɴȖŘÞǼ
- Contents changes when next instruction is executed add data is added to the accumulator
changing the value which was already there.
˚rʳ¶ʳɠÌsŘsɮsOȖǼÞضƼNjŸ¶NjŎǼŸ__ǼɠŸŘȖŎEsNjǣ
ii) - The address of the next instruction
- Contents incremented after being read
˚NŸŘǼsŘǼǣOÌضsEɴĠȖŎƼÞŘǣǼNjȖOǼÞŸŘʳ
QUESTION 6
ʺ r ɮƼĶÞŘÌŸɠǼÌsɠÞ_ǼÌŸ¯ǼÌs_ǼEȖǣŘ_ǼÌsǣɴǣǼsŎOĶŸOĨǣƼss_¯¯sOǼƼsNj¯ŸNjŎŘOsŸ¯
OŸŎƼȖǼsNjʳ ʻˢʼ
b) Differentiate the Von Neumann and Harvard architecture [2]
Oʺ rɮƼĶÞŘǼÌNjssEȖǣsǣȖǣs_ÞŘǼÌsəŸŘŗsȖŎŘŘōŸ_sĶʳ
i) control
ii) Address
iii) Data [6]
ii)
MB
QUESTION 11
ʺ ɟ ÞǼÌǼÌsÞ_Ÿ¯_Þ¶NjŎʰsɮƼĶÞŘÌŸɠƼÞƼsĶÞŘÞضɠŸȖĶ_ÞŎƼNjŸɚsǼÌsƼNjŸOsǣǣÞضǣƼss_Ÿ¯
OŸŎƼȖǼsNjʳ ʻ˥ʼ
Eʺ ȕǣÞضsɮŎƼĶsǣʰsɮƼĶÞŘǼÌs_Þ¯¯sNjsŘOsEsǼɠssŘ_ÞNjsOǼŘ_ÞŘ_ÞNjsOǼ__NjsǣǣÞض ʻˣʼ
i) Direct
ii) Indirect
a)
˚ƻÞƼsĶÞŘÞضÞǣǼsOÌŘÞLJȖsɠÌsNjs¯sǼOÌ˚sɮsOȖǼs˚OɴOĶsÞǣŸɚsNjĶƼƼs_¯ŸNj_Þ¯¯sNjsŘǼÞŘǣǼNjȖOǼÞŸŘʳ
˚Ǽ ŎŸǣǼ ˢ _Þ¯¯sNjsŘǼ ÞŘǣǼNjȖOǼÞŸŘǣ Njs ƼNjŸOsǣǣs_ Ǽ ǼÌs ǣŎs ǼÞŎsʱ ɠÞǼÌ sOÌ ÞŘǣǼNjȖOǼÞŸŘ ÞŘ
different fetch execute stages at the same time.
˚ǻÌÞǣÞŎƼNjŸɚsǣǼÌsǣƼss_Ÿ¯ƼNjŸOsǣǣÞضǣÞŘOsǼÌsOŸŎƼȖǼsNj_ŸsǣŘŸǼɠÞǼ¯ŸNjŸŘsÞŘǣǼNjȖOǼÞŸŘǼŸ
undergo all the three stages before the next instruction is fetched.
b) i) Direct
˚ǻÌsŸƼsNjŘ_ƼNjǼÞǣǼÌsOǼȖĶ__Njsǣǣ¯NjŸŎɠÌÞOÌǼÌs_ǼɚĶȖsÞǣNjsǼNjÞsɚs_
- e.g. LDA 10
ÞÞʺ ˚ǻÌsŸƼsNjŘ_ÌŸĶ_ǣǼÌs__NjsǣǣŸ¯ǼsĶŸOǼÞŸŘǼÌǼÌŸĶ_ǣǼÌsɚĶȖsǼŸEsȖǣs_ʳ
- e.g. LDA (10)
QUESTION 12
MB
ʺ ^sʩŘsǼÌsǼsNjŎÞŘǼsNjNjȖƼǼʳ ʻˡʼ
Eʺ µÞɚsŘsɮŎƼĶsŸ¯Řʲ
Þʺ ÝŘǼsNjŘĶÞŘǼsNjNjȖƼǼʳ ʻˠʼ
ÞÞʺ sɮǼsNjŘĶÞŘǼsNjNjȖƼǼ ʻˠʼ
Oʺ rɮƼĶÞŘɠÌɴŎŸ_sNjŘOŸŎƼȖǼsNjǣNjsÞŘǼsNjNjȖƼǼEǣs_ʳ ʻˡʼ
MORE THAN BOOKS
_ʺ Þʺ ^sǣÞ¶ŘǼNjȖǼÌǼEĶs¯ŸNjǼɠŸÞŘƼȖǼŗŷNJ¶Ǽsʳ
ii) Design a NOR gate.
ʻˡʼ
[2]
SOLUTIONS
ʺ ŘÞŘǼsNjNjȖƼǼÞǣǣÞ¶ŘͶsŘsNjǼs_EɴƼsNjÞƼÌsNjĶŸNjǣŸ¯ǼɠNjsɠÌsŘÞǼNjsLJȖÞNjsǣǼÌsǼǼsŘǼÞŸŘŸ¯
ƼNjŸOsǣǣŸNjɠÌÞOÌŎɴOȖǣsǼÌsENjsĨÞŘǼÌssɮsOȖǼÞŸŘŸ¯ǼÌsOȖNjNjsŘǼNjŸȖǼÞŘsʳ
Eʺ Þʺ ǻÞŎsNjÞŘǼsNjNjȖƼǼǣɠÌÞOÌǣÞ¶ŘĶǣǼÌǼǼÞŎs˚ONjÞǼÞOĶOǼÞɚÞǼɴŘss_ǣǼǼsŘǼÞŸŘʳ
ÞÞʺ ōOÌÞŘsOÌsOĨÞŘǼsNjNjȖƼǼǣOȖǣs_EɴŎ͝ȖŘOǼÞŸŘÞضÌNj_ɠNjs
Oʺ ÝŘŸNj_sNjǼŸŸEǼÞŘƼNjŸOsǣǣŸNjǼÞŎs¯ŸNjÌÞ¶ÌsNjƼNjÞŸNjÞǼɴǼǣĨŘ_ǼŸɚŸÞ__ǼĶŸǣǣ
QUESTION 1
SOLUTIONS
a)
MB
QUESTION 2
ʺ N ŸŎƼNjsŘ_OŸŘǼNjǣǼŷǢÝŘ_ǻNƻˀÝƻŎŸ_sĶǣʳ ʻˣʼ
Eʺ ǢÌŸɠǼÌsNjsĶǼÞŸŘǣÌÞƼEsǼɠssŘŷǢÝŘ_ǻNƻˀÝƻƼNjŸǼŸOŸĶǣʳ ʻˣʼ
b)
MB
QUESTION 3
ʺ ɟÌǼÞǣŘÝƻ__Njsǣǣʷ ʻˡʼ
Eʺ rɮƼĶÞŘǼÌs¯ŸNjŎǼŸ¯ŘÝƻ__Njsǣǣʳ ʻˡʼ
Oʺ ɟÌǼÞǣǼÌs¯ŸĶĶŸɠÞضʲÝƻ__NjsǣǣÞŘ_sŘNjɴʲˠˠ˟˟˟˟˟˟ˠ˟ˠ˟ˠ˟˟˟˟˟˟˟˟˟˟˟ˠˠ˟˟ˠ˟ˠˠ ʻˣʼ
E.g
c) 11000000.10101000 .00000000.11001011
192.168.0.203
QUESTION 4
ʺ rɮƼĶÞŘǼÌsǼsNjŎ^ŸŎÞŘŗŎsǢɴǣǼsŎʹ^ŗǢʺʳ ʻˡʼ
Eʺ ^ÞǣǼÞضȖÞǣÌEsǼɠssŘƼNjÞɚǼsÝƻŘ_ƼȖEĶÞOÝƻʳ ʻˣʼ
SOLUTIONS
a) DNS is a distributed database of information that is used to translate domain names which are
easy for humans to remember and use into IP addresses.
QUESTION 5
MORE THAN BOOKS
ʺ NŸŎƼNjsŘ_OŸŘǼNjǣǼNJÝƻŘ_ŷǢƻ®ƼNjŸǼŸOŸĶǣʳ
ʻ˥ʼ
Eʺ ŗŎsŘ_sɮƼĶÞŘǼÌsǣsɚsŘĶɴsNjǣŸ¯ǼÌsŷǢÝŎŸ_sĶʳ ʻˠˣʼ
SOLUTIONS
a)
RIP OSPF
xdistance vector protocol xLink State protocol
xThe metric used in RIP is hop count xThe metric used in OSPF are bandwidth and delay
xuse distance vector algorithm to calculate the xuse SPF algorithm to calculate the best path
best path xTakes Path cost into consideration to exchange routing information
xTakes hop count into consideration to exchange between the routers.
routing information between the routers. xRouting is carried out in autonomous system, into areas, sub areas as
xNetworks are not divided in areas or tables well as backbone areas
xmax hop count is 15 xNo hop count
xIt serves well in small network xMostly used in large network.
xkeeps track of the closet router for each xkeeps track of a complete topological database of all connections in
destination the local network
QUESTION 1
ʺ µ ÞɚsŘɴʩɚsƼŸÞŘǼǣǼÌǼŘss_ǼŸEsOŸŘǣÞ_sNjs_ɠÌsŘǣɴǣǼsŎŘĶɴǣǼƼNjŸ_ȖOsǣ¯sǣÞEÞĶÞǼɴ
study, [5]
Eʺ ^sǣONjÞEsɠÌǼÞǣÞŘɚŸĶɚs_ÞŘǼÌsŘĶɴǣÞǣǣǼ¶sŸ¯ǼÌsǣɴǣǼsŎǣ_sɚsĶŸƼŎsŘǼĶÞ¯sOɴOĶsʳ ʻ˥ʼ
SOLUTIONS
ʺ ̜ÝǣǣŸĶȖǼÞŸŘǼsOÌŘÞOĶĶɴƼŸǣǣÞEĶs
̜ÝǣǣŸĶȖǼÞŸŘsOŸŘŸŎÞOǼŸƼNjŸ_ȖOs
̜ÝǣǼÌsǣŸĶȖǼÞŸŘsOŸŘŸŎÞOǼŸNjȖŘ
̜ɟÌǼɠÞĶĶEsǼÌsǣŸOÞĶÞŎƼĶÞOǼÞŸŘǣŸ¯OÌضs
̜ÝǣǼÌsǣĨÞĶĶĶsɚsĶÞŘǼÌsɚÞĶEĶsɠŸNjĨ¯ŸNjOsÌÞ¶ÌsŘŸȖ¶ÌˀǼNjÞŘÞضNjsLJȖÞNjsŎsŘǼǣ
̜ÝǣǼÌsǣŸĶȖǼÞŸŘĶs¶Ķ
̜ɟÌǼɠÞĶĶEsǼÌss¯¯sOǼǣŸŘǼÌsOȖǣǼŸŎsNj
̜ǻÞŎsOŸŘǣǼNjÞŘǣ
Eʺ ̜ÝŘ¯ŸNjŎǼÞŸŘOŸĶĶsOǼÞŸŘ
̜ŘĶɴǣÞǣŸ¯ÞŘ¯ŸNjŎǼÞŸŘOŸĶĶsOǼs_
̜NJsLJȖÞNjsŎsŘǼǣǣƼsOÞʩOǼÞŸŘʳÞʳsʳȖǣsNjʰǣŸ¯ǼɠNjsŘ_ÌNj_ɠNjsNjsLJȖÞNjsŎsŘǼǣ
̜®sǣÞEÞĶÞǼɴǣǼȖ_ɴʳ MB
QUESTION 2
ʺ r ɮƼĶÞŘǼÌs¯ŸȖNjEǣÞOǣƼsOǼǣŸ¯ǼÌs_sǣÞ¶ŘǣǼ¶sÞŘǣɴǣǼsŎŘĶɴǣÞǣ ʻˣʼ
b) Give three reasons why maintenance of a system is necessary. [3]
Oʺ ɳŸȖÌɚsEssŘÌÞNjs_EɴŘŸNj¶ŘÞǣǼÞŸŘǼŸ_sɚsĶŸƼōضsŎsŘǼÝŘ¯ŸNjŎǼÞŸŘǢɴǣǼsŎʰ
Þʺ ÝĶĶȖǣǼNjǼsǼÌsƼƼNjŸOÌɴŸȖɠŸȖĶ_ǼĨsǼŸsŘǣȖNjsǼÌǼɴŸȖ_sɚsĶŸƼǣɴǣǼsŎǼÌǼŎssǼǣǼÌs
OĶÞsŘǼ˅ǣǣƼsOÞʩOǼÞŸŘǣʳ
MORE THAN BOOKS
ÞÞʺ µÞɚsŘsɮƼĶŘǼÞŸŘ¯ŸNjsOÌŸ¯ǼÌs_sɚsĶŸƼŎsŘǼŸ¯ǼÌsOŸŎƼŸŘsŘǼǣÞŘǼÌsƼƼNjŸOÌǼŸǼÌs
_sɚsĶŸƼŎsŘǼŸ¯OʹÞʺōضsŎsŘǼÝŘ¯ŸNjŎǼÞŸŘǢɴǣǼsŎ ʻ˧ʼ
SOLUTIONS
ʺ ̜ÝŘƼȖǼ_sǣÞ¶Řʳ
̜ŷȖǼƼȖǼ_sǣÞ¶Řʳ
̜®ÞĶs_sǣÞ¶Řʳ
̜ƻNjŸ¶NjŎ_sǣÞ¶Řʳ
Eʺ ̜ǻŸ__Řsɠ¯sǼȖNjsǣǼÌǼŎɴEsǣssŘŘsOsǣǣNjɴǼŸÞŘOĶȖ_sÞŘǼÌsǣɴǣǼsŎʳ
̜ǻŸÞŎƼNjŸɚsǣɴǣǼsŎNjsǣƼŸŘǣsǼÞŎsʳ
̜ǻŸOŸNjNjsOǼǣŸŎssNjNjŸNjǣǼÌǼŎɴÌɚsEssŘsŘOŸȖŘǼsNjs_ǣŸǣǼŸsŘǣȖNjsǣŎŸŸǼÌNjȖŘŘÞض
of the system.
Oʺ Þʺ ̜ƻNjŸEĶsŎÞ_sŘǼÞʩOǼÞŸŘ
̜®OǼ®ÞŘ_Þض
̜®sǣÞEÞĶÞǼɴǣǼȖ_ɴ
̜ŘĶɴǣÞǣ
̜^sǣÞ¶Ř
FOR ORDERS AND ENQUIRIES:
(Or any other info about this book) 38
5 SECURITY AND ETHICS
QUESTION 1
ʺ r
ɮƼĶÞŘÌŸɠÞǼÞǣƼŸǣǣÞEĶsǼŸƼNjŸǼsOǼOŸŎƼȖǼsNj_Ǽ¯NjŸŎʲ
i) Physical damage
ii) Theft and misuse [3]
Eʺ ^ÞǣOȖǣǣǼÌsǼsOÌŘÞLJȖsǣǼÌǼOŘEsȖǣs_ǼŸƼNjsɚsŘǼȖŘȖǼÌŸNjÞǣs_OOsǣǣǼŸOŸŎƼȖǼsNjǣɴǣǼsŎǣʳ
[9]
SOLUTIONS
a) i) Physical damage
̜ ĵŸOĨȖƼǼÌsǣONjssŘNjŸŸŎ
̜ ȕǣsǢsOȖNjÞǼɴ¶ȖNj_ǣ
̜ ȕǣsEȖNj¶ĶNjENjǣŘ_ǣONjssŘ_ŸŸNjǣ
̜ ōŸǼÞŸŘŸNjǼÌsNjŎĶĶNjŎǣɴǣǼsŎǣ
̜ DÞŸŎsǼNjÞOǣ
̜ ƻÞOǼȖNjsÝ^ǣ
̜ NĶŸǣs_˚OÞNjOȖÞǼǣȖNjɚsÞĶĶŘOsOŎsNjǣ
ii) Theft and misuse
̜ ȕǣsǣǼNjŸŘ¶ƼǣǣɠŸNj_ǣ
MB
̜ rŘONjɴƼǼǣsŘǣÞǼÞɚs_Ǽ
̜ ƻNjŸƼsNjĶɴ_ÞǣƼŸǣsǣsŘǣÞǼÞɚs_Ǽ
̜ ōĨsǣȖNjsɴŸȖNjsŎƼĶŸɴssǣÌɚsǼÌsƼƼNjŸƼNjÞǼsǼNjÞŘÞض
Eʺ ̜ ĵ ŸOĨɴŸȖNjOŸŎƼȖǼsNjÞ¯ɴŸȖNjsǣǼsƼƼÞضɠɴ¯NjŸŎɴŸȖNj_sǣĨ
̜ ǢsǼǣǼNjŸŘ¶ƻǣǣɠŸNj_ǣ
̜ ǻɠŸ¯OǼŸNjȖǼÌsŘǼÞOǼÞŸŘʹˡ®ʺ
̜ MORE THAN BOOKS
ÝŘǣǼĶĶ ÞŘǼNjȖǣÞŸŘ _sǼsOǼÞض ǣŸ¯ǼɠNjs ˛ ǼÌÞǣ ŎŸŘÞǼŸNj ɴŸȖNj OŸŎƼȖǼsNj Ř_ ŘŸǼÞ¯ɴ ɴŸȖ Ÿ¯ Řɴ
ǼǼsŎƼǼǣǼÌǼNjsŸNjɠsNjsEsÞضŎ_sEɴŘÞŘǼNjȖ_sNj
̜ DÞŸŎsǼNjÞO _sɚÞOsǣ˚ ǼÌsǣs Njs _sɚÞOsǣ ǼÌǼ ȖǼÌsŘǼÞOǼs ȖǣsNjǣ Þ_sŘǼÞǼɴ Eɴ ȖǣÞض ƼsNjǣŸŘĶ
OÌNjOǼsNjÞǣǼÞOǣĶÞĨsʩضsNjƼNjÞŘǼǣ
̜ OOsǣǣNjÞ¶ÌǼǣ
̜ ®ÞNjsɠĶĶǣ˛ÞǣǣsOȖNjÞǼɴǼsOÌŘŸĶŸ¶ɴǼÌǼŎŸŘÞǼŸNjǣÞŘOŸŎÞضŘ_ŸȖǼ¶ŸÞضǼNj¯ʩOʳÝǼƼNjŸɚÞ_sǣ
ƼNjŸǼsOǼÞɚsENjNjÞsNjEsǼɠssŘǼÌsOŸŎƼȖǼsNjŘ_ŸǼÌsNjOŸŎƼȖǼsNjǣ
̜ ƻNjŸɮɴǣsNjɚsNjǣ˚ɠɴǼŸƼNjsɚsŘǼ_ÞNjsOǼOOsǣǣǼŸǼÌsǣsNjɚsNjʳÝǼÞǣŘÞŘǼsNjŎs_ÞNjɴǣsNjɚsNjʳ
QUESTION 2
ʺ ^ ÞǣOȖǣǣǼɠŸǣsOȖNjÞǼɴƼNjŸEĶsŎǣǼÌǼÌɚsNjÞǣsŘɠÞǼÌsĶsOǼNjŸŘÞOŎÞĶǣɴǣǼsŎŘ_ÞŘ_ÞOǼsɠÌǼ
ǣǼsƼǣOŘEsǼĨsŘǼŸŸɚsNjOŸŎsǼÌsŎʳ ʻˣʼ
Eʺ ^ÞǣOȖǣǣǼÌss¯¯sOǼǣŸ¯OŸŎƼȖǼsNjÞǣǼÞŸŘŸ¯EŘĨ¯NjŸŎǼÌsȖǣsNj˅ǣƼŸÞŘǼŸ¯ɚÞsɠʳ ʻˣʼ
SOLUTIONS
a) ✓ Phishing
QUESTION 9
ʺ r ɮƼĶÞŘŘɴŸŘs_Þ¯¯sNjsŘOsEsǼɠssŘÌOĨÞضŘ_ONjOĨÞضʳ ʻˠʼ
Eʺ ǢsOȖNjÞǼɴŸ¯_ǼÞǣŘÞŎƼŸNjǼŘǼOŸŘOsNjŘ¯ŸNjǣɴǣǼsŎ_ŎÞŘÞǣǼNjǼŸNjʳ^sǣONjÞEsŘɴŸŘs¯sǼȖNjs
MORE THAN BOOKS
Ÿ¯ƼNjÞɚOɴ¯ŸNjsŘǣȖNjÞض_ǼǣsOȖNjÞǼɴʰ
Oʺ ʹÞʺ ^sʩŘsǼÌsǼsNjŎǣŸOÞĶŎs_Þʳ
ʻˡʼ
ʻˠʼ
ʹÞÞʺ ŷȖǼĶÞŘsŘɴǼÌNjssEsŘsʩǼǣŘ_ŘɴǼÌNjssǣÞ_ss¯¯sOǼǣŸ¯ǣŸOÞĶŎs_ÞÞŘǣŸOÞsǼɴʳ ʻ˥ʼ
SOLUTIONS
ʺ Ë
OĨÞضÞǣǼsNjŎȖǣs_ǼŸ_sǣONjÞEsOǼÞŸŘǣǼĨsŘEɴǣŸŎsŸŘsǼŸ¶ÞŘȖŘȖǼÌŸNjÞʊs_OOsǣǣǼŸ
OŸŎƼȖǼsNjŘ_ONjOĨÞضÞǣENjsĨÞضƼǣǣɠŸNj_ǣȖǣs_ǼŸƼNjŸǼsOǼ_Ǽʳ
Eʺ ̜ȕǣsŸ¯ǣǼNjŸŘ¶ƼǣǣɠŸNj_
̜rŘONjɴƼǼÞŸŘŸ¯_Ǽ
̜ȕǣsŸ¯ĶsɚsĶŸ¯OOsǣǣ
̜ƻNjŸɮɴǣsNjɚsNjǣ˚ɠɴǼŸƼNjsɚsŘǼ_ÞNjsOǼOOsǣǣǼŸǼÌsǣsNjɚsNjʳÝǼÞǣŘÞŘǼsNjŎs_ÞNjɴǣsNjɚsNj
Oʺ Þʺ ǢŸOÞĶŎs_ÞÞǣOŸŎƼȖǼsNj˚Eǣs_ǼsOÌŘŸĶŸ¶ɴǼÌǼ¯OÞĶÞǼǼsǣǼÌsǣÌNjÞضŸ¯Þ_sǣʰ
thoughts, and information through the building of virtual networks and communities.
ii) DsŘsʩǼǣŸ¯ǣŸOÞĶŎs_Þ
̜rǣɴ OŸŎŎȖŘÞOǼÞŸŘ ɠÞǼÌ sOÌ ŸǼÌsNj ǣ ǼÌsNjs Þǣ ŘŸ Řss_ ǼŸ ǼNjɚsĶ ǼŸ ŎssǼ ƼsŸƼĶs
ƼÌɴǣÞOĶĶɴʳ
̜ǢŸOÞĶŎs_ÞÞǣŘsǣɴɠɴŸ¯ǣƼNjs_ÞضÞŘ¯ŸNjŎǼÞŸŘʳ
SOLUTIONS
a) i) Data Protection Act – to control the way information is handled and to give legal rights
ǼŸƼsŸƼĶsɠÌŸÌɚsÞŘ¯ŸNjŎǼÞŸŘǣǼŸNjs_EŸȖǼǼÌsŎʳ
ii) Computer Misuse act ˛ ǼÌs OǼ ŎĨsǣ ÞǼ ÞĶĶs¶Ķ ǼŸ OOsǣǣ OŸŎƼȖǼsNj ŎǼsNjÞĶ ɠÞǼÌŸȖǼ
MB
ƼsNjŎÞǣǣÞŸŘʰOŸƼɴǣŸ¯ǼɠNjsÌsĶ_ÞŘOŸŎƼȖǼsNjǣɴǣǼsŎʰsǼOʳ
Eʺ Þʺ ¶ÞŘȖŘȖǼÌŸNjÞǣs_OOsǣǣǼŸOŸŎƼȖǼsNjŎǼsNjÞĶ
ÞÞʺ ĶǼsNjOŸŎƼȖǼsNj_ǼɠÞǼÌŸȖǼƼsNjŎÞǣǣÞŸŘ
ÞÞÞʺ OŸƼɴǣŸ¯ǼɠNjsÌsĶ_ÞŘOŸŎƼȖǼsNjǣɴǣǼsŎ
Þɚʺ ŎŸ_Þ¯ɴOŸŎƼȖǼsNjŎǼsNjÞĶɠÞǼÌŸȖǼƼsNjŎÞǣǣÞŸŘ
v) circulate infected materials on-line
ɚÞʺ ŘŸǼǼŸȖǣsOŸŎƼȖǼsNj¯ŸNjÞǼǣÞŘǼsŘ_s_ȖǣsʰǣȖOÌǣƼĶɴÞض¶Ŏsǣ_ȖNjÞضɠŸNjĨÞŘ¶ÌŸȖNjǣ
QUESTION 1
ʺ rɮƼĶÞŘǼÌs¯ŸĶĶŸɠÞضǼsNjŎǣ¶ÞɚÞضsɮŎƼĶsǣʳ
i) Dynamic [2]
ii) Static [2]
Eʺ rɮƼĶÞŘǼÌsǣǼsƼǣɠÌÞOÌNjs¯ŸĶĶŸɠs_ɠÌsŘONjsǼÞضEÞŘNjɴǼNjssʳ ʻˣʼ
SOLUTIONS
a) i) Dynamic:ǻÌsŎsŎŸNjɴǣƼOsǼĨsŘEɴǼÌs_ǼǣǼNjȖOǼȖNjsɚNjÞsǣǼNjȖŘǼÞŎsʳrʳ¶ʳEÞŘNjɴ
tree
ii) Static:_ǼǣǼNjȖOǼȖNjsŸ¯ǣÞʊs_sOĶNjs_Es¯ŸNjsǼÌsƼNjŸ¶NjŎÞǣsɮsOȖǼs_ʳsʳ¶ʳNjNjɴ
Eʺ ̜ ƻĶOsǼÌsˠst item in the root node.
̜ ÝŘǣsNjǼǼÌsÞǼsŎǣÞŘŸNj_sNjÞŘɠÌÞOÌǼÌsɴNjs¶ÞɚsŘʳ
̜ ®ŸĶĶŸɠǼÌsĶs¯ǼƼŸÞŘǼsNjÞ¯ǼÌsÞǼsŎOŸŎsǣEs¯ŸNjsǼÌsOȖNjNjsŘǼŘŸ_sÞŘĶƼÌEsǼÞOʹŸNjŘȖŎsNjÞOʺ
sequence.
̜ ®ŸĶĶŸɠǼÌsNjÞ¶ÌǼƼŸÞŘǼsNjÞ¯ǼÌsÞǼsŎOŸŎsǣ¯ǼsNjǼÌsOȖNjNjsŘǼŘŸ_sʳ
QUESTION 2
a) MB
i) Distinguish between static and dynamic data structure. [2]
ÞÞʺ ŷȖǼĶÞŘsŸŘsEsŘsʩǼǼÌǼɠŸȖĶ_Es¶ÞŘs_¯NjŸŎȖǣÞض_ɴŘŎÞO_ǼǣǼNjȖOǼȖNjsǼŸÞŎƼĶsŎsŘǼ
a binary tree. [1]
Eʺ ^ÞǣOȖǣǣÌŸɠƼNjŸOs_ȖNjsǣŘ_ǼÌsƼNjŸ¶NjŎÞضOŸŘǣǼNjȖOǼǣsĶsOǼÞŸŘOŘEsȖǣs_ǼŸNŸ_sǣÞŎƼĶs
menu system for user. [2]
SOLUTIONS
a) i) MORE THAN
Static data structure BOOKS
Dynamic data structure
✓ȕǣsǣǣƼOsNjsLJȖÞNjs_ ✓ǢƼOsĶĶŸOǼs__ȖNjÞضOŸŎƼÞĶǼÞŸŘ
✓r¯ʩOÞsŘǼȖǣsŸ¯ŎsŎŸNjɴ ✓ɟǣǼsǣƼOsɠÌsŘŸŘĶɴƼNjǼÞĶĶɴȖǣs_
✓rŎƼǼÞs_ǣǼŸNj¶sOŘEsNjsǼȖNjŘs_ǼŸǼÌs ✓_ŸŘŸǼOÌضsǣÞʊsɠÌsŘƼNjŸ¶NjŎÞǣ
system running
✓OÌضsǣÞʊsɠÌsŘƼNjŸ¶NjŎÞǣNjȖŘŘÞض ✓rǣÞsNjǼŸƼNjŸ¶NjŎ
✓_Þ¯ʩOȖĶǼǼŸƼNjŸ¶NjŎ ✓sǣÞsNjǼŸOÌsOĨ¯ŸNjŸɚsNjʪŸɠ
✓ serial access ✓ random access e.g. Arra
✓ e.g Binary tree, queue, stack, linked list
etc
ÞÞʺ ̜ōĨsǣǼÌsŎŸǣǼs¯ʩOÞsŘǼȖǣsŸ¯ŎsŎŸNjɴǣǼÌs_ǼǣǼNjȖOǼȖNjsŸŘĶɴȖǣsǣŎȖOÌŎsŎŸNjɴǣ
it needs
̜OOsǣǣǼÞŎsǼŸŘÞŘ_ÞɚÞ_ȖĶŘŸ_sÞǣŎȖOÌLJȖÞOĨsNjǼÌŘEɴȖǣÞضǣÞŎƼĶsǣsNjÞĶǣsNjOÌ
ÞÞÞʺ ̜ƻNjŸOs_ȖNjsǣNjsȖǣs_ǼŸOŸ_sǣȖEǼǣĨǣŸ¯ǼÌsƼNjŸ¶NjŎǣsƼNjǼsĶɴʳ
̜NŸŘǣǼNjȖOǼǣsĶsOǼÞŸŘÞǣȖǣs_ǼŸŎĨs¶ŸŸ_OÌŸÞOsŸ¯ǼÌsƼNjŸOs_ȖNjsǼŸsɮsOȖǼsOOŸNj_ÞضǼŸ
the choice of food made.
ʺ ǻÌsOŸ_sEsĶŸɠɠǣƼNjŸƼŸǣs_EɴƼNjŸ¶NjŎŎsNj
Total = 10
Repeat
Read K
If K > 2 Then
Total = Total + K
Else
K = K*k
Total = Total + K
End If
Print Total
Until K = 2
Print Total
End
NJsƼNjsǣsŘǼǼÌsŸȖǼƼȖǼ¯ŸNjǼÌÞǣOŸ_sȖǣÞضǼNjOsǼEĶsɠÞǼÌǼÌs¯ŸĶĶŸɠÞضÞŘƼȖǼǣǼNjÞضʲ
3, 5, 1, 2, 4, 0 [4]
Eʺ ^
sǣONjÞEsŘɴǼÌNjss_Þ¯¯sNjsŘǼŎsǼÌŸ_ǣǼÌǼOŘEsȖǣs_EɴƼNjŸ¶NjŎŎsNjǼŸŎĨsOŸ_s
understandable to someone who has to maintain it. [6]
MB
SOLUTIONS
a) K TOTAL
- 10
3 13
5 18
1
2
19
23
MORE THAN BOOKS
Total = 23
Eʺ ̜Indenting – this is writing the code in a way that all the statements are not in the same line
but rather systematically away from the margin
̜Using comments˛ǼÌÞǣÞǣsɮƼĶÞŘÞضɠÌǼsɚsNjɴƼÞsOsŸ¯OŸ_sɴŸȖɠNjÞǼsÞǣ¶ŸÞضǼŸŎsŘǼŸ
the system.
̜ȕǣÞضEĶŘĨĶÞŘsǣǼÌÞǣONjsǼsǣǣƼOsǣŸǼÌǼsOÌǣǼǼsŎsŘǼOŘEsNjs_sǣÞĶɴ
QUESTION 4
The following data items are to be entered into binary search tree in the order given:
Harare, London, Paris, Rome, Berlin, Amsterdam, Lisbon, Madrid, Lilongwe
a) Draw a diagram to show how these values (data items) will be stored and circle the root node.
[5]
b) If Madrid is being searched for in this binary tree, list the data items which will have to be
accessed. [1]
FOR ORDERS AND ENQUIRIES:
63
(Or any other info about this book)
ŘÞŘÞǼÞĶĶɴsŎƼǼɴǼNjssÌǣǼÌs¯ŸĶĶŸɠÞضÞǼsŎǣ__s_ÞŘǼÌsŸNj_sNjʲmelon, peer, banana,
Oʺ
orange
Draw the binary tree after the four items have been added. [3]
SOLUTIONS
a)
c)
MB
QUESTION 5
MORE THAN BOOKS
ǻÌs¯ŸĶĶŸɠÞضÞǣ¯Nj¶ŎsŘǼŸ¯OŸŎƼȖǼsNjƼNjŸ¶NjŎÝŘǼs¶sNjŘ˚NjsOŸNj_ǣʳ
.
.
.
Procedure display-records (n)
Integer linemax
.
.
.
If (n < n-records) then
Display error message box (.)
End if
.
End procedure
a) Describe the following
MB
QUESTION 17
SOLUTIONS
i)
ii) MB
QUESTION 1
ʺ rɮƼĶÞŘɠÌǼÞǣŎsŘǼEɴʲ
i) source code [1]
ÞÞʺ ŘŸEĠsOǼOŸ_s ʻˠʼ
Eʺ rɮƼĶÞŘǼÌsŘss_¯ŸNjǼNjŘǣĶǼŸNjƼNjŸ¶NjŎǣÞŘOŸŎƼȖǼsNjǣɴǣǼsŎʳ ʻˡʼ
Oʺ ɟÌsŘƼNjŸ¶NjŎŎsNjNjȖŘǣƼNjŸ¶NjŎʰǼÌsƼNjŸ¶NjŎŎɴ¯ÞĶǼŸNjȖŘǣȖOOsǣǣ¯ȖĶĶɴEsOȖǣsǼÌsNjs
are errors in the code.
^sǣONjÞEsǼÌNjssǼɴƼsǣŸ¯sNjNjŸNjǣǼÌǼŎɴEsƼNjsǣsŘǼ¶ÞɚÞضŘsɮŎƼĶsŸ¯sOÌʳ ʻ˨ʼ
SOLUTIONS
a) i) Source code
̜OŸ_sƼNjŸ_ȖOs_EɴǼÌsƼNjŸ¶NjŎŎsNj
̜ƼNjŸ¶NjŎOŸ_sÞŘËĵˀǣǣsŎEĶɴ
̜OŸ_sǼɴƼs_ÞŘEɴǼÌsƼNjŸ¶NjŎŎsNj
ÞÞʺ ŷEĠsOǼOŸ_s
̜sɮsOȖǼEĶsOŸ_sˀŎOÌÞŘsOŸ_sˀEÞŘNjɴ
̜OŸ_sƼNjŸ_ȖOs_¯ǼsNjǼNjŘǣĶǼÞŸŘ
MB
Eʺ ̜NŸ_sƼNjŸ_ȖOs_EɴƼNjŸ¶NjŎŎsNjŘŸǼȖŘ_sNjǣǼŘ_EĶsEɴOŸŎƼȖǼsNjˀOŸŎƼȖǼsNjǣNjsLJȖÞNjsOŸ_s
ÞŘEÞŘNjɴ¯ŸNjŎÌsŘOsŘss_¯ŸNjǼNjŘǣĶǼŸNjƼNjŸ¶NjŎʳ
̜ǻNjŘǣĶǼŸNjOÌضsǣËĵĵˀĵĵĵǼŸEÞŘNjɴ¯ŸNjŎˀǣŸȖNjOsOŸ_sÞŘǼŸŸEĠsOǼOŸ_s
̜ƻNjŸɚÞ_ssNjNjŸNj_Þ¶ŘŸǣǼÞO
Oʺ ̜ǢɴŘǼɮsNjNjŸNjˀsNjNjŸNjÞŘǼÌsĶضȖ¶sŸNjNjȖĶsǣŸ¯ǼÌsƼNjŸ¶NjŎsʳ¶ʳƻNjŘǼÞŘǣǼs_Ÿ¯ƻNjÞŘǼ
̜ĵŸ¶ÞOsNjNjŸNjˀsNjNjŸNjǼÌǼĶĶŸɠǣǼÌsƼNjŸ¶NjŎǼŸNjȖŘEȖǼ¶ÞɚsǣɠNjŸŘ¶NjsǣȖĶǼsʳ¶ʳĠȖŎƼǼŸǼÌs
wrong instruction/adding instead of subtracting
̜NJȖŘǼÞŎsˀsɮsOȖǼÞŸŘ sʳ¶ʳ NjÞǼÌŎsǼÞO sNjNjŸNjˀ NjsLJȖsǣǼ ǼŸ ONjNjɴ ŸȖǼ ÞŘƼƼNjŸƼNjÞǼs ŸNj ÞŎƼŸǣǣÞEĶs
MORE THAN BOOKS
NjÞǼÌŎsǼÞOsʳ¶ʳ_ÞɚÞǣÞŸŘEɴʊsNjŸʳ
QUESTION 2
SOLUTIONS
a) Þʺ
ɚÞǣȖĶEǣÞOsɚsŘǼÞǣŎsǣǣ¶sǣsŘǼEɴŘŸEĠsOǼɠÞǼÌÞŘƼNjŸ¶NjŎǼŸǼÌsŎÞŘƼNjŸ¶NjŎ
ĶŸŸƼʰÞŘ¯ŸNjŎÞضÞǼǼÌǼǣŸŎsǼÌÞضÌǣÌƼƼsŘs_
ii) Visual Basic Events
̜ NĶÞOĨÞضEȖǼǼŸŘ
̜ NĶŸǣÞضɠÞŘ_Ÿɠ
̜ ōŸɚÞضŎŸȖǣsƼŸÞŘǼsNj
̜ NJsǣÞʊÞض¯ŸNjŎ
FOR ORDERS AND ENQUIRIES:
(Or any other info about this book) 80
Eʺ ̜ ÝŘǼs¶sNj
̜ ^ŸȖEĶs
̜ ǢÞضĶs
̜ NÌNjOǼsNj
̜ ǢǼNjÞض
c) Constant Variable
It maintains a single value throughout ÝǼǣɚĶȖsŎɴOÌضsÞŘƼNjŸ¶NjŎsɮsOȖǼÞŸŘʳ
ǼÌsƼNjŸ¶NjŎ˅ǣsɮsOȖǼÞŸŘʳ
Declared using CONST statement Declared using DIM statement
QUESTION 3
ʺ ¶ǣEŸNj_ÌǣEŸȖǼˤ˟˟OȖǣǼŸŎsNjǣʰsOÌɠÞǼ̶ǣŎsǼsNjÞ_sŘǼÞʩs_EɴȖŘÞLJȖsOŸ_sŸ¯
8 digits which include a check digit. The meter readings are taken every 3 months. If a meter
cannot be read, an estimated reading is calculated.
Þʺ ɟNjÞǼsǣƼsOÞʩOǼÞŸŘǣŸ¯ǼÌs_ǼǣǼNjȖOǼȖNjs¯ŸNjǼÌsOȖǣǼŸŎsNjÞŘOĶȖ_ÞضǼÌs¯ŸĶĶŸɠÞض_sǼÞĶǣʱ
ʩsĶ_ŘŎsʰǼɴƼsǣÞʊsŘ_ɚĶÞ_ǼÞŸŘʳ ʻˣʼ
ÞÞʺ ɟNjÞǼs ƼNjŸ¶NjŎ ǼÌǼ OOsƼǼǣ ¶ǣ ŎsǼsNj OŸ_sʰ ƼNjsɚÞŸȖǣ Njs_Þضʰ OȖNjNjsŘǼ Njs_Þض Ř_
OĶOȖĶǼsǣǼÌsŎŸȖŘǼŸ¯¶ǣȖǣs_ȖǣÞضNjǼsŸ¯̱ˢƼsNjĨ¶ʳʰOĶOȖĶǼsǣǼÌsŎŸȖŘǼ_Ȗs¯ŸNj
ƼɴŎsŘǼŘ__ÞǣƼĶɴǣǼÌsÞŘ¯ŸNjŎǼÞŸŘŸŘǼÌsǣONjssŘʳ ʻˠˣʼ
Eʺ ɟNjÞǼsƼNjŸ¶NjŎǼŸ¶Nj_sŎNjĨǣ¯ŸNjˠˡOŸȖNjǣsǣ¯ŸNjOŸĶĶs¶sǣǼȖ_sŘǼʳȕǣsŘɴǣsĶsOǼÞŸŘ
statement of your choice. The grades are as follows:
̤̠˦ˤ^ÞǣǼÞŘOǼÞŸŘ
60 – 74 Merit
50 – 59 Pass
ˣ˟˛ˣ˨ǢȖƼƼĶsŎsŘǼNjɴ
̣̠ˢ˨®ÞĶ ʹˠˡʺ
SOLUTION
ʺ Þʺ ǻɴƼsNȖǣǼŸŎsNj
Surname : String(20)
Firstname : String (15)
MeterCode : integer (8)
MB
Metereading : String (6)
rŘ_ǻɴƼs
ii)
MB
QUESTION 1
ʺ
OŸĶĶs¶sĨssƼǣÞǼǣǣǼȖ_sŘǼʩĶsǣŸŘƼƼsNjɠÌÞOÌÞǣĨsƼǼÞŘʩĶÞضOEÞŘsǼǣʳ_sOÞǣÞŸŘÌǣEssŘ
ǼĨsŘǼŸOŸŎƼȖǼsNjÞǣsǼÌsǣsʩĶsǣʳ
Justify any three measures that can be taken to ensure that stored information remains
OŸŘʩ_sŘǼÞĶʳ ʻ˥ʼ
Eʺ r
ɮƼĶÞŘǼÌsŎsŘÞضŸ¯sOÌŸ¯ǼÌs¯ŸĶĶŸɠÞضÞŘNjsĶǼÞŸŘǼŸ_ǼEǣsʲ
i) Entity [2]
ii) Secondary key [2]
ÞÞÞʺ ®ŸNjsÞ¶Řħsɴ ʻˡʼ
Þɚʺ ǻȖƼĶs ʻˡʼ
ɚʺ _ǼǼɴƼs ʻˡʼ
SOLUTIONS
a) Encryption ˚ǼÌÞǣŎsǼÌŸ_ƼNjŸǼsOǼ_ǼEɴŎĨÞضÞǼȖŘNjs_EĶsǼŸŘɴŸŘssɮOsƼǼǼÌŸǣsɠÌŸ
ÌɚsǼÌsƼƼNjŸƼNjÞǼsƼǣǣɠŸNj_ŸNjĨsɴʳǻÌÞǣOŘƼNjŸǼsOǼ_Ǽ¯NjŸŎEsÞضNjs_ŸNjȖǣs_EɴǼÌŸǣs
not entitled to it.
MB
Authenticate access with strong passwords – this ensures that access is only authorised and
granted to those who have the right to access the data.
ƻÌɴǣÞOĶĶɴǣsOȖNjs_sɚÞOsǣ˛ƼNjŸǼsOǼ_sɚÞOsǣ¯NjŸŎŎÞǣȖǣsŸNjǼÌs¯ǼEɴǣǼŸNjÞضǼÌsŎÞŘĶŸOĨs_Njsǣʳ
b) i) Entity - is a thing of interest on which information or data is being collected.
ii) Secondary key˛ÞǼÞǣʩsĶ_Ȗǣs_ǼŸÞ_sŘǼÞ¯ɴŎŸNjsǼÌŘŸŘsNjsOŸNj_ǼǼÞŎsʳ
iii) Foreign key˚ÞǼÞǣƼNjÞŎNjɴĨsɴÞŘŸŘsʩĶsǼÌǼÞǣ¯ŸȖŘ_ÞŘŘŸǼÌsNjʩĶsʳ
iv) Tuple it is a row in a relational database, and it usually denotes a record in a relation.
v) MORE THAN BOOKS
Data type ˚ǼÌsǣs Njs ǣƼsOÞĶ ǣǼǼsŎsŘǼǣ ǼÌǼ _sǣONjÞEs ǼÌs ŘǼȖNjs Ÿ¯ _Ǽ ÌŘ_Ķs_ Eɴ
ƼNjŸ¶NjŎǣʳ
QUESTION 2
a) List three duties carried out by the database administrator in a database management system.
[3]
Eʺ ^sǣONjÞEsǼÌs¯ŸĶĶŸɠÞضNjsOŸNj_ǼɴƼsǣŘ_¶ÞɚsŘ_ɚŘǼ¶sŸ¯ȖǣÞضǼÌsNjsOŸNj_ǼɴƼsʲ
i) Fixed length record [3]
ii) Variable length record [3]
Oʺ ^ÞǣǼÞضȖÞǣÌEsǼɠssŘǼÌs¯ŸĶĶŸɠÞضʩĶsŸNj¶ŘÞǣǼÞŸŘŎsǼÌŸ_ǣʰŸȖǼĶÞŘÞضǼÌsŎŸǣǼǣȖÞǼEĶs
ƼƼĶÞOǼÞŸŘ¯ŸNjsOÌʲ
i) serial and direct access [4]
ii) sequential and indexed sequential [4]
SOLUTIONS
ʺ ̜ sǼǼÞضȖƼǼÌs_ǼEǣsǼŸ¶sǼÌsNjɠÞǼÌǼÌsƼNjŸ¶NjŎŎsNjǣʳ
Ǣ
̜ NŸŘǼNjŸĶʰŎضsŘ_ŎÞŘǼÞŘǼÌs_ǼEǣsʳ
FOR ORDERS AND ENQUIRIES:
(Or any other info about this book) 100
̜ sʩŘsʰÞŎƼĶsŎsŘǼŘ_OŸŘǼNjŸĶ_ǼEǣsǣǼŸNj¶sʳ
^
̜ rŘǣȖNjsǼÌǼƼŸĶÞOÞsǣŘ_ƼNjŸOs_ȖNjsǣNjssǣǼEĶÞǣÌs_ʳ
̜ ^sʩŘsǼÌsǣǼNjǼs¶ɴŸ¯EOĨȖƼǣǼŸNj¶sŘ_NjsOŸɚsNjÞض¯NjŸŎǣɴǣǼsŎENjsĨ_ŸɠŘ
̜ ǢȖƼsNjɚÞǣsŎsŘ_ŎsŘǼǣǼŸǼÌs_ǼEǣsʳ
̜ rŘǣȖNjsǣǼÌǼǼÌs_ǼÞǣǣsOȖNjs¯NjŸŎȖŘȖǼÌŸNjÞǣs_OOsǣǣ
̜ ǻŸǣǼŘ_Nj_ÞʊsǼÌsȖǣsŸ¯_ǼEǣsŘ_ǣǣŸOÞǼs_ǣŸ¯ǼɠNjs
b) i) Fixed length record
̜ NJsOŸNj_ǣɠÞǼÌʩɮs_ŘȖŎEsNjŸ¯ʩsĶ_ǣŘ_ŘȖŎEsNjŸ¯OÌNjOǼsNjǣÞŘŘɴʩsĶ_Njsʩɮs_
Advantages
̜ NJsOŸNj_ǣOŘEsȖƼ_Ǽs_ÞŘǣÞǼȖ
̜ rǣɴǼŸsǣǼÞŎǼsǣÞʊsŸ¯ʩĶs
̜ rǣɴƼNjŸOsǣǣÞضŸ¯ʩĶsǣ
ii) Variable length record
̜ sOŸNj_ǣÞŘɠÌÞOÌŘȖŎEsNjŸ¯OÌNjOǼsNjǣÞŘŘɴʩsĶ_ɚNjÞsǣEsǼɠssŘNjsOŸNj_ǣŘ_NjsOŸNj_ǣ
NJ
ÌɚsɚNjɴÞضŘȖŎEsNjŸ¯ʩsĶ_ǣ
Advantages
̜ĵsǣǣǣƼOsɠǣǼs_ŸŘǼÌsǣǼŸNj¶sŎs_ÞȖŎ
̜ŗŸǼNjȖŘOǼÞŸŘŸ¯_ǼŸOOȖNjǣ
̜ÝǼŎɴNjs_ȖOsǼÞŎsǼĨsŘǼŸNjs_ʩĶsEsOȖǣsǼÌsNjsOŸNj_ǣNjsŎŸNjsǼÞ¶ÌǼĶɴƼOĨs_
c) i) Serial and direct access
Serial
MB Direct
This is whereby records are stored one This is whereby records are not in any order
after another as they occur, without any but stored and accessed according to their disk
_sʩŘÞǼsŸNj_sNjǣŸŘŎ¶ŘsǼÞOǼƼsǣʳ^Ǽ __NjsǣǣŸNjNjsĶǼÞɚsƼŸǣÞǼÞŸŘʰOĶOȖĶǼs_¯NjŸŎǼÌs
ÞǣŘŸǼǣǼŸNjs_ÞŘŘɴƼNjǼÞOȖĶNjǣsLJȖsŘOsʳ ƼNjÞŎNjɴĨsɴŸ¯ǼÌsNjsOŸNj_
ǢȖÞǼEĶs¯ŸNjǼsŎƼŸNjNjɴˀǼNjŘǣOǼÞŸŘʩĶs Airline booking system
File with high volatility
ii)
MORE THAN BOOKS
Sequential and indexed sequential
Sequential Indexed sequential
This is whereby records are stored one after This is whereby records are ordered in
another and are sorted into a key sequence, sequence based on the value of the index
that is, in ascending or descending order of ŸNj_ÞǣĨ__NjsǣǣǣǣȖƼƼŸNjǼs_EɴÌNj_
¶ÞɚsŘĨsɴʩĶs_ǣŸŘŎ¶ŘsǼÞOǼƼsǣʳ disks.
ƼƼNjŸƼNjÞǼs¯ŸNjʩĶsǣɠÞǼÌÌÞ¶ÌÌÞǼNjǼsĶÞĨs ÝǼÞǣĶǣŸǣȖÞǼEĶs¯ŸNjNjsĶǼÞŎsƼNjŸOsǣǣÞض
ƼɴNjŸĶĶƼNjŸOsǣǣÞضʳ ƼƼĶÞOǼÞŸŘǣĶÞĨsǣǼŸOĨOŸŘǼNjŸĶ
QUESTION 3
ˠʳ ʺ rɮƼĶÞŘɠÌǼÞǣŎsŘǼEɴʲ
i) Primary key [1]
ii) Candidate key [1]
SOLUTIONS
a)
MB
Cust A/C CustName Cell # Date City Code Qty Description Unit Sub
Total
6065913 Ruth
Chakanyuka MORE THAN BOOKS
0772 023 21/01/17
011
Bulawayo 60092317651 10 Chimombe
milk 500ml
0.65 6.50
6065913 Ruth 0772 023 21/01/17 Bulawayo 60051621153 1 ōʊŸsNJǣƼ- 2.39 2.39
Chakanyuka 011 berry 2L
6065913 Ruth 0772 023 21/01/17 Bulawayo 60031005913 4 Bakers In 0.90 3.60
Chakanyuka 011 ǢȖƼsNjÞŸNj
b)
Cust A/C CustName Cell # City
6065913 Ruth Chakanyuka 0772 023 011 Bulawayo
The two tables are related using the Customer Account number
ʺ ǻ
ÌsNjsNjsƼsNjǣŸŘǣǼǣOÌŸŸĶʳrOÌƼsNjǣŸŘÌǣǣȖNjŘŎsʰʩNjǣǼŘŎsʰNJs¶ÞǣǼNjǼÞŸŘŘȖŎEsNj
Ř___NjsǣǣʳǻÌsƼsNjǣŸŘOŘEsŘsŎƼĶŸɴssŸNjǣǼȖ_sŘǼʳrOÌsŎƼĶŸɴssÌǣǣĶNjɴɠÌÞĶs
sOÌǣǼȖ_sŘǼÌǣOĶǣǣʳǻÌssŎƼĶŸɴssOŘEsǼsOÌsNjŸNjŘOÞĶĶNjɴɠŸNjĨsNjʳrOÌǼsOÌsNjÌǣ
ŘrʳNʳŘȖŎEsNjŘ_Ķsɚs_ɴǣʳrOÌŘOÞĶĶNjɴɠŸNjĨsNjÞǣƼÞ_OOŸNj_ÞضǼŸÌŸȖNjǣɠŸNjĨs_ʳ
Draw a normalised ER diagram to illustrate the above scenario. [15]
Eʺ
OŸŎƼŘɴNjsĶÞǣs_ǼÌǼǣŸŎsŸ¯ÞǼǣOȖǣǼŸŎsNjǣNjs_s¯ȖĶǼÞضÞŘƼɴŎsŘǼʳÝǼÞǣ_sOÞ_s_ǼŸ__
ŘsɮǼNjʩĶs¯ŸNjǼÌs_sEǼŸNjǣʰɠÌŸÞŘOĶȖ_sǼÌs¯ŸĶĶŸɠÞضʩsĶ_ǣʲNȖǣǼŸŎsNjŘŎsʰ__Njsǣǣʰˢ˟
days, 60 days, 90 days and 120 days.
ǻÌsOŸŎƼŘɴɠŘǼǣǼŸƼNjŸ_ȖOsŎÞĶÞضĶÞǣǼ¯ŸNjOȖǣǼŸŎsNjǣɠÞǼÌ˥˟_ɴǣ_sEǼǣŸ¯ǼĶsǣǼ̱ˢ˟ʰ
in descending order of debts.
ɟNjÞǼsŘǢdžĵǣǼǼsŎsŘǼǼŸNjsǼNjÞsɚsǼÌsNjsLJȖÞNjs_ÞŘ¯ŸNjŎǼÞŸŘʳ ʻ˧ʼ
Oʺ ŷ
ŘsŸ¯ǼÌs_sEǼŸNjǣʰōNjōNjÌǣ¯ȖĶĶɴOĶsNjs_ÌÞǣ_sEǼʳǻÌsOŸŎƼŘɴɠŘǼǣǼŸNjsŎŸɚsÌÞǣ
ŘŎs¯NjŸŎǼÌsĶÞǣǼʳɟNjÞǼsǼÌsOŸNjNjsOǼOŸŎŎŘ_¯ŸNjǼÌÞǣOǼÞŸŘʳ ʻˢʼ
d) Create a database and show how to connect the IDE language. [4]
SOLUTIONS
MB
a)
ǻÌsOÌŸÞOsŸ¯ʩĶsŸNj¶ŘÞǣǼÞŸŘÞǣOŸŘǣÞ_sNjs_ɚÞǼĶEɴ_sǣÞ¶ŘsNjʳŘȖŎEsNjŸ¯LJȖsǣǼÞŸŘǣŘss_ǼŸEs
asked.
ʺ r ɮƼĶÞŘŘɴǼɠŸÞŎƼŸNjǼŘǼLJȖsǣǼÞŸŘǣǼŸEsOŸŘǣÞ_sNjs_EɴǼÌs_sǣÞ¶ŘsNjʳ ʻˣʼ
Eʺ µÞɚsŘsɮŎƼĶsŸ¯ŘƼƼĶÞOǼÞŸŘɠÌsNjsÞǼÞǣǣsŘǣÞEĶsǼŸȖǣsǼÌs¯ŸĶĶŸɠÞضʩĶsǣɴǣǼsŎǣʲ
i) Serial
ii) Sequential
iii) Random [3]
Oʺ rɮƼĶÞŘɠÌɴsOÌʩĶsǣɴǣǼsŎÞŘʹÞʺÞǣƼƼNjŸƼNjÞǼsʳ ʻˢʼ
_ʺ ɟÌsŘOĶOȖĶǼÞضǼÌs__NjsǣǣŸ¯NjsOŸNj_ÞŘNjŘ_ŸŎʩĶsǣɴǣǼsŎȖǣÞضÌǣÌÞŘ¶Ķ¶ŸNjÞǼÌŎʰ
synonymous addresses are bound to occur where two records generate the same address.
Þʺ µÞɚsŘɴǼɠŸƼNjŸƼsNjǼÞsǣŸ¯¶ŸŸ_ͶŸNjÞǼÌŎʳ ʻˡʼ
ÞÞʺ rɮƼĶÞŘŘɴǼɠŸɠɴǣÞŘɠÌÞOÌǣɴŘŸŘɴŎŸȖǣ__NjsǣǣsǣOŘEsNjsǣŸĶɚs_ʳ ʻˡʼ
sʺ r
ɮƼĶÞŘÌŸɠǼÌsǣsŸƼsNjǼÞŸŘǣOŘEsƼsNj¯ŸNjŎs_ÞŘNjŘ_ŸŎʩĶsʳ
i) Access a record [2]
ii) Delete a record [2]
SOLUTIONS
ʺ ̜ōȖǣǼǼÌsȖǣsNjÌɚsÞŎŎs_ÞǼsOOsǣǣǼŸǼÌs_ǼʰɠÞǼÌNjsǣƼŸŘǣsǼÞŎsŸ¯ŘŸŎŸNjsǼÌŘ
few seconds
MB
̜ōȖǣǼǼÌsÞŘ¯ŸNjŎǼÞŸŘEsOŸŎƼĶsǼsĶɴȖƼǼŸ_ǼsŸNjɠÞĶĶĶǣǼŘÞ¶ÌǼǣŸNjĶǣǼɠssĨ˅ǣÞŘ¯ŸNjŎǼÞŸŘ
EsǣȖ¯ʩOÞsŘǼ
̜NŘNjsLJȖsǣǼ¯ŸNjÞŘ¯ŸNjŎǼÞŸŘEsEǼOÌs_ʰǣsLJȖsŘOs_Ř_ƼNjŸOsǣǣs_ĶĶǼŸ¶sǼÌsNjʷ
̜ɟÌǼÞǣǼÌsŎŸǣǼǣȖÞǼEĶsǣǼŸNj¶sŎs_ÞȖŎ¯ŸNjǼÌsɚŸĶȖŎsŸ¯_ǼÞŘɚŸĶɚs_ʷ
̜ɟÌǼɠÞĶĶÌƼƼsŘÞ¯ǼÌsÞŘ¯ŸNjŎǼÞŸŘŸŘǼÌsʩĶsǣÞǣĶŸǣǼŸNj_sǣǼNjŸɴs_ʷ
̜ɟÌǼÞǣǼÌsÌÞǼNjǼsŘ_ɚŸĶǼÞĶÞǼɴŸ¯ǼÌsʩĶs
b) i) Serial˛ǻNjŘǣOǼÞŸŘʩĶs
1. ȕǣsǣƼNjs_ǣÌssǼŸ¯ɴŸȖNjOÌŸÞOsǼŸǣÞŎȖĶǼsǼÌs¯ŸĶĶŸɠÞŘ¶ĶŸ¶ÞOŸ¯ǼÌsɠŸNjĨǣÌssǼʳ
(a) Use the following formulae:
ǢÞŎȖĶǼsǼÌsOÞNjOȖÞǼEsĶŸɠŸŘǼÌsǣƼNjs_ǣÌssǼŘ_OŸŎƼĶsǼsǼÌsǼNjȖǼÌǼÌǼ¯ŸĶĶŸɠǣʳ
ŷȖǼƼȖǼ
MB
[5]
ʹEʺ ^NjɠǼÌsəŸŘŗsȖŎŘŘŘ_ËNjɚNj_NjOÌÞǼsOǼȖNjssɮƼĶÞŘÞضǼÌsÞNj_Þ¯¯sNjsŘOsǣʳ
ğȖǣǼÞ¯ɴɴŸȖNjŘǣɠsNjǼŸɠÌÞOÌNjOÌÞǼsOǼȖNjsÞǣǼÌsEsǣǼǼŸ_ŸƼǼʳ ʻ˦ʼ
ʹOʺ ǢŸŎsŸ¯ǼÌsOŸŎƼŸŘsŘǼǣŸ¯OŸŎƼȖǼsNjǣɴǣǼsŎNjsʲ
ƻsNjÞƼÌsNjĶǣ ˚ ħsɴEŸNj_
I/O Ports
MORE
-
- Monitor
THAN BOOKS
VDU controller
˚ ħsɴEŸNj_OŸŘǼNjŸĶĶsNj
Memory - Main Memory
- Secondary Storage
System buses - Data bus
- Address bus
^NjɠǼÌs_Þ¶NjŎEsĶŸɠŘ_ĶEsĶǼÌsOŸŎƼŸŘsŘǼǣȖǣÞضǼÌsĶÞǣǼEŸɚsʳ
2. ʹʺ
NjsǼÞĶǣǼŸNjsÞŘōȖǼNjsɠŘǼǣǼŸEȖɴŘOOŸȖŘǼÞضƼƼĶÞOǼÞŸŘƼOĨ¶sɠÌÞOÌɠÞĶĶǣǣÞǣǼ
ÞŘONjNjɴÞضŸȖǼ_ÞĶɴǣǼŸNjsŸƼsNjǼÞŸŘǣʳǻÌsŸƼsNjǼÞŸŘǣÞŘOĶȖ_sǼĨÞضƼNjŸ_ȖOǼǣǼŸOĨʰ
OƼǼȖNjÞضǣŸĶ_ƼNjŸ_ȖOǼǣŘ_ƼNjÞŘǼÞضNjsƼŸNjǼǣ¯ŸNjŎضsNjÞĶǣǼ¯¯ʳ
ǣǣɴǣǼsŎ_sɚsĶŸƼsNjʰ_sǣÞ¶ŘǣȖÞǼEĶsǣŸ¯ǼɠNjsNjOÌÞǼsOǼȖNjs¯ŸNjǼÌsŎsŘǼÞŸŘs_NjsLJȖÞNjsŎsŘǼǣ
ȖǣÞضŘƼƼNjŸƼNjÞǼs_sǣÞ¶ŘǼŸŸĶʳ ʻ˧ʼ
ʹEʺ ƼŸɠsNjǣǼǼÞŸŘÌǣǣ¯sǼɴǣɴǣǼsŎEǣs_ŸŘǼÌNjssÞŘƼȖǼǣǼŸĶŸ¶ÞOŘsǼɠŸNjĨʳ
^NjɠĶŸ¶ÞOŘsǼɠŸNjĨŘ_ǼNjȖǼÌǼEĶsǼŸǣÌŸɠĶĶǼÌsƼŸǣǣÞEĶsǣÞǼȖǼÞŸŘǣɠÌsŘǼÌsɠNjŘÞضǣÞ¶ŘĶ
could be received. [12]
3. ʹʺ ɟ NjÞǼsŘͶŸNjÞǼÌŎÞŘƼǣsȖ_ŸOŸ_sǼŸOĶOȖĶǼsǼÌsɚsNj¶sŸ¯ǣsǼŸ¯ˤŎNjĨǣ¯ŸNjˠ˟
students entered through the keyboard. [8]
ʹEʺ ^sǣÞ¶ŘŘÞŘǼsNj¯OsŘ_ɠNjÞǼsƼNjŸ¶NjŎǼŸOŸŘɚsNjǼONjsǣǼŸÌsOǼNjsǣʳʻˠONjs̠˟ʳˣ˟ˣ˥˧˥
hectares]
ǻÌsƼNjŸ¶NjŎǣÌŸȖĶ_ɠŸNjĨ¯ŸNjNjsĶŘȖŎEsNjǣǣɠsĶĶǣɠÌŸĶsŘȖŎEsNjǣʹsʳ¶ʳÞǼǣÌŸȖĶ_OOsƼǼ
7.2 acres, 0.5 acres etc.).
(c) By using the bubble sort algorithm, write a code to sort an integer array of 10 (10) elements
in ascending order. [25]
ʹ_ʺ ȕǣÞضƼNjŸ¶NjŎŎÞضĶضȖ¶sŸ¯ɴŸȖNjOÌŸÞOsʰɠNjÞǼsƼNjŸ¶NjŎǼÌǼOOsƼǼǣ_ÞǣǼŘOsŸ¯
ĠŸȖNjŘsɴʹÞŘĨŎʺŘ_ǼÞŎsʹÞŘÌŸȖNjǣʺǼŸEsǣƼsŘǼ_ȖNjÞضǼÌsĠŸȖNjŘsɴʳ
ǻÌsƼNjŸ¶NjŎǼÌsŘOĶOȖĶǼsǣǼÌsǣƼss_ʱŘ__sǼsNjŎÞŘsǣɠÌsǼÌsNjǼÌsǣƼss_ÞǣǣĶŸɠʰŘŸNjŎĶ
ŸNjÌÞ¶ÌʳǻÌsƼNjŸ¶NjŎǼÌsŘ_ÞǣƼĶɴǣǼÌsǣƼss_Ř_ǼÌsOǼs¶ŸNjɴÞŘɠÌÞOÌǼÌsǣƼss_EsĶŸŘ¶ǣ
ǼŸʳǻÌsǣƼss_OǼs¶ŸNjÞsǣNjsǣ¯ŸĶĶŸɠǣʲ
Sow 1 – 45 km/hr
Normal 45 – 80 km/hr
High ̤˧˟ĨŎˀÌNj
4. ʹʺ ǻ
ÞOĨsǼǣNjsǣŸĶ_¯ŸNjOŸŘOsNjǼǼ̱ˢ˟sOÌŘ_ƼsNjǣŸŘÞǣŘŸǼĶĶŸɠs_ǼŸEȖɴŎŸNjsǼÌŘ
50 tickets. MB
The details for the discounts are given in the table below.
Number of tickets Discount
10 – 20 10%
21 – 50 20%
MORE THAN BOOKS
^NjɠʪŸɠOÌNjǼŸ¯ƼNjŸ¶NjŎǼÌǼOOsƼǼǣǼÌsŘȖŎEsNjŸ¯ǼÞOĨsǼǣʰOĶOȖĶǼs_ÞǣOŸȖŘǼŘ_
_ÞǣƼĶɴǣǼÌsǼŸǼĶOŸǣǼŸ¯ǼÌsǼÞOĨsǼǣʳ
[12]
ʹEʺ
ƼNjŸ¶NjŎ OOsƼǼǣ ǼŸǼĶ ŎŸȖŘǼ Ÿ¯ _ÞĶɴ ǣĶsǣ ǼNjŘǣOǼÞŸŘǣ ¯ŸNj ǼÌNjss ǣĶsǣƼsNjǣŸŘǣʰ
OOȖŎȖĶǼsǣǼÌsǼŸǼĶǣĶsǣ¯ŸNjsOÌǣĶsǣƼsNjǣŸŘŘ_ǼÌs¶NjŘ_ǼŸǼĶŸ¯ĶĶǼÌsǣĶsǣʳǻÌs
ƼNjŸ¶NjŎǼÌsŘŸȖǼƼȖǼǣǣĶsǣƼsNjǣŸŘŘȖŎEsNjʰǼŸǼĶǣĶsǣƼsNjǣĶsǣƼsNjǣŸŘŘ_ǼÌs¶NjŘ_ǼŸǼĶʳ
Þʺ ^NjɠǣǼNjȖOǼȖNjs_Þ¶NjŎǼŸÞĶĶȖǣǼNjǼsǼÌsƼNjŸ¶NjŎʳ ʻˠˢʼ
ÞÞʺ ɟNjÞǼsƼNjŸ¶NjŎ¯ŸNjǼÌsǣOsŘNjÞŸ_sǣONjÞEs_ʳ ʻˡˤʼ
5. ʹʺ
ǣOÌŸŸĶÌǣƼŸĶÞOɴǼÌǼĶsNjŘsNjÌǣǼŸƼNjǼÞOÞƼǼsÞŘǼĶsǣǼŸŘsOĶȖEʳrOÌOĶȖEÌǣǼ
ĶsǣǼŸŘsƼǼNjŸŘɠÌŸÞǣǼsOÌsNjʳǼsOÌsNjŎɴŸŘĶɴƼǼNjŸŘŸŘsOĶȖEʳ
Þʺ ^NjɠŘrNJ˚_Þ¶NjŎ¯ŸNjǼÌÞǣǣɴǣǼsŎɠÞǼÌOĶsNjĶEsĶǣŸŘǼÌsNjsĶǼÞŸŘǣÌÞƼǣŎŸŘ¶ǣǼǼÌs
entities in the scenario, in second normal form (2NF). [6]
FOR ORDERS AND ENQUIRIES:
(Or any other info about this book) 140
Melbee Books MORE THAN BOOKS
Publishers Of MES
A’ level MES
Unleashed!!
WITH
ANSWERS