Академический Документы
Профессиональный Документы
Культура Документы
//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'>WHAT IS ACROYMN FOR MFD</td></tr><tr><td width='41' align
='left' valign='top'> </td><td width='34' align='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'> </td><td width='34' align=
'left' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>MAS
TER FILE DIRECTORY</td></tr><tr><td width='41' align='left' valign='top'> <
/td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711' alig
n='left' valign='top'>MULTIPLE FILE DIRECTORIES</td></tr><tr><td width='41' alig
n='left' valign='top'> </td><td width='34' align='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='table1_0_1'><tr><td width='41' ali
gn='left' valign='top'><b>Q.2 </b></td><td width='749' align='left' valign='top'
colspan='2'>WHAT IS ACROYMN FOR MMU</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'><b>A) </b></td><t
d width='711' align='left' valign='top'>MEMORY MANAGEMENT UNIT
</td></tr><
tr><td width='41' align='left' valign='top'> </td><td width='34' align='lef
t' valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>MEMORIA
L MANAGEMENT UNIT</td></tr><tr><td width='41' align='left' valign='top'> </
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' al
ign='left' valign='top'> </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_2'><tr><td width='41' align='
left' valign='top'><b>Q.3 </b></td><td width='749' align='left' valign='top' col
span='2'>ALLOCATE THE SMALLEST HOLE THAT IS BIG ENOUGH</td></tr><tr><td width='4
1' align='left' valign='top'> </td><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='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left' va
lign='top'>BEST FIT</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'><b>C) </b></td><td width='711' ali
gn='left' valign='top'>WORST FIT
</td></tr><tr><td width='4
1' align='left' valign='top'> </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' al
ign='left' valign='top'><b>Q.4 </b></td><td width='749' align='left' valign='top
' colspan='2'>A COMPUTER SYSTEM CAN BE DIVIDED INTO HOW MANY COMPONENTS</td></tr
><tr><td width='41' align='left' valign='top'> </td><td width='34' align='l
eft' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>TWO
</td></tr><tr><td width='41' align
='left' valign='top'> </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'> </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='t
op'> </td><td width='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_4'><tr><td width='41' align='left' valign='top'><b>Q.5 </b></t
d><td width='749' align='left' valign='top' colspan='2'>IF PREEMPTION IS REQUIRE
D TO DEAL WITH DEADLOCKS THEN HOW MANY ISSUES NEED TO BE ADDRESSES</td></tr><tr>
<td width='41' align='left' valign='top'> </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'> </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'> </td><td width='
34' align='left' valign='top'><b>C) </b></td><td width='711' align='left' valign
ING CAN BE THE SEVERAL REASONS FOR PROVIDING AN ENVIRONMENT THAT ALLOWS PROCESS
CO-OPERATION <br>1) INFORMATION SHARING <br>2) COMPUTATION SPEEDUP <br>3) MODULA
RITY <br>4) CONVENIENCE</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='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'> </td><td width='34' align='le
ft' 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'> </td><td width='34'
align='left' valign='top'><b>C) </b></td><td width='711' align='left' valign='to
p'>2,3,4
</td></tr><tr><td width='41' align
='left' valign='top'> </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></ta
ble><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'>IN WHCH TECHNIQUE IT ALLOWS THE EXECUTION OF PROCESSES THAT MAY NOT BE COMP
LETELY IN MEMORY</td></tr><tr><td width='41' align='left' valign='top'> </t
d><td width='34' align='left' valign='top'><b>A) </b></td><td width='711' align=
'left' valign='top'>VIRTUAL MEMORY
</td></tr><tr><td width='41' align
='left' valign='top'> </td><td width='34' align='left' valign='top'><b>B) <
/b></td><td width='711' align='left' valign='top'>MEMORY MANAGEMENT</td></tr><tr
><td width='41' align='left' valign='top'> </td><td width='34' align='left'
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>PHYSICAL
MEMORY
</td></tr><tr><td width='41' align='left' valign='top'> </t
d><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_6'><tr><td width='41' align='left' valign='top'><b>Q.7 </b></t
d><td width='749' align='left' valign='top' colspan='2'>WHICH OF THE FOLLOWING C
ONTAINS MANY PIECES OF INFORMATION ASSOCIATED WITH A SPECIFIC PROCESS 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 INFORMATION </td></tr
><tr><td width='41' align='left' valign='top'> </td><td width='34' align='l
eft' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>1,2,3
,4,5,6,7
</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'><b>B) </b></td><t
d width='711' align='left' valign='top'>1,2,3,4,5,7</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' 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'> <
/td><td width='34' align='left' valign='top'><b>D) </b></td><td width='711' alig
n='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><t
d width='749' align='left' valign='top' colspan='2'>WHICH ALLOWS THE CPU TO OVER
LAP THE INPUT OF ONE JOB WITH THE COMPUTATION AND OUTPUT OF OTHER JOBS</td></tr>
<tr><td width='41' align='left' valign='top'> </td><td width='34' align='le
ft' valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>BATCH
SYSTEM
</td></tr><tr><td width='41' align='left' valign='t
op'> </td><td width='34' align='left' valign='top'><b>B) </b></td><td width
='711' align='left' valign='top'>MULTIPROGRAMMING</td></tr><tr><td width='41' al
ign='left' valign='top'> </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'> </td><td width=
'34' align='left' valign='top'><b>D) </b></td><td width='711' align='left' valig
n='top'>SPOOLING</td></tr></table><table border='0' width='600' id='table1_1_8'>
<tr><td width='41' align='left' valign='top'><b>Q.9 </b></td><td width='749' ali
gn='left' valign='top' colspan='2'>WHAT IS ACROYMN FOR RJE</td></tr><tr><td widt
h='41' align='left' valign='top'> </td><td width='34' align='left' 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'> </td><td w
idth='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left'
valign='top'>REMOTE JOB ENTRIES</td></tr><tr><td width='41' align='left' valign=