Subject : Operating Systems with Unix (MC0070)<br><br>Provided by <a href='http:

//www.programmer2programmer.net'>www.programmer2programmer.net</a><br><br><b><u>
PART A</u></b><br><br><table border='0' width='600' id='table1_0_0'><tr><td widt
h='41' align='left' valign='top'><b>Q.1 </b></td><td width='749' align='left' va
lign='top' colspan='2'>IN BUFFERING HOW MANY WAYS ARE THERE IN QUEUE IMPLEMENTIO
N</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34
' align='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='
top'>TWO
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width
='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left' vali
gn='top'>THREE</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td>
<td width='34' align='left' valign='top'><b>C) </b></td><td width='711' align='l
eft' valign='top'>FOUR</td></tr><tr><td width='41' align='left' valign='top'>&nb
sp;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711'
align='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' w
idth='600' id='table1_0_1'><tr><td width='41' align='left' valign='top'><b>Q.2 <
/b></td><td width='749' align='left' valign='top' colspan='2'>HOW MANY CONDITION
S DOES DEADLOCK SITUATION CAN ARISE SIMULTANEOUSLY IN A SYSTEM</td></tr><tr><td
width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' vali
gn='top'><b>A) </b></td><td width='711' align='left' valign='top'>TWO </td></tr>
<tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='le
ft' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>THREE<
/td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>C) </b></td><td width='711' align='left' valign='to
p'>FOUR </td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td w
idth='34' align='left' valign='top'><b>D) </b></td><td width='711' align='left'
valign='top'>FIVE</td></tr></table><table border='0' width='600' id='table1_0_2'
><tr><td width='41' align='left' valign='top'><b>Q.3 </b></td><td width='749' al
ign='left' valign='top' colspan='2'>WHEN TWO OR MORE PROCESSES ARE WAITING INDEF
INITELY FOR AN EVENT THAT CAN ONLY BE CAUSED BY ONE OF THE WAITING PROCESSES THE
N WHICH STATE OCCURS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' al
ign='left' valign='top'>DEADLOCK STATE
</td></tr><tr><td width='41'
align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><
b>B) </b></td><td width='711' align='left' valign='top'>WAITING STATE</td></tr><
tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='lef
t' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>BLOCKED
STATE
</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711'
align='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0'
width='600' id='table1_0_3'><tr><td width='41' align='left' valign='top'><b>Q.4
</b></td><td width='749' align='left' valign='top' colspan='2'>PATH NAMES CAN BE
CLASSIFIED AS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td>
<td width='34' align='left' valign='top'><b>A) </b></td><td width='711' align='l
eft' valign='top'>ABSOLUTE PATH NAMES </td></tr><tr><td width='41' align='left'
valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td
><td width='711' align='left' valign='top'>RELATIVE PATH NAMES</td></tr><tr><td
width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' vali
gn='top'><b>C) </b></td><td width='711' align='left' valign='top'>BOTH A AND B
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;
</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' ali
gn='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' widt
h='600' id='table1_0_4'><tr><td width='41' align='left' valign='top'><b>Q.5 </b>
</td><td width='749' align='left' valign='top' colspan='2'>HOW MANY COMMON STRAT
RGIES IS USED TO SELECT A FREE HOLE FROM THE SET OF AVAILABLE HOLES</td></tr><tr
><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left'
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>TWO</td><
/tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align
='left' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>TH
REE</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='

34' align='left' valign='top'><b>C) </b></td><td width='711' align='left' valign

