SRSS 2019 P1 Solution
SRSS 2019 P1 Solution
Sec 4E
2019 Preliminary Exams (Marking scheme)
Q1) [5]
A network configuration
where the entire network may
Service Set fail whenever any computer
Identifier in the network fails.
An identifier that is
Star Topology automatically assigned by a
router. It is required to
receive and forward data
packets out of a network
Q2)
1
a) (10000101)2
= (1*128) + (1*4) + (1*1)
= 133 or (133)10 [2]
(FB)16
= 11111011 or (11111011)2 [2]
c) (11110)2
= (0001 1110)2
= ( 1 E )16
= 1E or (1E)16 [2]
(ii) [1]
(b) (i)
2
[2]
(ii) [2]
• Presence check
• Length check
• Format check
• Range check
(c) [4]
Boundary condition 1, 1
Error condition 0, 10
• Poor authentication
• Poor access control or authorization
• Poor understanding of privacy policies
(b) [2]
• Use of passwords
3
• Use of security tokens
• Use of Biometrics
• Setting file permissions
• Use of firewalls
• Encryption of files (password protecting of files)
• Reading and fully understanding privacy policies on use of
services online
• Use of anti-virus software
(c) [4]
4
Q5) (a) [4]
(b) [3]
(c) [3]
5
Storage medium: Solid state
Advantage: One from:
§ Faster read/write speed
§ Light weight and portable
§ Silent operation
§ Low power consumption
6
Q6) (a) [4]
F X
(b) [4]
7
Working Space
F T P X
T AND F NOT P NOT P AND F
0 0 0 0 1 0 0
0 0 1 0 0 0 0
0 1 0 0 1 0 0
0 1 1 0 0 0 0
1 0 0 0 1 1 1
1 0 1 0 0 0 0
1 1 0 1 1 1 1
1 1 1 1 0 0 1
7) a) [8]
• Error 1: Line 5
Correction: WHILE Guess != Answer
• Error 2: Line 10
Correction: BREAK
• Error 3: Line 13
Correction: Record[Count] = Guess
• Error 4: Line 15
Correction: Count = Count + 1
(Single indentation. This statement must be
within the While loop.)
8) a) [3]
8
A5 – Text / General
D5 – Currency / Accounting / Money
H10 – Date
b)
= C5 * $B$2
c) [2]
= MAX(D5:D22)
• Byte 5
• Byte 7
• Byte 3
(ii) [1]
• Column 7
(iii) [1]
1 0 1 0 0 0 0 0
(iv) [1]
10) [6]
9
- Input name and score
- …… and check if name is “DONE” then break
- Input name and/or score in separate arrays
- Check if score input is higher than the highest recorded score
- …… and update as highest score if it is higher
- Loop management to read scores from array
- …… and output name and score of top student(s)
Sample algorithm:
Highest = -1
Count = 0
FOR i = 1 to 32
OUTPUT "Enter student name: "
INPUT Name
IF Name == "DONE" THEN
BREAK
ENDIF
Namelist[Count] = Name
Scorelist[Count] = Score
NEXT i
FOR j = 1 to Count
IF Scorelist[j] == Highest THEN
OUTPUT Namelist[j],Highest
NEXT j
10