0795/1/2022

Computer
Science A/l
SOl)Tn WEST REGIONA
L MOCK EXAMINATION
-
T TWIWR
'
Pedagogic Inspe^
^•
ctoral
« /
cs
"I'
and
— .-
- GEN
the Sob
,n
ERAL EDUCATION
coU bo,lbo« « <> Rcpowf
cc, Tether, Assoc
"*, *non ICTA).Subject Code
0795
Paper Number
I
•• I

CANDIDATE NAME
• •••
Subject Title
CANDIDATE NUMBER
•• • •••••• |# t

COMPUTER SCIENCE
CENTRE NUMBER

DATE
ADVANCED LEVEL 04/04/2022
( MORNING )

Time Allowed: One hour thirly minutes

INSTRUCTIONS TO CANDIDATES:
1. USE A SOFT HB PENCIL THROUGHOUT THIS EXAMINA
TION
2. DO NOT OPEN THIS BOOKLET UNTIL YOU ARE TOLD
TO DO SO
Before the Examination begins:

4. Insert the mformalioo required in the spaces provided above.

-
3. Cbocl that this question booklet IS headed “ Ad vanerd IJtvrl 0795
.
COMPUTCR Srieticr, Paper 1"

5. Without opening the booklet, pull out the answer sheet carefully from inside the front cover of this
booklet l ake care
that you do not crease or fold the answer sheet or make any marks on it other than those asked for
in these instructions
6. Insert the information required in the spaces provided on the answer sheet using your HB pencil
:
Candidate Name, Centre Number, Candidate Number, Subject Code Number and Paper Number.
How to answer questions In this examination:
7. Answer ALL (he 50 questions m this examination All questions carry equal marks.
. -
8 Non programmable calculator a are al lowed.
.
9. For each question there are four suggested answers A, B, C, and D Decide which unswer is cancel Find
the number ol
the question on the Answer sheet and draw a horizontal line across the letter to join the square brackets
*

for the answer

you have chosen For example, if C is your correct answer , mark C as shown below:

( *] ( •) W [ •)
.
10. Mark only one answer for each question. If you mark more than one «mw you will score zero for that question.
If you
change your mind about an answer, erase the first mark carefully , and then mark your new answer
*
11 Avoid spending much time on any question. If you find a question difficult, move to the mat question. You can
come
back to this question later
.
12. Do all rough work m thu booklet uang, where necessary the blank spaces in the question booklet .
13. Mobile phones arc NOT ALLOWED in the examination room
14. You must no* take this booklet and answer sheet cut of the examination room All question booklets and answer
sheets
will be collected at the end of the examination

entt
^^ tp vMna/escows
^ ^ uaxj
1

Scanned by TapScanner
%

I The maximum capacity of memon • vompuui K Which of the following describes the di|],
can use in dotcimtncil I* Ihe M /C ol
' |>ctwccn hub nml a witch n
a
* ,
A Control bu« communication? ^
B Data bin A hub transmit!only analog signal WL , .
A
,.
^
(' AddlCS* hll« n switch transmits both analog and di
l) PCI bus ngoals.
It A huh operates on the data link l# VCf ,
! Which addicssing mode execute its instiuction
*
within the CPU without the need to reference
the OSI reference model w hile a
Hitch •
operates on the physical layer
tiicuioix for operands?
A Relative mode c Aii pons on a huo m ,c in the same col|iUfM)
It Helmet mode
domain while cveiy poll on a switch u n ,
a separate collision domain
C Direct Mode
L) All ports on a huh are in the ume
D Immediate Mode
broadcast domain while cvay po,t on »
3 A CPU scheduling algonthni dcteinuncs an switch is m a separate broadcast domain
order for the execution of its scheduled
processes Given k processes to be scheduled in
one processor, how many ddVcrcnl possible Wliich of the following registers holds the
ways can these processes be scheduled• > address of the instruction to be executed next ?
A kt A Status register
B
C
-
(k l)l
kl/(k -l) t
H
C
Instruction register
Memory a ldrcss register
D k(k - tV2 I) Program counter
I