='top'>FOUR</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td
width='34' align='left' valign='top'><b>D) </b></td><td width='711' align='left
' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' width='600'
id='table1_0_5'><tr><td width='41' align='left' valign='top'><b>Q.6 </b></td><td
width='749' align='left' valign='top' colspan='2'>ALLOCATE THE FIRST HOLE THAT
IS BIG ENOUGH IS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</t
d><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' align=
'left' valign='top'>FIRST FIT
</td></tr><tr><td width='4
1' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'
><b>B) </b></td><td width='711' align='left' valign='top'>BEST FIT</td></tr><tr>
<td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left'
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>WORST FIT
</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' a
lign='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' wi
dth='600' id='table1_0_6'><tr><td width='41' align='left' valign='top'><b>Q.7 </
b></td><td width='749' align='left' valign='top' colspan='2'>WHICH OF THE FOLLOW
ING INCLUDES THE AMOUNT OF CPU AND REAL TIME USED, TIME LIMITS, ACCOUNT NUMBERS,
JOB OR PROCESS NUMBERS, AND SO ON</td></tr><tr><td width='41' align='left' vali
gn='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>A) </b></td><td
width='711' align='left' valign='top'>CPU REGISTERS
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34
' align='left' valign='top'><b>B) </b></td><td width='711' align='left' valign='
top'>CPU SCHEDULING INFORMATION</td></tr><tr><td width='41' align='left' valign=
'top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td wid
th='711' align='left' valign='top'>ACCOUNTING INFORMATION </td></tr><tr><td widt
h='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='
top'><b>D) </b></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE<
/td></tr></table><table border='0' width='600' id='table1_0_7'><tr><td width='41
' align='left' valign='top'><b>Q.8 </b></td><td width='749' align='left' valign=
'top' colspan='2'>THE BINDING OF INSTRUCTIONS AND DATA TO MEMORY ADDRESSES CAN
BE DONE AT ANY STEP ALONG WHICH OF THE FOLLOWING WAYS</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>A) </b></td><td width='711' align='left' valign='top'>COMPILE TIME
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td
width='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left
' valign='top'>LOAD TIME</td></tr><tr><td width='41' align='left' valign='top'>&
nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711
' align='left' valign='top'>EXECUTION TIME
</td></tr><tr><td wid
th='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign=
'top'><b>D) </b></td><td width='711' align='left' valign='top'>ALL OF THE ABOVE<
/td></tr></table><table border='0' width='600' id='table1_0_8'><tr><td width='41
' align='left' valign='top'><b>Q.9 </b></td><td width='749' align='left' valign=
'top' colspan='2'>SWITCHING THE CPU TO ANOTHER PROCESS REQUIRES SAVING THE STATE
OF THE OLD PROCESS LOADING THE SAVED STATE FOR THE NEW PROCESS. THIS TASK IS KN
OWN AS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td widt
h='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left' val
ign='top'>CONTEXT SWITCH
</td></tr><tr><td width='41' ali
gn='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B)
</b></td><td width='711' align='left' valign='top'>PROCESS CREATION</td></tr><t
r><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left
' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>MEDIUM T
ERM SCHEDULING
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;<
/td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' alig
n='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' width
='600' id='table1_0_9'><tr><td width='41' align='left' valign='top'><b>Q.10 </b>
</td><td width='749' align='left' valign='top' colspan='2'>WHICH OF THE FOLLOWIN
G METHOD REQUIRES EACH FILE TO OCCUPY A SET OF CONTIGUOUS BLOCKS ON THE DISK</td
></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' ali

gn='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>

CONTIGUOUS ALLOCATION </td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711'
align='left' valign='top'>LINKED ALLOCATION</td></tr><tr><td width='41' align='
left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b
></td><td width='711' align='left' valign='top'>INDEXED ALLOCATION
</td
></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' ali
gn='left' valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>
NONE OF THE ABOVE</td></tr></table><table border='0' width='600' id='table1_0_10
'><tr><td width='41' align='left' valign='top'><b>Q.11 </b></td><td width='749'
align='left' valign='top' colspan='2'>LOGICAL MEMORY IS BROKEN INTO FIXED SIZE B
LOCKS CALLED AS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td
><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' align='
left' valign='top'>PAGES</td></tr><tr><td width='41' align='left' valign='top'>&
nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711
' align='left' valign='top'>FRAMES</td></tr><tr><td width='41' align='left' vali
gn='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td
width='711' align='left' valign='top'>LOGICAL</td></tr><tr><td width='41' align=
'left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </
b></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td></tr></ta
ble><table border='0' width='600' id='table1_0_11'><tr><td width='41' align='lef
t' valign='top'><b>Q.12 </b></td><td width='749' align='left' valign='top' colsp
an='2'>IF PREEMPTION IS REQUIRED TO DEAL WITH DEADLOCKS THEN HOW MANY ISSUES NEE
D TO BE ADDRESSES</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</
td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' align
='left' valign='top'>TWO </td></tr><tr><td width='41' align='left' valign='top'>
&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='71
1' align='left' valign='top'>THREE</td></tr><tr><td width='41' align='left' vali
gn='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td
width='711' align='left' valign='top'>FOUR</td></tr><tr><td width='41' align='le
ft' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b><
/td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td></tr></table
><table border='0' width='600' id='table1_0_12'><tr><td width='41' align='left'
valign='top'><b>Q.13 </b></td><td width='749' align='left' valign='top' colspan=
'2'>WHICH OF THE FOLLOWING INFORMATION INCLUDES A PROCESS PRIORITY, POINTERS TO
SCHEDULING QUEUES, AND ANY OTHER SCHEDULING PARAMETER</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>A) </b></td><td width='711' align='left' valign='top'>CPU REGISTERS</td></tr>
<tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='le
ft' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>CPU SC
HEDULING INFORMATION</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711' al
ign='left' valign='top'>MEMORY MANAGEMENT
</td></tr><tr><td
width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' val
ign='top'><b>D) </b></td><td width='711' align='left' valign='top'>ACCOUNTING IN
FORMATION</td></tr></table><table border='0' width='600' id='table1_0_13'><tr><t
d width='41' align='left' valign='top'><b>Q.14 </b></td><td width='749' align='l
eft' valign='top' colspan='2'>WHICH DIRECTORY ALLOWS USER TO CREATE SUBDIRECTORI
ES TO ORGANISE THEIR FILES</td></tr><tr><td width='41' align='left' valign='top'
>&nbsp;</td><td width='34' align='left' valign='top'><b>A) </b></td><td width='7
11' align='left' valign='top'>ACYLIC GRAPH
</td></tr><tr><td wi
dth='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign
='top'><b>B) </b></td><td width='711' align='left' valign='top'>TREE STRUCTURED<
/td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>C) </b></td><td width='711' align='left' valign='to
p'>CYLIC GRAPH
</td></tr><tr><td width='41' align='left' val
ign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b></td><td
width='711' align='left' valign='top'>B-TREE STRUCTURED</td></tr></table><table
border='0' width='600' id='table1_0_14'><tr><td width='41' align='left' valign=
'top'><b>Q.15 </b></td><td width='749' align='left' valign='top' colspan='2'>TO

