1

CAPE Computer Science Unit 2 Paper 2 June 2015

2
3
4
5
6
7
8
9
10
 l'HINT yu ul'. lllllllC llll lh c llt1d1clow nn~ rdu rn
1hls bouki<1wlll1)'Oi1i:1111swc.r~hcrl. Fnllnrc l<f TEST C OD E 02215010
rlo ~() ·nfA Y r.-s11.ll·l11 dls<in1lllfi~~tl m1; ' ',.
MAY/JUNE2018
FORM TP 2018.180 . ,,
CA RIBil EAN EXAMINATIONS COUNCIL
CA RIBBEAN ADVANCED PROFICIENCY EXAMINATION®
COMPUTER SCIENCE

UNIT 2- Paper 01
I hour 30 minutes

( 12 JUNE 2018 (a.m.))

\\£till i'\W., VOLLO'NlNG lN'2>TR"GCi'lON'2> C~1'\)L\.,'l .

I. Th is test consists of 45 items. You will have 1 hour and 30 minutes to answer them .

2. In add ition to th is test booklet, you should have an answer sheet.

•
3. Do not be concerned that the answer sheet provides spaces for more answers than there are items
in th is test.
Each item in this test has four suggested answers lettered (A), (B), (C) , (D) . Read each item
I
f
4.
you are about to answer and decide which choice is best.

On your answer sheet, find the number which corresponds to your item and shade the space
5.

I having the same I_etter as the answer you have. chosen. Look at the sample item below.

Sample ftem

I How many selection lines does an 8 x I multiplexer have?

(A)
(B) 2
Sample Answer

I (C)
(D)
3
8

The best answer to this item is "3", so (C) has been shaded.

r,r 6. If you want to change your answer, erase it completely before you fill in your new choice.
' ;'
7. When you are told to begin, turn the page and work as quickly and as carefully as you can. lf
you cannot answer an item, go on to the next one. You may return to that item later.

8. You may do ariy rough work in this booklet.

r 9.
IO.
Figures are not necessarily drawn to scale.

The use of silent, non -programmable calculators is allowed .

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO.

Copyright© 2017 Caribbean Examinations Council

All rights reserved .
022150 I 0/CAPE 2018
 - 2 -

~ refers to th e fol lowi ng d iagram

. h shows three items stored in a stack
I. The M o unt H o lo lo Hi g h Sc hoo l ha s o ne W h IC .
co mputer Jab wi th te n co mputers and
one pr·in tcr full y netwo rked . Which ADT
wo uld be OEST suit ed to handl e th e print Operations:
jo bs o f the s tuclcnts? PUSH(BANANA)
oRANGE ~TOP
POP
(A) Array GRAPE POP
(B) Stack APPLE
(C) Queue
(D) Li nked li s t Which of the following diagrams gives the
2. state of the stack after the operations listed
are performed in order?

(A)
◄
--- ---TOP

GRAPE
APPLE

(B)

GRAPE -◄
,.._--TOP

APPLE

• (C)

GRAJ>E TOP
BANANA

(D)

GRAPE
_____
.__APPLE __]
◄◄
a--TOP

GO ON TO THE NEXT PAGE

0221501 OiCAPE 2018
 - 3-

3. Which of the fo ll owi ng state me nt s is true Item 5 refers to the following diagrams
for both a linear search and a binary search? whi c h show two items stored in a queue .

(A) On avcrugc they sea rc h half the lis t. Initial Stale

(B) In the worst case scenario they
search the e ntire li st. FRONT REAR

(C) T hey can be used for searchihg an

o rdered list. I +I +
H J
(D) They require that the list be
ordered . Final State
FRONT REAR
4. In which of the following situations would
the implementation of a queue be MOST
i
J K L
appropriate?

(A) Storing information when functions Which of the following sequences of

5.
are called
operations would transform the queue from
(B) Translating computer language
the 1nitial state to the final state shown
(C) E v a 1u at i n g re v e rs e p o I i s h
above?
mathematical expressions
(D) Rescheduling CPU time for (A) DEQUEUE , ENQUEUE(K) ,
processes using round robin ENQUEUE(L)

(B) ENQUEUE(L) , ENQUEUE(K) ,

DEQUEUE

(C) D EQU EU E, D EQ U EU E,
ENQUEUE(L), ENQUEUE(K),
ENQUEUE(J)

(D) DEQUEUE, DEQUEUE,

• ENQUEUE(J), ENQUEUE(K),
ENQUEUE(L)
 -4 -

Ite m 8 refers to the follow ing segment of an

6. Consider a circu lar queue. C , w ith a po inter
rear that refere nc es th e loca ti o n of lh e rear
of th e queue. The front po inter is se t to zero
before any ADT operation . The following
operatio ns arc performed on C .
~plete a lgorithm for performing a linear
sea rch for target on an array list with size Ii .
I, II , Ill, IV represent the miss ing steps.

enqueue, enqueue, enqueue, dequeue, count = 0

dequeue, enqueue, enqueue, enqueue, flag = false
dequeue REPEAT
IF (list[count] = target) THEN
I
Assun1ing that the locations ranoe 0
from 0
to 4 , what is the value of the pointer front?
END IF
II
UNTIL ~ag = true or lll
(A) 0
(B) IF flao0 = false THEN
(C) 2 IV
(D) 3 END IF

7. Figure I shows the state of a stack before 8. Which of the following sets of steps would
the pop operation is performed. Figure 2 complete the algorithm?
shows the state after the pop operation
is performed . Which of the followino0 (A) I - flag = true
combinations of arrows correctly identifies lI - add l to count
the top of the stack structures? III - count = n - 1
IV - WRITE target not found
Figure I -
~
I
II (B) I - flag= true
-.

III
11 - add 1 to count
s ◄ Ill - count = n
B IV - WRITE target found
·N .
IV
• (C) I - flag •= true
II - add 1 to count
III - count= n-1
IV - WRITE target found
V
Figure 2 -
(D) l - flag = true
II - add l to count
VI
s -- -

Ill - count= n
B - VII
~
_.
IV - WRITE target not found
N VIII

(A) I and-v
(B) II and VJ
(C) III and Vll
(D) IV and VIII

GO ON TO THE NEXT PP
022150 I 0/CAPE 20 I 8
 - 5-

A qu e ue is imp lem e n te d 11 s in g a 0 11 c - ~ 2 refer to th e fo ll owi ng list o f