4 In Structured Query Language, the commands 10. One way of dealing with deadlocks is to ensure
SELECT, INSERT and UPDATE can be that the request for any resource is only granted
classified as if the resulting state of (he system docs not cause
A TCL commands a deadlock This method of dealing with
B DCL commands deadlocks is known as
C DDL commands A Deadlock prevention
D DML commands B Deadlock avoidance
C Deadlock detection
5 A situation that exists between two tables in a D Mutual exclusion
relational database when one table has a foreign
key that references the primary key of the other II ( onsidcr that n
table is known as:
elements arc to be sorted. What
is the worst ease time complexify of BubNc
A Aggregation sort?
B Normalisation A 0( 1)
C Relationship
B
D 0(logn)
Inheritance
C 0(n)
D (Xn* )

6 Which Boolean identity is described by the

equation A (B
A Commutauve law*
-
+ C) A B + A *C?
12. 1 o which of the following do internal nodes in fl
binary expression tree correspond?
B Distributive law
C Associative law A Operands
D Idempotent law B Operators
Both operators and operands
O Pointers.
7. When content it multicast in a local area
network, it is roccivcd by:
13. An ASCII character is said to be coded in o c
A
B
The serv er only
The requesting device only byte. How many bits arc needed to code the "
C Some devices in the nctwort word within quotes "CGCEB*?
D All the devices in the network A 42.
B 6.
C 40.
I> 68 .
CmJ/ KPI/ SWATKT ,
Page 2 of 5 \
>

EMM
Scanned by TapScanner
14 In which phase of the system development 21 . A piece of
process is documentation aimed t determining software nrv**iki V ,
what the ay stem must do? • meant to
*pecifications
facihuic nCOmplcte
*
- <»«*» •»»
A Analyna customer is
between
*°n *"
c producer and
B Design A Uacr interface
C Investigation B Sy em prototype
D Construction
* System model

IS Which of the following is a testing technique

^ Pvmdo code
which is used to demonstrate that each program 22 . If » new device, such -
a p , , ,,
function is operational? , ^ 0T
^ tCrfKWh
P° Ch «o
A System testing
B Unit testing A
C Whitebox testing Patch
B Driver
L> Blackbox testing C Compiler
16. Which of the following bitwise Boolean ^ Device controller
functions can be used to find the two 's 23. What IK the number of companion
complement of a number0 done for a binary search in a * that will be
A Bitwise OR sorted array of n
elements if the element sought is NOT in the
B Bitwise NOT list?
C Bitwise AND A n
D Bitwise XOR B n/ 2
C log n
17 . Which of the following devices is best suited for D I + log n
converting computer generated signals into a
form that is suitable for transmission on a 24. Which of the following is not caused by the
telephone line? execution of a return instruction from a routine0
A Modem A Transfer control to the caller routine .
B Router B Load the PC with a popped value from the
C Multiplexer stack
D Network adapter C Resume program execution from the point
where branching occurred.
18. -
In a binary' search tree, the in order successor of
a given node n is the node with :
D CPU saves the return address on the top of
a stack .
A Minimum value in the right subtree of n
B Minimum value in the left subtree of n 25. What is the smallest number that can be
C
D
Maximum value in the right subtree of n
Maximum value m the left subtree of n
-
represented in 8 bit two’s complement0
A 01111111
B 11000000
19 . Which of the following is a data transmission C 10000000
method where many channels are used at the D 11000001
same time; achieved by using a range of
frequencies? 26. When implementing a database, creating a one-
A Parallel transmission to-mam relationship between two tables can be
B Synchronous transmission done by adding the primary key of one table into
C Baseband transmission the related table as a(n)
D Broadband transmission A Composite key
B Foreign key
20. The number of address lines required to address C Candidate key
a memory of 256K is: D Alternate key
A 15 lines
B 16 lines 27. The type of programming language that
C 18 lines associates data and operation together is known
D 14 lines as:
- A
B
C
Procedural
Logic
Functional
D Object-oriented

© mU/ M / SWA TKT/ CSC079S/ P1/ MOOC 2022 3/5

Scanned by TapScanner
%
2» Wh,«h or *. »1 « r? 35
a computer'
..
Which of the Ml wing i » not
function of RAM
e winch *TT»
in
network to determin
to. on a A It holds program! and data
transmission should he delivered that are in
current use by the processor
particular computer " I) It holds data that has been procetaed
A Port mimbei and
wailing to be sent to a storage
R Protocol device
Domain name C It hold* frequently requested
C quick access by the CPU
data for
D IP address
D It holds the boot or start -up program
uTt* rwulTof the postfix expnmtm 3 10 which is run when the computet
^ ^•
T
}+
A
?
35
switched on
is

B 53 36. Parity bits arc used for which of the

following
purposes'
C 45
A
’
Error detection
D 65
B Error correction
30 The collection of related datTclemcnts possibly C Faster transmission
of different types stored as a single unit is a( n): D Synchronisation
A Record
R Anay 37 If a magnetic disk contains 4 tracks of 16
sectors
C List per side , and each sector can hold 8 bytes
of
D Tree data , what is the exact capacity of the disk
in
kilobytes?
31. Ihc SUM output of a half adder is obtained by A 05KB
which of the following gates? B 1.4 KB
A AND C l KB
B OR D 2 KB
C XOR
D NAND 38. A bus feature that facilitates the discovery of a
hardware component in a system without the
32 When an IF statement is used within another IF need for physical device configuration is known
statement this is called as:
A Assignment A Pairing
B Nesting B Compatibility
C Selection C Connectivity
D Looping D Plug n play
33. A character set uses 7 bits to encode each 39. One address instruction formats are
character. What is the maximum number of characteristic to which of the following CPU
characters that can be represented in this organisations?
character set? A RISC
A 56 characters B CISC
B 49 characters
C Load/Store
C 128 characters D Accumulator
D Any number of characters
40. The memory Unit which communicates directly
34. Whit is the purpose of a PS/2 port on a
with the CPU is called the:
computer
9
A A Direct memory
To connect a monitor to the computer
B B Virtual memory
To connect a printer to the computer
To connect a projector to the computer C Main memory
D 1o connect a key board to the computer D Auxiliary' memory

41. When higher versions of an operating system arc

written so that programs designed for earlier
versions con still be run. this is known as:
A Portability
B Upgradability
C Interoperability
D Compatibility

c mvm/ MfAna/acom/nAtoat 2022 4/s

Scanned by TapScanner
 42 "^Lncnt
'" need
*
a p» gc
and there
occurs ,n
no available frame
is

to be evicted in order to create space

.
® cmar
.> 4
* Which of the following n
queue data
A They structures ?
NOT TRUE about
ffleh
„
of the
selected
following is true about the
for eviction if the
page
LRU
arc also
B They store called FIFO lists
dau in a
Items are inserted atlinear fashion
si**selected
*
A
rh is
pouc *
The
) «
page must not be a dim -
C
D
from the head
They can be used to
the tail
and removed