IMPROVE THE OVERALL PERFORMANCE OF THE SYSTEM, DEVELOPERS INTRODUCED THE CONCEPT
OF</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='
34' align='left' valign='top'><b>A) </b></td><td width='711' align='left' valign
='top'>SIMPLE BATCH SYSTEM</td></tr><tr><td width='41' align='left' valign='top'
>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='7
11' align='left' valign='top'>MULTIPROGRAMMED BATCH SYSTEM</td></tr><tr><td widt
h='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='
top'><b>C) </b></td><td width='711' align='left' valign='top'>PARALLEL SYSTEM
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td>
<td width='34' align='left' valign='top'><b>D) </b></td><td width='711' align='l
eft' valign='top'>DISTRIBUTED SYSTEM</td></tr></table><table border='0' width='6
00' id='table1_0_15'><tr><td width='41' align='left' valign='top'><b>Q.16 </b></
td><td width='749' align='left' valign='top' colspan='2'>EACH PROCESS IS REPRESE
NTED IN THE OPERATING SYSTEM BY A PROCESS CONTROL BLOCK ALSO CALLED</td></tr><tr
><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left'
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>TASK CONT
ROL BLOCK
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711' al
ign='left' valign='top'>CONTROL BLOCK</td></tr><tr><td width='41' align='left' v
align='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><
td width='711' align='left' valign='top'>TASK BLOCK
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='3
4' align='left' valign='top'><b>D) </b></td><td width='711' align='left' valign=
'top'>NONE OF THE ABOVE</td></tr></table><table border='0' width='600' id='table
1_0_16'><tr><td width='41' align='left' valign='top'><b>Q.17 </b></td><td width=
'749' align='left' valign='top' colspan='2'>EVERY ADDRESS GENERATED BY THE CPU I
S DIVIDED INTO HOW MANY PARTS</td></tr><tr><td width='41' align='left' valign='t
op'>&nbsp;</td><td width='34' align='left' valign='top'><b>A) </b></td><td width
='711' align='left' valign='top'>TWO</td></tr><tr><td width='41' align='left' va
lign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><t
d width='711' align='left' valign='top'>THREE</td></tr><tr><td width='41' align=
'left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </
b></td><td width='711' align='left' valign='top'>FOUR</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>D) </b></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td><
/tr></table><table border='0' width='600' id='table1_0_17'><tr><td width='41' al
ign='left' valign='top'><b>Q.18 </b></td><td width='749' align='left' valign='to
p' colspan='2'>WHICH OF THE FOLLOWING ALLOWS THE CPU TO OVERLAP THE INPUT OF ONE
JOB WITH THE COMPUTATION AND OUTPUT OF OTHER JOBS</td></tr><tr><td width='41' a
lign='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>
A) </b></td><td width='711' align='left' valign='top'>SPOOLING</td></tr><tr><td
width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' vali
gn='top'><b>B) </b></td><td width='711' align='left' valign='top'>BATCH SYSTEMS<
/td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>C) </b></td><td width='711' align='left' valign='to
p'>MULTIPROGRAMMING </td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' a
lign='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' wi
dth='600' id='table1_0_18'><tr><td width='41' align='left' valign='top'><b>Q.19
</b></td><td width='749' align='left' valign='top' colspan='2'>THE PROCESS WILL
RESIDE IN MEMORY, THEN ABSOLUTE CODE CAN BE GENERATED IT IS KNOWN AT</td></tr><t
r><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left
' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>COMPILE
TIME
</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711'
align='left' valign='top'>LOAD TIME</td></tr><tr><td width='41' align='left' va
lign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><t
d width='711' align='left' valign='top'>EXECUTION TIME
</td></tr><t
r><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left
' valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>NONE OF

THE ABOVE</td></tr></table><table border='0' width='600' id='table1_0_19'><tr><t