9.
d ime nsiona l army. W h ic h of the fo ll owin g c rc at11rcs .
actions 8 EST describes th e dequ eue opcmtio 11
performed using the array? frog , u11t, <log, grasshoppe r, bee , fi sh ,
sna ke
(A ) Return the las t cle m en t in th e array.
(B) Rctum the first e lement in the array.
(C) C heck that the que ue is not empty, 11 . Which of the followin g lists w ill NOT be
then return the first e leme nt in obtained at any po int while applyin g the
the array and shift the remaining selection sort algorithm?
e lements up one place.
(D ) C he ck that the queu e is empty, (A) ant, frog , dog, grassh opper, bee ,
the n return the first element in fish , snake
the array and sh ift the remaining (B) a nt, bee, frog, dog, grasshopper,
elements up one place. fish , snake
(C) ant, bee, dog, fish , frog, grasshopper,
snake
Item 10 refers to the following list. (0) ant, bee, dog, grasshopper, frog,
fish , snake
A C E F G K L
12. Assume that the list is sorted . When
The target value is I. A binary search is
searching the sorted list, which of the
10.
following creatures will be found MOST
employed . How many comparisons are made
quickly using binary search?
before it can be concluded that the letter I
does NOT appear in the list?
(A) ant ·
(B) grasshopper
(A) 2
(C) fish
(B) 3
(C) 4
(D) dog
(D) 7

•
 - 6 -

. 4 re fers to a segment of an _i ncomplete

Items 13 refers to the follow ing army. ~h for sortino a n array list o f size n
algont rn °
usi ng a bubble sort.

POSlTION
30 32 24 18 7
4
I 3
5
REP EAT
flag = false
0 2 3
FOR pos= 1 ton - I DO
IF(list[pos) > list[pos + I]) THEN
13. Using the selection sort algorithm , what I
would the array above look like after Il
three passes? llI
IV
(A) 3 7 18 24 32 30 END IF
END FOR
POSITION 0 1 2 3 4 5 subtract l from n
UNTIL flag = false or n = 1
(8) 3 7 24 18 30 32

POSITION 0 1 2 3 4 5 Which of the following sequences would

14 . .h?
complete the algont m ·
(C) 3 7 18 30 32 24
(A) 1 _ flag = true
POSITION 0 1 2 3 4 5 II - list[pos] = list[pos + I]
Ill - temp= list[pos]
(D) 3 7 18 24 30 32 IV - list[pos + 1] = temp

POSITION 0 1 2 3 4 s (B) · I - temp = list[pos]