page expressions evaluate anthmetic

B The selected page must be the first to
ini\T in memory . 49. Which of the following correspond to
c The selected page must hare not been
criteria which any solution the three
used for the longest time in the past . problem must satisfy to the critical section
The selected page must have the least ?
D A Request, use and release
count of number of omes used . B Entry- section, critical section,
and exit
section
41. Gv = 2 tail birary tree with In + | nodes
,
where n is the number of nodes this hinarv tree
C Mutual excluson. progress, and bounded
waiting
contains D Mutual exclusion, no pre-emption, and
A n leare nodes -
circular wail
B n non -leaf nodes
C /t - 1 leaf nodes 50. Consider the pseudocode fragment below where
D -
/1 1 non leaf nodes- % is the modulo arithmetic operator

44 Which of the following provides an interface

between a user process and the operating
For k
-
If k I 3 1 Then *
-
0 To N l Starp 2

system0 Print ( k )
A Kernel SnrfXf
B interrupts Naxt k
C
D
System Calls
Scheduling algorithm -
For N 20, what is the expected output of the
pseudocode fragment above?
.
45. A variable which is visible only in the A 4, 0 10 16
function io which it is defined is called: B ..
0 6 12, 18
A Actual parameter C 1. 4, 7, 10. 13. 16. 19
B Formal parameter D 0, 2. 4. 6. 8. 10. 12. 14. 16. 18
C Global variable
D Local variable

46. The next binary number in the sequence 0000.

.
0001, 0001 0010, 0011.0101 is: STOP
A 1000
B 1010 GO BACK AMD CHECK YOUR WORK
C 0100
D 0111

When the primary key o f a relation is a

determinant far another attribute, which in turn
u a determinant for a third attribute this situation
is called
A
B
-
Multi level dependency
Transitive dependency
Partial dependency
D -
Multi valued dependency

5/5
© r U/ Rfi/ SWA TKT CSC079S/ P1/ MOCX 2022
* /

Scanned by TapScanner