d width='41' align='left' valign='top'><b>Q.20 </b></td><td width='749' align='l
eft' valign='top' colspan='2'>WHAT IS ACROYMN FOR MMU</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>A) </b></td><td width='711' align='left' valign='top'>MEMORY MANAGEMENT UNIT
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td widt
h='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left' val
ign='top'>MEMORIAL MANAGEMENT UNIT</td></tr><tr><td width='41' align='left' vali
gn='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td
width='711' align='left' valign='top'>MEMORIES MANAGEMENT UNIT
</td></tr><tr>
<td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left'
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>NONE OF TH
E ABOVE</td></tr></table><table border='0' width='600' id='table1_0_20'><tr><td
width='41' align='left' valign='top'><b>Q.21 </b></td><td width='749' align='lef
t' valign='top' colspan='2'>A COMPUTER SYSTEM CAN BE DIVIDED INTO HOW MANY COMPO
NENTS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width
='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left' vali
gn='top'>TWO
</td></tr><tr><td wi
dth='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign
='top'><b>B) </b></td><td width='711' align='left' valign='top'>THREE</td></tr><
tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='lef
t' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>FOUR
</td></tr><tr><td width='41' align='l
eft' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b>
</td><td width='711' align='left' valign='top'>FIVE</td></tr></table><table bord
er='0' width='600' id='table1_0_21'><tr><td width='41' align='left' valign='top'
><b>Q.22 </b></td><td width='749' align='left' valign='top' colspan='2'>UNDER TH
E NORMAL MODE OF OPERATION, A PROCESS MAY UTILIZE A RESOURCE IN ONLY THE FOLLOWI
NG SEQUENCE</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td
width='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left
' valign='top'>REQUEST-USE-RELEASE</td></tr><tr><td width='41' align='left' vali
gn='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td
width='711' align='left' valign='top'>REQUEST-RELEASE-USE</td></tr><tr><td width
='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='t
op'><b>C) </b></td><td width='711' align='left' valign='top'>USE-RELEASE-REQUEST
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td wid
th='34' align='left' valign='top'><b>D) </b></td><td width='711' align='left' va
lign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' width='600' id='
table1_0_22'><tr><td width='41' align='left' valign='top'><b>Q.23 </b></td><td w
idth='749' align='left' valign='top' colspan='2'>THE INTERVAL FROM THE TIME OF S
UBMISSION OF A PROCESS TO THE TIME OF COMPLETION IS</td></tr><tr><td width='41'
align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b
>A) </b></td><td width='711' align='left' valign='top'>WAITING TIME
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='3
4' align='left' valign='top'><b>B) </b></td><td width='711' align='left' valign=
'top'>TURNAROUND TIME</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711' a
lign='left' valign='top'>RESPONSE TIME
</td></tr><tr><td width='41' a
lign='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>
D) </b></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td></tr
></table><table border='0' width='600' id='table1_0_23'><tr><td width='41' align
='left' valign='top'><b>Q.24 </b></td><td width='749' align='left' valign='top'
colspan='2'>WHICH DIRECTORY STRUCTURES ALLOW SUBDIRECTORIES AND FILES TO BE SHAR
ED</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='3
4' align='left' valign='top'><b>A) </b></td><td width='711' align='left' valign=
'top'>ACYLIC GRAPH
</td></tr><tr><td width='41' align='left'
valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td>
<td width='711' align='left' valign='top'>TREE STRUCTURED</td></tr><tr><td width
='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='t
op'><b>C) </b></td><td width='711' align='left' valign='top'>CYLIC GRAPH

</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td

><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' align='
left' valign='top'>B-TREE STRUCTURED</td></tr></table><table border='0' width='6
00' id='table1_0_24'><tr><td width='41' align='left' valign='top'><b>Q.25 </b></
td><td width='749' align='left' valign='top' colspan='2'>WHAT IS ACROYMN FOR IPC
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='t
op'>INTER PROCESS COMMUNICATION</td></tr><tr><td width='41' align='left' valign=
'top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td wid
th='711' align='left' valign='top'>INTERNAL PROCESS COMMUNICATION</td></tr><tr><
td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' v
align='top'><b>C) </b></td><td width='711' align='left' valign='top'>INTER PROCE
SSED COMMUNICATION</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;<
/td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' alig
n='left' valign='top'>INTERNAL PROCESSED COMMUNICATION</td></tr></table><table b
order='0' width='600' id='table1_0_25'><tr><td width='41' align='left' valign='t
op'><b>Q.26 </b></td><td width='749' align='left' valign='top' colspan='2'>PHYSI
CAL MEMORY IS BROKEN INTO FIXED SIZE BLOCKS CALLED AS</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>A) </b></td><td width='711' align='left' valign='top'>PAGES </td></tr><tr><t
d width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' va
lign='top'><b>B) </b></td><td width='711' align='left' valign='top'>FRAMES</td><
/tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align
='left' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>LO
GICAL</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width
='34' align='left' valign='top'><b>D) </b></td><td width='711' align='left' vali
gn='top'>NONE OF THE ABOVE</td></tr></table><table border='0' width='600' id='ta
ble1_0_26'><tr><td width='41' align='left' valign='top'><b>Q.27 </b></td><td wid
th='749' align='left' valign='top' colspan='2'>WHICH SCHEDULING IS THE SIMPLEST
SCHEDULING ALGORITHM BUT IT CAN CAUSE SHOTE PROCESSES TO WAIT FOR VERY LONG PROC
ESSES</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width
='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left' vali
gn='top'>FCFS</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><
td width='34' align='left' valign='top'><b>B) </b></td><td width='711' align='le
ft' valign='top'>SJF</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711' al
ign='left' valign='top'>RR </td></tr><tr><td width='41' align='left' valign='t
op'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width
='711' align='left' valign='top'>PRIORITY</td></tr></table><table border='0' wid
th='600' id='table1_0_27'><tr><td width='41' align='left' valign='top'><b>Q.28 <
/b></td><td width='749' align='left' valign='top' colspan='2'>WHICH FRAGMENTATIO
N EXISTS WHEN ENOUGH MEMORY SPACE EXISTS TO SATISTY A REQUEST, BUT IT IS NOT CON
TIGUOUS, IT IS FRAGMENTED INTO A LARGE NUMBER OF SMALL HOLES</td></tr><tr><td wi
dth='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign
='top'><b>A) </b></td><td width='711' align='left' valign='top'>INTERNAL FRAGMEN
TATION
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td>
<td width='34' align='left' valign='top'><b>B) </b></td><td width='711' align='l
eft' valign='top'>EXTERNAL FRAGMENTATION</td></tr><tr><td width='41' align='left
' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></t
d><td width='711' align='left' valign='top'>BOTH A AND B
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><t
d width='34' align='left' valign='top'><b>D) </b></td><td width='711' align='lef
t' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' width='600'
id='table1_0_28'><tr><td width='41' align='left' valign='top'><b>Q.29 </b></td>
<td width='749' align='left' valign='top' colspan='2'>ALLOCATE THE SMALLEST HOLE
THAT IS BIG ENOUGH</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;
</td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' ali
gn='left' valign='top'>FIRST FIT
</td></tr><tr><td width='41'
align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><
b>B) </b></td><td width='711' align='left' valign='top'>BEST FIT</td></tr><tr><t