II - list[pos] = list[pos + 11
Ill - list[pos + 1] = temp
IV - flag= true

(C) l - flag = true

• II - temp= list[pos]
III - list[pos + 1] = temp
IV - list[pos] = list[pos + 1]

(D) l - temp= list[pos]

ll - list[pos + 1] = temp
II I - list[pos] = list[pos + l]
(V - flag = true

022150 TO/CAPE 2018 GO ON TO THE NEXT PAC,

 - 7-

Item 15 refers to the following segment of Item 16 refers to the following scenario.
an incomplete algorithm for performing a
selection sort on an array /is l in ascending A doctor is assigned to one or more
patients who are assigned to a specific ward .
order.
Attributes of a patient include patient ID and
FOR i = 0 to n- 2 DO information on his/her condition. The ward
min = i also has an ID.
FORj =i+ I ton- I DO
IF I THEN 16. Which of the ER diagrams below BEST
min= j illustrates this information?
END IF
SWAP list[i] and_-'CI..:....I_ (A) Doctor
END FOR
END FOR Treats
1 Condition

15. Which sequence of the following steps

would correctly complete the algorithm?
Ward

(A) I - list[j] < list[min] in

II - list[min]
(B) Doctor
(B) I - IistOJ > list[min]
II - Iist[min]
Treats

(C) I - list[j] < list[min]

IT - list[j] ....1'-------=S;.;;;;tays in

(D) I - list[j] > list[min]

II - listOl

• (C) Doctor

Ward

(D) Doctor
1
Treats

has
1---- ----- Condition
1

GO ON TO THE NEXT PAGE

022150 I 0/CAPE 2018
 - 8 -

. h fthe fo llowing practices is No-,.,

Wh1c o . i a
20 . od programming style?
· is true of a tenet o f go
17. Wh ic h of the fo ll owi n g
feasib ility study? Usi ng comments for_docurnentation
(A) Appropriately spacing code
ffc ctivc 111ca ns (B)
(A) It describes a c?s I c . ·e el Indenting where necessary
of developing the p1op os (C)
Fixing logic errors
systern . d (D)
(8) It discusses whether the pr~pose
system will be cost effective.
It is usually a lengthy and costly . h f the following outputs is a result
(C) 21. Whtc o
process. of using a CASE tool?
(D) It describes how current software
and hard,vare can be used to Prototype
(A)
develop the proposed system. Feasibility study
(B)
Program definition .
(C)
Cost/benefit analysis
One of the MAIN weaknesses of the
(D)
18.
waterfall model is that it
Which of the following_ graphical tools is
(A) requires significant technical 22.
MOST suitable for show mg h~w a software
support d velopment project and its subtasks
(B) encourages an increase in project
s~ould be completed within a specified
size
(C) is an inflexible development model timeframe?
(D) consumes a lot oftime and resources
(A) Gantt chart
(8) Decision tree ·1
19. Assume that a software application is being (C) Dataflow diagram
developed using the evolutionary approach. (D) System flowchart

Which of the following are types of

evolutionary development? 23. When the individual modules of a
software syst~m were tested, no errors
I. Exploratory developmenf' were discovered. However, when all
II. Throw-away prototyping the modules were merged and tested, the
III. Rewind approach system failed.

(A) rand H only Which of the following tests would MOST

(B) I and HI only likely help in identifying the failure?
(C) II and I JI only
(D) I, TI and HI (A) Acc~ptance testing
(8) Integration testing
(C) Testing individual modules
(D) Testing using live data

022150 I 0/CAPE 2018 GO ON TO THE NEXT PAG

 - 9 -

24 . Wh ich of the fo ll ow ing nre exa mple s or 28 . So ftware evolution may £3EST be defined as
n onfunct ional rcq ui rc rn cnls? lh c

I. Pl.itfonn constra int s (/\) improv e ment o f software by

Jr. Respo nse ti m es addressing bugs
JI I. Reliability (B) development of new software from
rv. Fault to lerance an exi sting system

l (A) I and Ill only

(C) automatic adaptation of software to

,
changing customer requirements
(B) II and III only (D) modification of software to satisfy
(C) I, II and Ill only changes in customer and market
(D) I, II, III and IV requirements

I
I
25. Which of the following attributes does NOT 29. Which of the following is considered a
contribute to a system 's maintainability? functional requirement?

(A) Useful documentation (A) Reusability

(B) Consistent, meaningful variable (8) Availability
names (C) Inputs
(C) Pieces of code with well-defined (D) Response time
purpose
(D) Code that provides functionality
not currently used., but which 30. Which of the following design processes
will possibly be used in the refers to the identification of subsystems and
future their relationships?

(A) Interface
26 Which ofthe following phrases describe the (8) Component
contents ofan entry in a data dictionary? (C) Architectural
(D) Data structure
I. The name of the element
II. The type and format of the ele1111ent
Ill. A list of related elements 31. Which of the following pieces of information
is NOT contained in a process control block?
(A) land U only
(B) land III only (A) Amount of CPU time used
(C) II and fII only (B) Estimated time to completion
(D) I, II and Ill (C) Job priority
(D) Process ID

27. Which life cycle model approach is BEST

suited to a system with critical safety and
security requ'irements?

(A) Waterfall approach

(B) Formal transformation
(C) Fountain approach
(D) Evolutionary development

GO ON TO THE NEXT PAGE

022150 I0/CAPE 20 I 8
 - IO -

. '?
. BEST describes ' paging .
32. Whi ch of the followlllg phrases
· aller chunks · II d
(A) The division of documents mto sm rn called frames to main memory ca e pages
(B) The assignment of chunks of a progra called frames to different secondary storage llledia'
(C) The assignment of chunks of a progarn II d pages to chunks of memory called frames
(D) The assignment of chun ks o fa program ca e

Item 33 refers to the following diagram .

MODEM COMPUTER
MODEM

33. The diagram BEST illustrates

(A) routing
(8) addressing
(C) modulation and demodulation
(D) multiplexing and expandability

34 . The tenn ' firewire ' refers to a 36. Which of the following statements is true
about a process being scheduled with a non-
(A) type of cabling that allows com- preemptive algorithm?
munication between computers
(B) software running on a computer (A) It is placed at the top of the ready
that protects it from external queue if it has a higher priority
attacks
(C) •
high-speed serial bus system
than all the processes already in
the queue.
(D) type of computer virus (B) Once it enters the running state, it
is allowed to run to completion
or until it yields the processor.
35. A webmaster has decided to design his (C) Once it enters the running state, it
website offiine and upload tJ1e various files
is given a fixed amount of time
and graphics to the web server remotely.
to use the CPU after which other
processes get a chance to use the
Which of the following methods would be
CPU .
BEST suited for providing the FASTEST and (D) Once it enters the running state, it is
MOST secure way of uploading the data?
given a variable amount of time
(A) FTP to use the CPU depending on its
(B) priority.
GSM
(C) HTML
(D) UML

02215010/CAPE 2018 GO ON TO THE NEXT PAGE

 - I1 -

37. Wh ich of the fo llow ing lc;1t11rcs is NOT a Ite m 41 refe rs to the fo ll ow ing diagram .
funct ion of an opcrnt ing system?

(A) User SC'rnrity

(G) lJscr in tcrfocc
(C) Doc ument crea t ion
(D) Rcso11rcc n1 nnagc 111 c111

3S. Which IEE E standards ca n be e mpl oyed

when sett ing up a w ire less LAN fo r wireless
devices needi ng tra nsfer rates GR EAT ER
tha n 20 mbps?

I. 802. I I a 41. The items labelled X and Y res pect ive ly

11. 802. 11 b represent a
rn. 802.11 g
(A) hub and node
(A) I only (B) server and hub
(8) II only (C) workstation and node
(C) I and II only (D) workstation and server
(0) I and III only

42 . A running process initiates an input request

39. Which of the following outcomes relates to to get data from the keyboard. Which of the
the use of v irtual memory? following state transitions will take place
when the data is made available?
(A) Memory works faster
(B) Faster execution speeds (A) Ready to running
(C) Ali programs are in memory (B) Running to ready
(D) Illusion that the computer has more (C) Blocked to ready
memory (D) Blocked to running
•

40. lf a node fails in a ring network, how many Item 43 refers to the following diagram .
other stations are affected?
Process A
(A) Half of the stations
(B) All other stations
(C) No other computer
(D) Only the computer directly attached Process B
to the failed computer
43. What does the above diagram represent?

(A) Deadlock
(B) Round robin
(C) Interrupt
(0) Fetch-decode-execute cycle

GO ON TO THE NEXT PAGE

022150 I 0/CAPE 2018

 \
- I2 -
. of the fo\ \owing statements BEST
Wh1c_h distributed network configuration')
45 . descr1bes a .
· t the network
44. \1/hat is the name given o . nected All data and processing power are
. I11. I1 ach node ts con
topology tn w c e ( the (A) ated at one node. '
~ t I host computer that contra s \ oc .
to a cen ra Data and processing power can be
network? (B) scattered across ma~y nodes.
There are several pnnters on a
(A) Bus (C)
(B) Star network.
ers are on the network
(C) Ring Many US ·
(D)
(D) Centred

END OFTEST

IF YOU FINISH BEFORE TIME IS C~LLED, CHECK YOUR WORK ON THIS TES
 CANDIDATE PLEASE NOTE!
PRINT your name on the line below and retum 0 10
this booklet with your answer sheet. Failure to TEST CODE 02215
do so may result in dlsqualilicatioo.

FORM TP 2020205 L=::============= MAY/JUNE2020

CARIBBEAN EXAMINATIONS COUNCIL
CARIBBEAN ADVANCED PROFICIENCY EXAMINATION®
COMPUTER SCIENCE
UNIT 2 - Paper 01
1 hour 30 minutes

( 09 JUNE 2020 (a.m,LJ

READ THE FOLLOWING INSTRUCTIONS CAREFULLY.

I. This test consists of 45 items. You will have I hour and 30 minutes to answer them.

2. ln addition to this test booklet, you should have an answer sheet.

3. Do not be concerned that the answer sheet provides spaces for more answers than there are items
in this test.
4. Each item in this test has four suggested answers lettered (A), (B), (C), (D). Read each item you
are about to answer and decide which choice is best.
5. On your answer sheet, find the number which corresponds to your item and shade the space having
the same letter as the answer you have chosen. Look at the sample item below.

Sample Item
How many selection lines does an 8 x 1 multiplexer have? Sample Answer

(A) 1
(B) 2
(C) 3
0
0 (D) 8
<t
The best answer to this item is "3", so (C) has been shaded.

6. If you want to change your answer, erase it completely before you fill in your new choice.

7. When you are told to begin, tum the page and work as quickly and as carefully as you can. If you
cannot answer an item, go on to the next one. You may return to that item later.

8. You may do any rough work in this booklet.

9. Figures are not necessarily drawn to scale.

10. The use of silent, non-programmable calculators is allowed.

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO.

Copyright © 2019 Caribbean Examinations Council
All rights reserved .
022150 I 0/MJ/CAPE 2020
 -2-

Item 2 refers to the following di

Item 1 refers to the following arrays. . h h . agrams
...........- w h 1c s ow two items stored in a q ueue.
0 1 2 0 I 2
Initial State
123 I891 6 ] 123 1 so 1 89 1 FRONT REAR
t Array l t Array2
t t
H J ]
If Array 1 is implemented as a stack, and
1.
the top of the stack is indicated by the
arrow, which of the following sequences
i
of operations results in the stack being Final State
identical to Array 2? FRONT REAR
\
(A) POP, POP, POP PUSH, PUSH,
PUSH
t
J K
t
L I
(B) POP, PUSH, POP, PUSH
(C)
(D)
POP, PUSH, PUSH, PUSH
POP, PUSH
I
2. Which sequence of operations would
transform the queue from the initial state
to the final state shown above?

(A) DEQUEUE, ENQUEUE(K) , \

ENQUEUE(L)

(B) ENQUEUE(L), ENQUEUE(K),

DEQUEUE

(C) DEQUEUE , DEQUEUE ,

ENQUEUE(L), ENQUEUE(K), \
ENQUEUE(J)

(D) DEQUEUE , DEQUEUE ,

ENQUEUE(J), ENQUEUE(K),
ENQUEUE(L)

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2020
 -3-

Item 5 refers to the following scenario.

3. Which of the following statements is true
for both a linear search and a binary search?
A student is asked to implement a stack
using arrays. The student devises the
(A) On average they search half the list.
following operations and programming
(B) In the worst-case scenario they
statements, where 'data' refers to the array
search the entire list.
which stores the data, 'ptr' is the address of
(C) They can be used for searching an
the last element inserted into the stack and
ordered list.
'ele' is the data element being acted on.
(D) They require that the list be
ordered.
Operation:
push (ele)
4. In which of the following situations would pop ()
the implementation of a queue be MOST
appropriate? I. return ele
II. Ifptr ! = array_size
(A) Storing information when functions III. ptr = ptr + 1
are called IV. ptr= ptr-1
(B) Translating computer language V. ele = data [ptr]
(C) Evaluating reverse polish VI. ele = data [ptr + 1]
mathematical expressions VIL data [ptr] = ele
(D) Rescheduling CPU time for VIII. data [ptr - 1] = ele
processes using round robin IX. If (ptr! = 0)

5. Which ordering below gives a working

implementation for the 'push (ele)'
operation?

(A) II, I, Ill

(B) II, III, VH
(C) VII, TV, II
(D) Vlll, III, I

GO ON TO THE NEXT PAGE

022150 l 0/MJ/CA PE 2020
 -4-

6. Consider a circular queue, C, with a pointer refers to the following segment of

rear that references the location of the rear an incomplete algorithm for perfonning a
of the queue. The front pointer is set to zero linear search for target on an array list with
before any ADT operation. The following size n.
operations are performed on C.
I, II, III, IV represent the missing steps.
enqueue, enqueue, enqueue, dequeue,
dequeue, enqueue, enqueue, enqueue, count= 0
dequeue flag= false
REPEAT
Assuming that the locations range from O IF (list[count] = target) THEN
to 4, what is the value of the pointer front? I
END IF
(A) 0 II
(B) l UNTIL flag = true or III
(C) 2 IF flag= false THEN
(D) 3 IV
END IF

7. Figure I shows the state of a stack before

the pop operation is performed. Figure 2 8. Which of the following sets of steps would
shows the state after the pop operation complete the algorithm?
is performed. Which of the following
combinations of arrows correctly identifies (A) I - flag= true
the top of the stack structures? II - add I to count
Ill - count = n - 1
Figure I I IV - WRITE target not found
II
(8) I - flag = true
s -- III II - add 1 to count
B Ill - count = n
IV IV - WRITE target found
N -
(C) I - flag = true
II - add 1 to count
Ill - count= n -1
V TV - WRITE target found
Figure 2 ,

VI (D) I -flag= true

s - II - add l to count
B -
,
VII
UI-count= n
N -
,
Vlll IV - WRITE target not found

(A) I and V
(B) II and VI
(C) III and VII
(D) IV and VIII

02215010/MJ/CAPE 2020 GO ON TO THE NEXT PAGE

 -5-

Items 11-12 refer to the following list.

Item 9 refers to the following diagram.
Frog, ant, dog, grasshopper, bee, fish,
1 1 1 6 1 9 1 14 1 11 1 20 1 22 1 snake

9. The target value is 19. A binary search is 11. Which of the following lists will NOT be
employed. What is the second value to be obtained at any point while applying the
compared with the target value, 19? selection sort algorithm?

(A) 14 (A) Ant, frog, dog, grasshopper, bee,

(B) 17 fish, snake
(C) 20 (B) Ant, bee, frog, dog, grasshopper,
(D) 22 fish,snake
(C) Ant, bee, dog, fish, frog,
grasshopper, snake
Item lO refers to the following list. (D) Ant, bee, dog, grasshopper, frog,
fish, snake
A C E F G K L

12. Assume that the list is sorted. When

10. The target value is I. A binary search is searching the sorted list, which of the
employed. How many comparisons are following will be found MOST quickly
made before it can be concluded that the using binary search?
letter I does NOT appear in the list?
(A) Ant
(A) 2 (B) Grasshopper
(B) 3 (C) Fish
(C) 4 (D) Dog
(D) 7

13. A queue is implemented using a one-dimensional array. Which of the following actions BEST
describes the dequeue operation performed using the array?

(A) Return the last element in the array.

(B) Return the first element in the array.
(C) Check that the queue is not empty, then return the first element in the array and shift the
remaining elements up one place.
(D) Check that the queue is empty, then return the first element in the array and shift the
remaining elements up one place.

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2020
 -6-

Itern 14 refers to a segment of an incomplete Item 15 refers to the following segment of

algorithm for sorting an array list of size n an incomplete algorithm for performing a
using a bubble sort. selection sort on an array list in ascending
order.
REPEAT
flag= false FOR i = 0 to n-2 DO
FOR pos = I to n - I DO min= i
IF(list[pos] >list[pos + 11) THEN FORj = i + I to n-1 DO
I IF I THEN
II min= j
III END IF
IV SWAP list[i] and~ II
END IF END FOR
END FOR END FOR
subtract 1 from n
UNTIL flag = false or n = 1
15. Which sequence of the following steps
would correctly complete the algorithm?
14. Which of the following sequences would
complete the algorithm? (A) I - list[j] < list[min]
II - list[min]
(A) I - flag = true
11 - list[pos] = list[pos + 1] (B) I - list[j] > list[min]
III - temp = list[pos] II - list[ min]
IV - list[pos + I] = temp
(C) I - list[j] < list[min]
(B) I- temp= list[pos] II - list[j]
II - list[pos] = list[pos + 1]
III - list[pos + I] = temp (D) I - list[j] > list[min]
IV - flag = true II - list[j]
(C) I- flag = true
II - temp= list[pos] 16. Which of the following terms represent
III - list[pos + 1] = temp
types of software maintenance?
IV - list[pos] = list[pos + 1]
I. Adaptive
(D) I - temp= list[pos] II. Corrective
II - list[pos + 1] = temp III. Defective
m - list[pos] = list[pos + l]
IV - flag = true (A) I and II only
(B) I and III only
(C) II and III only
(D) I, II and III
 -7-

17. Which of the following outputs is a result 21. The MAIN goal of component testing is to
of using a CASE tool?
(A) expose faults in the components
(A) Cost/benefit analysis (B) demonstrate that the system meets
(B) Program definition its requirements
(C) Feasibility study (C) increase the supplier's confidence
(D) Prototype that the system meets its require-
ments
(D) test how one component interacts
18. Which of the following is LEAST helpful with others in the system
in an error message presented to a user?

(A) System-specific terms 22. Which of the following graphical tools is

(B) User-oriented language MOST suitable for showing how a software
(C) Description of the error development project and its subtasks
(D) Many options for recovery should be completed within a specified
timeframe?
19. A feasibility study
(A) Gantt chart
(A) describes a cost-effective means of (B) Decision tree
developing the proposed system (C) Dataflow diagram
(B) discusses whether the proposed (D) System flowchart
system will be cost effective
(C) is usually a lengthy and costly
process Items 23-24 refer to the following scenario.
(D) describes how current software and
hardware can be used to develop A car dealer uses a relational database to
the proposed system store data on the orders made by customers,
the types of cars in stock and payments
made.
20. Which of the following practices is NOT a
tenet of good programming style?
23. How many entities can be identified?
(A) Using comments for documentation
Appropriately spacing code (A) Two
(B)
Indenting where necessary (B) Three
(C)
Fixing logic errors (C) Four
(D)
(D) Five

24. What type of relationship exists between

the customer and payments?

(A) One to one

(B) One to many
(C) Many to one
(D) Many to many

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2020
 -8-

Which of the following is true of the

Which of the following attributes do NOT 29.
25. waterfall approach to the software
contribute to a system 's maintainability? development process?

(A) Useful documentation The following stage starts before

(B) Consistent, meaningful variable I.
the previous stage has finished .,
names The following stage should not start
(C) Pieces of code with well-defined II.
before the previous has finished. )
purpose Cascades from one phase of the
(D) Code that provides functionality Ill.
process to another.
not currently used, but which
will possibly be used in the
(A) 1 and II only
future
(8) I and Ill only
(C) II and III only
Which of the following describe the (D) 1, II and III
26.
contents of an entry in a data dictionary?

30. A small company with fewer than ten

l. The name of the element
employees is interested in replacing its
11. A list of related elements
The type and format of the element existing paper-based system with a software
HI.
application. Which of the following
is MOST appropriate for gathering
(A) land II only
(B) I and lII only information during analysis?
(C) 11 and III only
(D) I, II and Ill (A) Distributing questionnaires to
employees and clients of the
company
27. Which life cycle model approach is BEST (B) Researching company practices on
suited for a system with critical safety and the Internet
security requirements? (C) Interviewing priority clients of the
company
(A) Waterfall approach (D) Interviewing key people at the
(B) Formal transformation company
(C) Fountain approach
(D) Evolutionary development
31. Which of the following pieces of
information is NOT contained in a process
28. "The user's needs, the inputs, processing, control block?
outputs, storage and control capabilities
required to meet the needs" is a description (A) Amount of CPU time used
of (8) Estimated time to completion
(C) Job priority
(A) systems design (D) Process ID
(B) systems analysis
(C) functional requirements
(D) user interface, data and process
design

022150 I 0/MJ/CAPE 2020

GO ON TO THE NEXT PAGE

;·.-i-,·:
,,•i ,'f
•~':f;
_;,;:
 -9-

32. Which of the following phrases BEST describes 'paging'?

(A) The division of documents into smaller chunks

(B) The assignment of chunks of a program called frames to main memory called pages
(C) The assignment of chunks of a progam called frames to different secondary storage media
(D) The assignment of chunks of a program called pages to chunks of memory called frames

Item 33 refers to the cable shown in the following diagram.

Insulator
I
I
Iniler
I
Insulator
conductor
conductor

33. What type of cable is shown in the diagram?

(A) Coaxial
(B) Fibre optic
(C) Firewire
(D) Shielded twisted pair

34. The term 'firewire' refers to a
(A) type of cabling that allows com-
munication between computers
(B) software running on a computer
that protects it from external
attacks
(C) high-speed serial bus system
(D) type of computer virus
35. A webmaster has decided to design his
website offline and upload the various files
and graphics to the web server remotely.
Which of the following methods would be
BEST suited for providing the FASTEST
and MOST secure way of uploading the
data?
(A) FTP

l (8)
(C)
(D)
GSM
HTML
UML

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2020
 - 10 -

Item 36 refers to the following diagram.

Computer Modem Modem Computer

36. The diagram BEST illustrates

(A) routing
(B) addressing
(C) modulation and demodulation
(D) multiplexing and expandibility

37. Which of the following outcomes relates 39. Which of the following phrases BEST
to the use of virtual memory? describes ' paging ' ?

(A) Results in faster execution speeds (A) The division of documents into
(B) Creates an illusion that the computer smaller chunks
has more memory (B) The assignment of chunks of a
(C) Ensures that memory works faster program called frames to main
(D) Ensures that all programs are in memory called pages
memory (C) The assignment of chunks of a
progam called frames to different
38.
secondary storage media
Which IEEE standards can be employed (D) The assignment of chunks of a
when setting up a wireless LAN for
program called pages to chunks
wireless devices needing transfer rates
of memory caJled frames
GREATER than 20 mbps?

I. 802.11 a
Item 40 refers to the following diagram .
II. 802.11 b
III. 802. l l g

(A) I only
(B) II only
(C) l and II only
(D) I and III only

40. X and Y respectively represent a

(A) server and work station

(B) work station and node
(C) server and hub
(D) hub and node

022150 10/M J/CAP E 2020 GO ON TO THE NEXT PAG E

·y;:t'~
, .,...
. ' .:&.-, .
 - l1 -

41. Which of the following determines the 44. Which of the following is true about a
amount of time a running process gets process being scheduled with a non-pre-
to use the CPU when a round-robin emptive algorithm?
scheduling algorithm is used?
(A) It is placed at the top of the ready
(A) The order of arrival of the process queue if it has a higher priority
on the ready queue than all the processes already in
(B) The priority of the process the queue.
(C) The estimated running time of the (B) Once it enters the running state, it
process is allowed to run to completion
(D) The fixed time of the operating or until it yields the processor.
system (C) Once it enters the running state, it
is given a fixed amount of time
to use the CPU after which other
42. A running process initiates an input request processes get a chance to use the
to get data from the keyboard. Which of the CPU.
following state transitions will take place (D) Once it enters the running state, it is
when the data is made available? given a variable amount ohime
to use the CPU depending on its
(A) Ready to running priority.
(B) Running to ready
(C) Blocked to ready
(D) Blocked to running 45. In a network where the running applications
generate a significant amount of traffic,
which of the following devices would NOT
Item 43 refers to the following diagram. be suitable?

Process A
(A) Router
(B) Switch
(C) Hub
(D) Bridge

Process B

43. What does the diagram above represent?

(A) Deadlock
(B) Round robin
(C) Interrupt
(D) Fetch-decode-execute cycle

END OFTEST

IF YOU FINISH BEFORE TIME IS CALLED, CHECK YOUR WORK ON THIS TEST.

022150 I 0/MJ/CAPE 2020

 CANDIDATE – PLEASE NOTE!
PRINT your name on the line below and return
this booklet with your answer sheet. Failure to
do so may result in disqualification.
TEST CODE 02215010
FORM TP 2021205 MAY/JUNE 2021
CARIBBEAN E XAM I NAT I O N S COUNCIL
CARIBBEAN ADVANCED PROFICIENCY EXAMINATION®
COMPUTER SCIENCE

UNIT 2 – Paper 01
1 hour 30 minutes

8 JUNE 2021 (a.m.)

READ THE FOLLOWING INSTRUCTIONS CAREFULLY.

1. This test consists of 45 items. You will have 1 hour and 30 minutes to answer them.

2. In addition to this test booklet, you should have an answer sheet.

3. Do not be concerned that the answer sheet provides spaces for more answers than there are items
in this test.

4. Each item in this test has four suggested answers lettered (A), (B), (C), (D). Read each item you
are about to answer and decide which choice is best.

5. On your answer sheet, find the number which corresponds to your item and shade the space having
the same letter as the answer you have chosen. Look at the sample item below.

Sample Item

How many selection lines does an 8 × 1 multiplexer have?

Sample Answer

(A) 1 A B C D
(B) 2
(C) 3
(D) 8

The best answer to this item is “3”, so (C) has been shaded.

6. If you want to change your answer, erase it completely before you fill in your new choice.

7. When you are told to begin, turn the page and work as quickly and as carefully as you can. If you
cannot answer an item, go on to the next one. You may return to that item later.

8. You may do any rough work in this booklet.

9. Figures are not necessarily drawn to scale.

10. The use of silent, non-programmable calculators is allowed.

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO.

Copyright © 2020 Caribbean Examinations Council

All rights reserved.
02215010/MJ/CAPE 2021
 -2-

1. The diagrams below show three items stored Item 2 refers to the following scenario.
in a stack. Which sequence of operations
would transform the stack from the initial A student is asked to implement a stack using
state to the final state? arrays. The student develops the following
operations and programming statements.
Initial State
Operation:
push(ele)
pop ( )

C TOP I. return ele
A II. if ptr ! = array_size
B III. ptr = ptr + 1
IV. ptr = ptr - 1
Final State V. ele = data [ptr]
VI. ele = data [ptr + 1]
VII. data [ptr] = ele
VIII. data [ptr - 1] = ele.
IX. if (ptr! = 0)
A TOP
C In the programming statement, data refers
B to the array which stores the data, ptr is the
address of the last element inserted into the
(A) POP, POP, PUSH(C), PUSH(A) stack and ele is the data element being acted
(B) POP, POP, PUSH(A), PUSH(C) on.
(C) PUSH(A), PUSH(C), POP, POP
(D) P O P, P O P, P O P, P U S H ( A ) , 2. Which ordering below gives a working
PUSH(C), PUSH(B) implementation for the ‘POP ( )’ operation?

(A) IX, V, III, I

(B) II, V, IV, I
(C) VI, IV, II, I
(D) IX, V, IV, I

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 -3-

Item 3 refers to the following list of creatures.

frog, ant, dog, grasshopper, bee, fish, snake

3. Assume that the list is sorted. When searching the sorted list, which of the following will be found
the fastest using a binary search?

(A) ant
(B) dog
(C) fish
(D) grasshopper

Item 4 refers to the following diagrams.

4. Figure 1 below shows the state of a stack before the POP operation is performed. Figure 2 shows
the state after the POP operation is performed.

Which of the following combinations of arrows correctly identifies the top of the stack structures?

(A) I and V
(B) II and VI
(C) III and VII
(D) IV and VIII

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 -4-

5. Entries in a stack are ‘ordered’. What is the Items 7 refers to the following array.
meaning of this statement?
30 32 24 18 7 3
(A) The collection of stacks can be POSITION 0 1 2 3 4 5
sorted.
(B) Stack entries may be compared with 7. Using the selection sort algorithm, what
the ‘<’ operation. would the array above look like after
(C) The entries must be stored in a three passes?
linked list.
(D) There is a first entry, a second entry
(A) 3 7 18 24 32 30
and so on.
POSITION 0 1 2 3 4 5
6. Consider a circular queue, C, with a pointer
rear that references the location of the rear (B) 3 7 24 18 30 32
of the queue. The front pointer is set to zero
POSITION 0 1 2 3 4 5
before any ADT operation. The following
operations are performed on C.
(C) 3 7 18 30 32 24
enqueue, enqueue, enqueue, dequeue,
POSITION 0 1 2 3 4 5
dequeue, enqueue, enqueue, enqueue,
dequeue
(D) 3 7 18 24 30 32
Assuming that the locations range from 0
POSITION 0 1 2 3 4 5
to 4, what is the value of the pointer front?

(A) 0
(B) 1 8. Which of the following statements is
(C) 2 true?
(D) 3
(A) The bubble sort is very simple and
therefore very efficient.
(B) The selection sort performs the
same regardless of the size of
the list.
(C) The bubble sort performs less
efficient than selection sort on
longer lists.
(D) The selection sort starts by finding
the maximum element in the list
and swapping it with the middle
element.

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 -5-

Item 9 refers to the following diagram Item 10 refers to a segment of an algorithm

which shows three items stored in a stack for performing a linear search for target on
and three operations. an array with size n.

count = 0
flag = false
REPEAT
IF (list[count] = target) THEN
I
END IF
II
9. Which of the diagrams below gives the state UNTIL flag = true or III
of the stack after the operations listed are IF flag = false THEN
performed in order? IV
END IF

10. Which of the following sequences of steps

would complete the procedure?

(A) I – flag = true

II – add 1 to count
III – count = n – 1
IV – WRITE target not found

(B) I – flag = true

II – add 1 to count
III – count = n – 1
IV – WRITE target found

(C) I – flag = true

II – add 1 to count
III – count = n
IV – WRITE target not found

(D) I – flag = true

II – add 1 to count
III – count = n
IV – WRITE target found

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 -6-

Item 11 refers to the following list. Item 13 refers to a segment of an incomplete

algorithm for sorting an array list of size
A C E F G K L n, in ascending order, using a bubble sort.

11. The target value is I. A binary search is REPEAT

employed. How many comparisons are made flag = false
before it can be concluded that the letter I FOR pos = 1 to n – 1 DO
does NOT appear in the list? IF(list[pos]>list[pos + 1]) THEN
I
(A) 2 II
(B) 3 III
(C) 4 IV
(D) 7 END IF
END FOR
subtract 1 from n
12. A queue is implemented using a one- UNTIL flag = false or n =1
dimensional array. Which of the following
actions BEST describes the dequeue
operation performed using the array? 13. Which of the following sequences would
complete the algorithm?
(A) Return the last element in the array.
(B) Return the first element in the array. (A) I – flag = true
(C) Check that the queue is not empty, II – list[pos] = list[pos + 1]
then return the first element in III – temp = list[pos]
the array and shift the remaining IV – list[pos + 1] = temp
elements up one place.
(D) Check that the queue is empty, (B) I – temp = list[pos]
then return the first element in II – list[pos] = list[pos + 1]
the array and shift the remaining III – list[pos + 1] = temp
elements up one place. IV – flag = true

(C) I – flag = true

II – temp = list[pos]
III – list[pos + 1] = temp
IV – list[pos] = list[pos + 1]

(D) I – temp = list[pos]

II – list[pos + 1] = temp
III – list[pos] = list[pos + 1]
IV – flag = true

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 -7-

Item 14 refers to the following segment of 16. Software evolution involves

an algorithm for performing a selection sort
on an array list in ascending order. (A) modifying software to satisfy
changes in customer and market
FOR i = 0 to n – 2 DO requirements
min = i (B) automatically adapting software
FOR j = i + 1 to n – 1 DO to changing customer needs and
IF I THEN wants
min = j (C) developing new software from an
END IF existing system
SWAP list[i] and II (D) improving software by addressing
END FOR bugs
END FOR

17. Which of the following are NOT examples

14. Which of the following sequences of steps of functional requirements?
would correctly complete the algorithm?
I. Platform constraints
(A) I – list[j] < list[min] II. Response times
II – list[min] III. Reliability

(B) I – list[j] > list[min] (A) I and II only
II – list[min] (B) I and III only
(C) II and III only
(C) I – list[j] < list[min] (D) I, II and III
II – list[j]

(D) I – list[j] > list[min] 18. Which of the following graphical tools is
II – list[j] MOST suitable for showing how a software
development project and its subtasks
should be completed within a specified
15. In which of the following situations would timeframe?
the implementation of a queue be MOST
appropriate? (A) Data flow diagram
(B) System flowchart
(A) Translating computer language (C) Decision tree
(B) Storing information when functions (D) Gantt chart
are called
(C) Evaluating reverse polish
mathematical expressions
(D) Rescheduling CPU time for
processes using round robin

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 -8-
19. The evolutionary approach is being used
to develop a software application.
Which of the following are types of
evolutionary development?
I. Exploratory development
II. Throw-away prototyping
III. Rewind approach
(A) I and II only
(B) I and III only
(C) II and III only
(D) I, II and III
20. Which of the following attributes does NOT
contribute to a system’s maintainability?
(A) Useful documentation
(B) Consistent, meaningful variable
names
(C) Pieces of code with well-defined
purpose
(D) Code that provides functionality
not currently used, but which
will possibly be used in the
future
21. Which of the following are constructs of
an entity–relationship diagram?
(A) Entity, relationship
(B) Entity, relationship, flow
(C) Entity, attribute, relationship
(D) Entity, attribute, relationship, flow
02215010/MJ/CAPE 2021
22. A company is interested in replacing
its current software system with a new
system. The company is located in various
Caribbean territories with many employees.
Which approach is MOST appropriate for
gathering information during the analysis
phase?
(A) Prototyping
(B) Distributing questionnaires at each
branch
(C) Observation of practices at a few
branches
(D) Interviews with key people at a few
branches
23. Which of the following is NOT a tenet of
good programming style?
(A) Using comments for documentation
(B) Appropriately spacing code
(C) Indenting where necessary
(D) Fixing logic errors
24. Which of the following design processes
refers to the identification of subsystems
and their relationships?
(A) Architectural
(B) Data structure
(C) Component
(D) Interface
25. The software process model defined by its
approach of refining an initial system based
on user input is the
(A) waterfall approach
(B) formal transformation
(C) evolutionary development
(D) reuse-oriented approach
GO ON TO THE NEXT PAGE
 -9-

26. Which life cycle model approach is BEST
suited for a system with critical safety and
security requirements?
(A) Waterfall approach, since software
is well structured
(B) Evolutionary development, since
any security problems can be
easily rectified by creating a new
system
(C) Fountain approach, since any
security problems can be easily
rectified by further iterations
(D) Formal transformation, since it can
be proven that the system fulfils
requirements
Item 29 refers to the following scenario.
A car dealer uses a relational database to
store data on the orders made by customers,
the types of cars in stock and payments
made.
29. How many entities can be identified?
(A) Two
(B) Three
(C) Four
(D) Five
30. Which of the following describe the
contents of an entry in a data dictionary?

27. A small company with fewer than ten
employees is interested in replacing
its existing paper-based system with
a software application. Which of the
following is MOST appropriate for
gathering information during analysis?
(A) Distributing questionnaires to
employees and clients of the
company
(B) Researching company practices on
the Internet
(C) Interviewing priority clients of the
company
(D) Interviewing key people at the
company
28. Which of the following statements is true
of data flow diagrams?
I. The name of the element
II. A list of related elements
III. The type and format of the element
(A) I and II only
(B) I and III only
(C) II and III only
(D) I, II and III
31. An ‘interrupt’ may BEST be described as
a
(A) period in time when the CPU does
nothing
(B) signal sent to the CPU for attention
(C) time when a process is blocked
(D) signal sent when a process is
complete

(A) Data cannot be moved directly

from one store to another.
(B) A data flow may flow in both
directions between two symbols.
(C) A process can have only one output.
(D) A data flow to a store means
retrieve or use.

GO ON TO THE NEXT PAGE

02215010/MJ/CAPE 2021
 - 10 -
32. A client is interested in setting up a wireless
LAN for his place of business. Very high
data rates (30 Mbps–40 Mbps) are critical
to the network applications of this business.
Which standard should be employed,
802.11a or 802.11b?
(A) 802.11a, since it can support the
desired data rates.
(B) 802.11b, since it can support the
desired data rates.
(C) 802.11a or 802.11b will give
similar performance since these
standards do NOT differ in data
rates.
(D) Neither 802.11a nor 802.11b since
they do NOT support transmission
over a large distance.
33. Which of the following phrases BEST
describes ‘paging’?
(A) The division of documents into
smaller chunks
(B) The assignment of chunks of a
program called frames to main
memory called pages
(C) The assignment of chunks of a
program called pages to chunks
of memory called frames
(D) The assignment of chunks of a
progam called frames to different
secondary storage media
34. A webmaster has decided to design his
website offline and to upload the various
files and graphics to the web server
remotely.
Which of the following would be BEST
suited for providing the fastest and MOST
secure method of uploading the data?
(A) FTP
(B) GSM
(C) UML
(D) HTML
02215010/MJ/CAPE 2021
35. Which of the following statements
BEST describes a distributed network
configuration?
(A) Many users are on the network.
(B) There are several printers on a
network.
(C) All data and processing power are
located at one node.
(D) Data and processing power can be
scattered across many nodes.
36. Which of the following pieces of informa-
tion is NOT contained in a process control
block?
(A) Amount of CPU time used
(B) Estimated time to completion
(C) Job priority
(D) Process ID
37. A running process initiates an input request
to get data from the keyboard. Which of the
following state transitions will take place
when the data is made available?
(A) Ready to running
(B) Blocked to ready
(C) Running to ready
(D) Blocked to running
38. Which of the following determines the
amount of time a running process gets
to use the CPU when a round-robin
scheduling algorithm is used?
(A) The priority of the process.
(B) The estimated running time of the
process.
(C) The time is fixed by the operating
system.
(D) The order of arrival of the process
on the ready queue.
GO ON TO THE NEXT PAGE
 - 11 -
39. The term ‘firewire’ refers to a
(A) type of cabling that allows
communication between
computers
(B) software running on a computer
that protects it from external
attacks
(C) high-speed serial bus system
(D) type of computer virus
40. If a node fails in a ring network, how many
other stations are affected?
(A) Half of the stations
(B) All other stations
(C) No other computer
(D) Only the computer directly attached
to the failed computer
41. Which layer of the OSI model handles data
transmission between host computers?
(A) Network layer
(B) Transport layer
(C) Presentation layer
(D) Application layer
02215010/MJ/CAPE 2021
42. Which of the following outcomes relates
to the use of virtual memory?
(A) Results in faster execution speeds
(B) Ensures that memory works faster
(C) Creates an illusion that the computer
has more memory
(D) Ensures that all programs are in
memory
43. In a network where the running applications
generate a significant amount of traffic,
which of the following devices would NOT
be suitable?
6y
(A) Hub
(B) Switch
(C) Router
(D) Bridge
GO ON TO THE NEXT PAGE
 - 12 -

44. Which of the following statements is true Item 45 refers to the following diagram.
about a process being scheduled with a
non-preemptive algorithm?

(A) It is placed at the top of the ready

queue if it has a higher priority
than all the processes already in
the queue.
(B) Once it enters the running state, it
is allowed to run to completion 45. What does the diagram above represent?
or until it yields the processor.
(C) Once it enters the running state, it (A) Deadlock
is given a fixed amount of time (B) Interrupt
to use the CPU after which other (C) Round robin
processes get a chance to use the (D) Fetch-decode-execute cycle
CPU.
(D) Once it enters the running state, it is
given a variable amount of time
to use the CPU depending on its
priority.

END OF TEST

IF YOU FINISH BEFORE TIME IS CALLED, CHECK YOUR WORK ON THIS TEST.

02215010/MJ/CAPE 2021
 DO
NO
W T
RI
TE
TH ON
IS
PA
GE
 DO
NO
W T
RI
TE
TH ON
IS
PA
GE
 DO
NO
W T
RI
TE
TH ON
IS
PA
GE
 CANDIDATE’S RECEIPT

INSTRUCTIONS TO CANDIDATE:

1. Fill in all the information requested clearly in capital letters.

TEST CODE: 0 2 2 1 5 0 1 0

SUBJECT: COMPUTER SCIENCE − UNIT 2 − Paper 01

PROFICIENCY: ADVANCED

REGISTRATION NUMBER:

FULL NAME: ________________________________________________________________

(BLOCK LETTERS)

Signature: ____________________________________________________________________

Date: ________________________________________________________________________

2. Ensure that this slip is detached by the Supervisor or Invigilator and given to you when you
hand in this booklet.

3. Keep it in a safe place until you have received your results.

INSTRUCTION TO SUPERVISOR/INVIGILATOR:

Sign the declaration below, detach this slip and hand it to the candidate as his/her receipt for this booklet
collected by you.

I hereby acknowledge receipt of the candidate’s booklet for the examination stated above.

Signature: _____________________________
Supervisor/Invigilator

Date: _________________________________