d width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' va

lign='top'><b>C) </b></td><td width='711' align='left' valign='top'>WORST FIT
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;
</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' ali
gn='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' widt
h='600' id='table1_0_29'><tr><td width='41' align='left' valign='top'><b>Q.30 </
b></td><td width='749' align='left' valign='top' colspan='2'>WHAT IS ACROYMN FOR
MMU</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width=
'34' align='left' valign='top'><b>A) </b></td><td width='711' align='left' valig
n='top'>MEMORY MANAGEMENT UNIT</td></tr><tr><td width='41' align='left' valign='
top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td widt
h='711' align='left' valign='top'>MANAGEMENT MEMORY UNIT</td></tr><tr><td width=
'41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='to
p'><b>C) </b></td><td width='711' align='left' valign='top'>MEMORIAL MANAGEMENT
UNIT</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width=
'34' align='left' valign='top'><b>D) </b></td><td width='711' align='left' valig
n='top'>MANAGEMENT MEMORIAL UNIT</td></tr></table><table border='0' width='600'
id='table1_0_30'><tr><td width='41' align='left' valign='top'><b>Q.31 </b></td><
td width='749' align='left' valign='top' colspan='2'>WHAT IS ACROYMN FOR MFD</td
></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' ali
gn='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>
MULTIPLE FILE DIRECTORY</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711'
align='left' valign='top'>MASTER FILE DIRECTORY</td></tr><tr><td width='41' ali
gn='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C)
</b></td><td width='711' align='left' valign='top'>MULTIPLE FILE DIRECTORIES</t
d></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' al
ign='left' valign='top'><b>D) </b></td><td width='711' align='left' valign='top'
>MASTER FILE DIRECTORIES</td></tr></table><table border='0' width='600' id='tabl
e1_0_31'><tr><td width='41' align='left' valign='top'><b>Q.32 </b></td><td width
='749' align='left' valign='top' colspan='2'>HOW MANY METHODS ARE USED FOR ALLOC
ATING DISK SPACE</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</t
d><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' align=
'left' valign='top'>TWO </td></tr><tr><td width='41' align='left' valign='top'
>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='7
11' align='left' valign='top'>THREE</td></tr><tr><td width='41' align='left' val
ign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td
width='711' align='left' valign='top'>FOUR </td></tr><tr><td width='41' align='
left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b
></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td></tr></tab
le><table border='0' width='600' id='table1_0_32'><tr><td width='41' align='left
' valign='top'><b>Q.33 </b></td><td width='749' align='left' valign='top' colspa
n='2'> REPLACE THE PAGE THAT WILL NOT BE USED FOR THE LONGEST PERIOD OF TIME
IS DONE I
WHICH OF THE FOLLOWING ALGORITHM</td></tr><tr><td width='41' align='left' valig
n='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>A) </b></td><td w
idth='711' align='left' valign='top'>FIFO ALGORITHM
</td></tr><
tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='lef
t' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>OPTIMAL
ALGORITHM</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td
width='34' align='left' valign='top'><b>C) </b></td><td width='711' align='left'
valign='top'>LRU ALGORITHM
</td></tr><tr><td width='41' align
='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) <
/b></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td></tr></t
able><table border='0' width='600' id='table1_0_33'><tr><td width='41' align='le
ft' valign='top'><b>Q.34 </b></td><td width='749' align='left' valign='top' cols
pan='2'>WHAT IS USED AS AN INDEX INTO A PAGE TABLE</td></tr><tr><td width='41' a
lign='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>
A) </b></td><td width='711' align='left' valign='top'>PAGE POINTER
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td
width='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left'

valign='top'>PAGE BEGINNING</td></tr><tr><td width='41' align='left' valign='to

p'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td width=
'711' align='left' valign='top'>PAGE NUMBER
</td></tr><tr
><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left'
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>PAGE STAR
T</td></tr></table><br><br><b><u>PART B</u></b><br><br><table border='0' width='
600' id='table1_1_0'><tr><td width='41' align='left' valign='top'><b>Q.1 </b></t
d><td width='749' align='left' valign='top' colspan='2'>WHICH OF THE FOLLOWING C
AN BE THE SEVERAL REASONS FOR PROVIDING AN ENVIRONMENT THAT ALLOWS PROCESS CO-OP
ERATION <br>1) INFORMATION SHARING <br>2) COMPUTATION SPEEDUP <br>3) MODULARITY
<br>4) CONVENIENCE</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;<
/td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' alig
n='left' valign='top'>1,2,3
</td></tr><tr><
td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' v
align='top'><b>B) </b></td><td width='711' align='left' valign='top'>1,2,4</td><
/tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align
='left' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>2,
3,4
</td></tr><tr><td width='41' align='lef
t' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b></
td><td width='711' align='left' valign='top'>ALL OF THE ABOVE</td></tr></table><
table border='0' width='600' id='table1_1_1'><tr><td width='41' align='left' val
ign='top'><b>Q.2 </b></td><td width='749' align='left' valign='top' colspan='2'>
WHICH OF THE FOLLOWING CAN BE MAJOR FOR VARIETY OF REASONS FOR BUILDING DISTRIBU
TED SYSTEMS <br>1) RESOURCE SHARING <br>2) COMPUTATION SPEEDUP <br>3) RELIABILIT
Y <br>4) COMMUNICATION</td></tr><tr><td width='41' align='left' valign='top'>&nb
sp;</td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711'
align='left' valign='top'>1,2,3,4
</t
d></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' al
ign='left' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'
>2,3,4</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td widt
h='34' align='left' valign='top'><b>C) </b></td><td width='711' align='left' val
ign='top'>1,3,4
</td></tr><tr><td
width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' vali
gn='top'><b>D) </b></td><td width='711' align='left' valign='top'>1,2,3</td></tr
></table><table border='0' width='600' id='table1_1_2'><tr><td width='41' align=
'left' valign='top'><b>Q.3 </b></td><td width='749' align='left' valign='top' co
lspan='2'>IN WHCH TECHNIQUE IT ALLOWS THE EXECUTION OF PROCESSES THAT MAY NOT BE
COMPLETELY IN MEMORY</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' a
lign='left' valign='top'>VIRTUAL MEMORY
</td></tr><tr><td width='41'
align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b
>B) </b></td><td width='711' align='left' valign='top'>MEMORY MANAGEMENT</td></t
r><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='
left' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>PHYS
ICAL MEMORY
</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' a
lign='left' valign='top'>NONE OF THE ABOVE</td></tr></table><table border='0' wi
dth='600' id='table1_1_3'><tr><td width='41' align='left' valign='top'><b>Q.4 </
b></td><td width='749' align='left' valign='top' colspan='2'>WHICH ALLOWS THE CP
U TO OVERLAP THE INPUT OF ONE JOB WITH THE COMPUTATION AND OUTPUT OF OTHER JOBS<
/td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='to
p'>BATCH SYSTEM
</td></tr><tr><td width='41' align='left'
valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td>
<td width='711' align='left' valign='top'>MULTIPROGRAMMING</td></tr><tr><td widt
h='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='
top'><b>C) </b></td><td width='711' align='left' valign='top'>PARALLEL SYSTEM
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><
td width='34' align='left' valign='top'><b>D) </b></td><td width='711' align='le
ft' valign='top'>SPOOLING</td></tr></table><table border='0' width='600' id='tab

le1_1_4'><tr><td width='41' align='left' valign='top'><b>Q.5 </b></td><td width=

'749' align='left' valign='top' colspan='2'>WHOM DOES THE TASK OF SELECTING A WA
ITING PROCESS FROM THE READY QUEUE AND ALLOCATING THE CPU TO IT</td></tr><tr><td
width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' val
ign='top'><b>A) </b></td><td width='711' align='left' valign='top'>CPU SCHEDULIN
G
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711' al
ign='left' valign='top'>FCFS</td></tr><tr><td width='41' align='left' valign='to
p'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td width=
'711' align='left' valign='top'>SJF </td></tr><tr><td width='41' align='left' va
lign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b></td><t
d width='711' align='left' valign='top'>MULTILEVEL QUEUE</td></tr></table><table
border='0' width='600' id='table1_1_5'><tr><td width='41' align='left' valign='
top'><b>Q.6 </b></td><td width='749' align='left' valign='top' colspan='2'>WHICH
OF THE FOLLOWING METHODS ARE USED FOR LOGICALLY IMPLEMENTING A LINK AND THE SEN
D/RECEIVE OPERATIONS <br>1) DIRECT OR INDIRECT COMMUNICATION <br>2) SYMMETRIC OR
ASYMMETRIC COMMUNICATION <br>3) AUTOMATIC OR EXPLICIT BUFFERING <br>4) SEND BY
COPY OR SE</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td
width='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left'
valign='top'>1,2,4,5
</td></tr><tr><td wi
dth='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign
='top'><b>B) </b></td><td width='711' align='left' valign='top'>1,2,3,5</td></tr
><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='l
eft' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>1,2,3
,4,5
</td></tr><tr><td width='41' align='left
' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b></t
d><td width='711' align='left' valign='top'>1,2,3,4</td></tr></table><table bord
er='0' width='600' id='table1_1_6'><tr><td width='41' align='left' valign='top'>
<b>Q.7 </b></td><td width='749' align='left' valign='top' colspan='2'>WHICH OF T
HE FOLLOWING CONTAINS MANY PIECES OF INFORMATION ASSOCIATED WITH A SPECIFIC PROC
ESS OF PROCESS CONTROL BLOCK <br>1) PROCESS STATE <br>2) PROGRAM COUNTER <br>3)
CPU REGISTERS <br>4) CPU SCHEDULING INFORMATION <br>5) MEMORY MANAGEMENT INFORMA
TION </td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width
='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left' vali
gn='top'>1,2,3,4,5,6,7
</td></tr><tr><td width='41' a
lign='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>
B) </b></td><td width='711' align='left' valign='top'>1,2,3,4,5,7</td></tr><tr><
td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' v
align='top'><b>C) </b></td><td width='711' align='left' valign='top'>1,2,3,4,5
</td></tr><tr><td width='41' align='left' valign
='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D) </b></td><td wi
dth='711' align='left' valign='top'>1,2,3,4,5,6</td></tr></table><table border='
0' width='600' id='table1_1_7'><tr><td width='41' align='left' valign='top'><b>Q
.8 </b></td><td width='749' align='left' valign='top' colspan='2'>WHICH ALGORITH
M IS EASY TO PROGRAM, BUT SUFFERS FROM BELLADY S ANOMALY</td></tr><tr><td width='41'
align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><
b>A) </b></td><td width='711' align='left' valign='top'>FIFO
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><t
d width='34' align='left' valign='top'><b>B) </b></td><td width='711' align='lef
t' valign='top'>LRU</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;
</td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711' ali
gn='left' valign='top'>BOTH A AND B
</td></tr><tr><td width='41' alig
n='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D)
</b></td><td width='711' align='left' valign='top'>NONE OF THE ABOVE</td></tr></
table><table border='0' width='600' id='table1_1_8'><tr><td width='41' align='le
ft' valign='top'><b>Q.9 </b></td><td width='749' align='left' valign='top' colsp
an='2'>WHICH OF THE FOLLOWING IS A MEMORY MANAGEMENT SCHEME, WHICH SUPPORTS THIS
USER S VIEW OF MEMORY</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;<
/td><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' alig
n='left' valign='top'>SEGMENTATION
</td></tr><tr><td width='41' align='left'

valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td>

<td width='711' align='left' valign='top'>PAGING</td></tr><tr><td width='41' ali
gn='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C)
</b></td><td width='711' align='left' valign='top'>INTERNAL FRAGMENTATION
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>D) </b></td><td width='711' align='left' valign='t
op'>EXTERNAL FRAGMENTATION</td></tr></table><table border='0' width='600' id='ta
ble1_1_9'><tr><td width='41' align='left' valign='top'><b>Q.10 </b></td><td widt
h='749' align='left' valign='top' colspan='2'>WHAT IS ACROYMN FOR RJE</td></tr><
tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='lef
t' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>REMOTE
JOB ENTRY
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711' al
ign='left' valign='top'>REMOTE JOB ENTRIES</td></tr><tr><td width='41' align='le
ft' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b><
/td><td width='711' align='left' valign='top'>REMOTE JOBS ENTRY
</td></t
r><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='
left' valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>REMO
TE JOBS ENTRIES</td></tr></table><table border='0' width='600' id='table1_1_10'>
<tr><td width='41' align='left' valign='top'><b>Q.11 </b></td><td width='749' al
ign='left' valign='top' colspan='2'>EACH PROCESS MAY BE IN ONE OF THE FOLLOWING
STATES <br>1) NEW <br>2) RUNNING <br>3) WAITING <br>4) READY <br>5) TERMINATED</
td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' a
lign='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='top
'>1,2,3,4
</td></tr><tr><td width
='41' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='t
op'><b>B) </b></td><td width='711' align='left' valign='top'>1,2,3,4,5</td></tr>
<tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='le
ft' valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>1,2,3,
5
</td></tr><tr><td width='41' al
ign='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>D
) </b></td><td width='711' align='left' valign='top'>1,2,4,5</td></tr></table><b
r><br><b><u>PART C</u></b><br><br><table border='0' width='600' id='table1_2_0'>
<tr><td width='41' align='left' valign='top'><b>Q.1 </b></td><td width='749' ali
gn='left' valign='top' colspan='2'>MATCH THE FOLLOWING <br>A <br>1) I/O REQUEST
<br>2) AN INTERRUPT OCCURS <br>3) COMPLETION OF I/O
<br>B <br>i) WHEN A PROCESS SWITCHES FROM THE RUNNING STATE TO THE WAITING
STATE <br>ii) WHEN A PROCESS WITCHES FROM THE RUN</td></tr><tr><td width='41' a
lign='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>
A) </b></td><td width='711' align='left' valign='top'>1-i, 2-ii, 3-iii
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;<
/td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711' alig
n='left' valign='top'>1-i, 2-iii, 3-ii</td></tr><tr><td width='41' align='left'
valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td>
<td width='711' align='left' valign='top'>1-ii, 2-i, 3-iii
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td widt
h='34' align='left' valign='top'><b>D) </b></td><td width='711' align='left' val
ign='top'>1-iii, 2-ii, 3-i
</td></tr></table><table border=
'0' width='600' id='table1_2_1'><tr><td width='41' align='left' valign='top'><b>
Q.2 </b></td><td width='749' align='left' valign='top' colspan='2'>WHICH OF THE
FOLLOWING ARE USED FOR SCHEDULING CRITERIA <br>1) CPU UTILIZATION <br>2) THROUGH
OUTPUT <br>3) TURNAROUND TIME <br>4) WAITING TIME <br>5) RESPONSE TIME</td></tr>
<tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' align='le
ft' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>1,3,4,
5
</td></tr><tr><td width='41' align='left' valign='top
'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='
711' align='left' valign='top'>1,2,3,4,5</td></tr><tr><td width='41' align='left
' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></t
d><td width='711' align='left' valign='top'>1,4,5
</
td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' a

lign='left' valign='top'><b>D) </b></td><td width='711' align='left' valign='top

'>NONE OF THE ABOVE</td></tr></table><table border='0' width='600' id='table1_2_
2'><tr><td width='41' align='left' valign='top'><b>Q.3 </b></td><td width='749'
align='left' valign='top' colspan='2'>A MULTILEVEL FEEDBACK QUEUE SCHEDULER IS D
EFINED BY WHICH OF THE FOLLOWING PARAMETERS <br>1) THE NUMBER OF QUEUES <br>2) T
HE SCHEDULING ALGORITHM FOR EACH QUEUE <br>3) THE METHOD USED TO DETERMINE WHEN
TO UPGRADE A PROCESS TO A HIGHER PRIORITY QUEUE <br>4</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>A) </b></td><td width='711' align='left' valign='top'>1,2,3,4,5
</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'><b>B) </b></td><td width='711' al
ign='left' valign='top'>1,2,3,4</td></tr><tr><td width='41' align='left' valign=
'top'>&nbsp;</td><td width='34' align='left' valign='top'><b>C) </b></td><td wid
th='711' align='left' valign='top'>1,2,3,5
<
/td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34'
align='left' valign='top'><b>D) </b></td><td width='711' align='left' valign='to
p'>1,2,4,5</td></tr></table><table border='0' width='600' id='table1_2_3'><tr><t
d width='41' align='left' valign='top'><b>Q.4 </b></td><td width='749' align='le
ft' valign='top' colspan='2'>IF PREEMPTION IS REQUIRED TO DEAL WITH DEADLOCKS, T
HEN WHICH ISSUES NEED TO BE ADDRESSED <br>1) SELECTING A VICTIM <br>2) ROLLBACK
<br>3) STARVATION
<br>4) TERMINATION <br>5) DETECTION</t
d></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' al
ign='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'
>1,2,3,4,5
</td></tr><tr><td width='41' align='l
eft' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b>
</td><td width='711' align='left' valign='top'>1,2,3,4</td></tr><tr><td width='4
1' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'
><b>C) </b></td><td width='711' align='left' valign='top'>1,2,3
</td></tr><tr><td width='41' align='left' valign='top'>&nb
sp;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711'
align='left' valign='top'>1,2,3,5</td></tr></table><table border='0' width='600'
id='table1_2_4'><tr><td width='41' align='left' valign='top'><b>Q.5 </b></td><t
d width='749' align='left' valign='top' colspan='2'>A DEADLOCK SITUATION CAN ARI
SE WHICH OF THE FOLLOWING CONDITIONS HOLD SIMULTANEOUSLY IN A SYSTEM <br>1) MUTU
AL EXCLUSION <br>2) HOLD AND WAIT <br>3) NO PREEMPTION <br>4) CIRCULAR WAIT</td>
</tr><tr><td width='41' align='left' valign='top'>&nbsp;</td><td width='34' alig
n='left' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>1
,2,3
</td></tr><tr><td width='41' align='
left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'><b>B) </b
></td><td width='711' align='left' valign='top'>1,2,4</td></tr><tr><td width='41
' align='left' valign='top'>&nbsp;</td><td width='34' align='left' valign='top'>
<b>C) </b></td><td width='711' align='left' valign='top'>1,2,3,4
</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' a
lign='left' valign='top'>NONE OF THE ABOVE</td></tr></table><br><br>