MC0085 1

Subject : Advanced Operating Systems (Distributed systems) (MC0085) Provi
ded by <a href='http://www.programmer2programmer.net'>www.programmer2programmer.

net</a> PART A <table border='0' width='600' id='tab
le1_0_0'><tr><td width='41' align='left' valign='top'>Q.1 </td><td width=
'749' align='left' valign='top' colspan='2'>Spooling is ______</td></tr><tr><td
width='41' align='left' valign='top'> </td><td width='34' align='left' vali
gn='top'>A) </td><td width='711' align='left' valign='top'>Simultaneous p
rocessed operation on-line</td></tr><tr><td width='41' align='left' valign='top'
> </td><td width='34' align='left' valign='top'>B) </td><td width='7
11' align='left' valign='top'>Simultaneous programmed operation on-line</td></tr
><tr><td width='41' align='left' valign='top'> </td><td width='34' align='l
eft' valign='top'>C) </td><td width='711' align='left' valign='top'>Simul
taneous peripheral operation on-line</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'>D) </td><t
d width='711' align='left' valign='top'>None of above</td></tr></table><table bo
rder='0' width='600' id='table1_0_1'><tr><td width='41' align='left' valign='top
'>Q.2 </td><td width='749' align='left' valign='top' colspan='2'>Common i
nput devices in early computers were a. Card reader b. Tape drives c. Printers d. Card punches</td></tr><tr><td width='41' align='left' vali
gn='top'> </td><td width='34' align='left' valign='top'>A) </td><td
width='711' align='left' valign='top'>only a & b</td></tr><tr><td width='41' ali
gn='left' valign='top'> </td><td width='34' align='left' valign='top'>B)
</td><td width='711' align='left' valign='top'>a, b, c</td></tr><tr><td wid
th='41' align='left' valign='top'> </td><td width='34' align='left' valign=
'top'>C) </td><td width='711' align='left' valign='top'>b, d</td></tr><tr
><td width='41' align='left' valign='top'> </td><td width='34' align='left'
valign='top'>D) </td><td width='711' align='left' valign='top'>All of th
e above</td></tr></table><table border='0' width='600' id='table1_0_2'><tr><td w
idth='41' align='left' valign='top'>Q.3 </td><td width='749' align='left'
valign='top' colspan='2'> ____ is used as delete command</td></tr><tr><td width
='41' align='left' valign='top'> </td><td width='34' align='left' valign='t
op'>A) </td><td width='711' align='left' valign='top'>x</td></tr><tr><td
gn='top'>B) </td><td width='711' align='left' valign='top'>u</td></tr><tr
valign='top'>C) </td><td width='711' align='left' valign='top'>yy</td></
tr><tr><td width='41' align='left' valign='top'> </td><td width='34' align=
'left' valign='top'>D) </td><td width='711' align='left' valign='top'>Non
e of these</td></tr></table><table border='0' width='600' id='table1_0_3'><tr><t
d width='41' align='left' valign='top'>Q.4 </td><td width='749' align='le
ft' valign='top' colspan='2'>The primary distinction between long-term and s
hort-term scheduler is _______</td></tr><tr><td width='41' align='left' valign='
top'> </td><td width='34' align='left' valign='top'>A) </td><td widt
h='711' align='left' valign='top'>Frequency of their execution</td></tr><tr><td
gn='top'>B) </td><td width='711' align='left' valign='top'>Time of their
execution</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
idth='34' align='left' valign='top'>C) </td><td width='711' align='left'
valign='top'>Memory of their execution</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>D) </td>
<td width='711' align='left' valign='top'>None of the above</td></tr></table><ta
ble border='0' width='600' id='table1_0_4'><tr><td width='41' align='left' valig
n='top'>Q.5 </td><td width='749' align='left' valign='top' colspan='2'>Re
asons for providing an environment that allows process cooperation are a
. Information Sharing b. Computation Speedup c. Modularity d. Conven
ience</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
='34' align='left' valign='top'>A) </td><td width='711' align='left' vali
gn='top'>a, b, c,</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>B) </td><td width='711' align
='left' valign='top'>c, d</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>C) </td><td width='71

1' align='left' valign='top'>a, b, d</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'>D) </td><t
d width='711' align='left' valign='top'>a, b, c, d</td></tr></table><table borde
r='0' width='600' id='table1_0_5'><tr><td width='41' align='left' valign='top'>Q.6 </td><td width='749' align='left' valign='top' colspan='2'> ______amou
nt of system memory is supported by Linux</td></tr><tr><td width='41' align=
'left' valign='top'> </td><td width='34' align='left' valign='top'>A) </td><td width='711' align='left' valign='top'>32 GB</td></tr><tr><td width='4
1' align='left' valign='top'> </td><td width='34' align='left' valign='top'
>B) </td><td width='711' align='left' valign='top'>64 GB</td></tr><tr><td
width='41' align='left' valign='top'> </td><td width='34' align='left' val
ign='top'>C) </td><td width='711' align='left' valign='top'>128 GB</td></
'left' valign='top'>D) </td><td width='711' align='left' valign='top'>256
GB</td></tr></table><table border='0' width='600' id='table1_0_6'><tr><td width
='41' align='left' valign='top'>Q.7 </td><td width='749' align='left' val
ign='top' colspan='2'>A process terminates when it finishes executing its la
st statement and asks the operating system to delete it by using _____</td><
/tr><tr><td width='41' align='left' valign='top'> </td><td width='34' align
='left' valign='top'>A) </td><td width='711' align='left' valign='top'>De
lete system call</td></tr><tr><td width='41' align='left' valign='top'> </t
d><td width='34' align='left' valign='top'>B) </td><td width='711' align=
'left' valign='top'>Exit system call</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'>C) </td><t
d width='711' align='left' valign='top'>Both A) and B)</td></tr><tr><td width='4
>D) </td><td width='711' align='left' valign='top'>Neither A) nor B)</td>
</tr></table><table border='0' width='600' id='table1_0_7'><tr><td width='41' al
ign='left' valign='top'>Q.8 </td><td width='749' align='left' valign='top
' colspan='2'> ________ is a collection of related information defined by it
s creator.</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>A) </td><td width='711' align='left'
valign='top'>File</td></tr><tr><td width='41' align='left' valign='top'> <
/td><td width='34' align='left' valign='top'>B) </td><td width='711' alig
n='left' valign='top'>Table</td></tr><tr><td width='41' align='left' valign='top
'> </td><td width='34' align='left' valign='top'>C) </td><td width='
711' align='left' valign='top'>Database</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>D) </td
><td width='711' align='left' valign='top'>Folder</td></tr></table><table border
='0' width='600' id='table1_0_8'><tr><td width='41' align='left' valign='top'>Q.9 </td><td width='749' align='left' valign='top' colspan='2'>The fundamen
tal goal of computer system is ____</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>A) </td
><td width='711' align='left' valign='top'>to execute user programs</td></tr><tr
valign='top'>B) </td><td width='711' align='left' valign='top'>to make s
olving user problems easier</td></tr><tr><td width='41' align='left' valign='top
711' align='left' valign='top'>Both A) and B)</td></tr><tr><td width='41' align=
'left' valign='top'> </td><td width='34' align='left' valign='top'>D) </td><td width='711' align='left' valign='top'>Neither A) nor B)</td></tr></ta
ble><table border='0' width='600' id='table1_0_9'><tr><td width='41' align='left
' valign='top'>Q.10 </td><td width='749' align='left' valign='top' colspa
n='2'>Pick-up the FALSE statements</td></tr><tr><td width='41' align='left' vali
width='711' align='left' valign='top'>Never logon into the system as root user</
td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34' a
lign='left' valign='top'>B) </td><td width='711' align='left' valign='top
'>Never leave services if not used</td></tr><tr><td width='41' align='left' vali
gn='top'> </td><td width='34' align='left' valign='top'>C) </td><td

width='711' align='left' valign='top'>Never leave root shell on in the console</
lign='left' valign='top'>D) </td><td width='711' align='left' valign='top
'>Win 98 and Win 95 are inherently secure
systems</td></tr></table><table border='0' width='600' id='table1_0_10'><tr><td
width='41' align='left' valign='top'>Q.11 </td><td width='749' align='lef
t' valign='top' colspan='2'> ______ number of CPUs are supported by Linux</t
d></tr><tr><td width='41' align='left' valign='top'> </td><td width='34' al
ign='left' valign='top'>A) </td><td width='711' align='left' valign='top'
>4</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
4' align='left' valign='top'>B) </td><td width='711' align='left' valign=
'top'>8</td></tr><tr><td width='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'>C) </td><td width='711' align='left' va
lign='top'>16</td></tr><tr><td width='41' align='left' valign='top'> </td><
td width='34' align='left' valign='top'>D) </td><td width='711' align='le
ft' valign='top'>32</td></tr></table><table border='0' width='600' id='table1_0_
11'><tr><td width='41' align='left' valign='top'>Q.12 </td><td width='749
' align='left' valign='top' colspan='2'>Linux supports ___ bit hardware</td></tr
eft' valign='top'>A) </td><td width='711' align='left' valign='top'>32</t
ign='left' valign='top'>B) </td><td width='711' align='left' valign='top'
>64</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
34' align='left' valign='top'>C) </td><td width='711' align='left' valign
='top'>Both A & B</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>D) </td><td width='711' align
='left' valign='top'>Neither A nor B</td></tr></table><table border='0' width='6
00' id='table1_0_12'><tr><td width='41' align='left' valign='top'>Q.13 </
td><td width='749' align='left' valign='top' colspan='2'> _____ is a common boot
manager</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
dth='34' align='left' valign='top'>A) </td><td width='711' align='left' v
align='top'>Grub</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>Grep</td></tr><tr><td width='41' align='left' valign='top'>&
nbsp;</td><td width='34' align='left' valign='top'>C) </td><td width='711
' align='left' valign='top'>Grup</td></tr><tr><td width='41' align='left' valign
='top'> </td><td width='34' align='left' valign='top'>D) </td><td wi
dth='711' align='left' valign='top'>Greb</td></tr></table><table border='0' widt
h='600' id='table1_0_13'><tr><td width='41' align='left' valign='top'>Q.14 </td><td width='749' align='left' valign='top' colspan='2'>As process enter th
e system, they are put into _____</td></tr><tr><td width='41' align='left' v
align='top'> </td><td width='34' align='left' valign='top'>A) </td><
td width='711' align='left' valign='top'>Process queue</td></tr><tr><td width='4
>B) </td><td width='711' align='left' valign='top'>Share queue</td></tr><
tr><td width='41' align='left' valign='top'> </td><td width='34' align='lef
t' valign='top'>C) </td><td width='711' align='left' valign='top'>Job que
ue</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
4' align='left' valign='top'>D) </td><td width='711' align='left' valign=
'top'>None of the above</td></tr></table><table border='0' width='600' id='table
1_0_14'><tr><td width='41' align='left' valign='top'>Q.15 </td><td width=
'749' align='left' valign='top' colspan='2'>The priority or importance of a job
is defined by it s ______</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>A) </td><td width='71
1' align='left' valign='top'>nice number</td></tr><tr><td width='41' align='left
' valign='top'> </td><td width='34' align='left' valign='top'>B) </t
d><td width='711' align='left' valign='top'>good number</td></tr><tr><td width='
41' align='left' valign='top'> </td><td width='34' align='left' valign='top
'>C) </td><td width='711' align='left' valign='top'>priority number</td><

='left' valign='top'>D) </td><td width='711' align='left' valign='top'>no
ne of the above</td></tr></table><table border='0' width='600' id='table1_0_15'>
<tr><td width='41' align='left' valign='top'>Q.16 </td><td width='749' al
ign='left' valign='top' colspan='2'>Each process accessing the shared data e
xcludes all others from doing so simultaneously is called as _____</td></tr>
<tr><td width='41' align='left' valign='top'> </td><td width='34' align='le
ft' valign='top'>A) </td><td width='711' align='left' valign='top'>Mutual
Exclusion</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>B) </td><td width='711' align='left'
valign='top'>Critical Exclusion</td></tr><tr><td width='41' align='left' valign
='top'> </td><td width='34' align='left' valign='top'>C) </td><td wi
dth='711' align='left' valign='top'>Reasonable Exclusion</td></tr><tr><td width=
'41' align='left' valign='top'> </td><td width='34' align='left' valign='to
p'>D) </td><td width='711' align='left' valign='top'>None of above</td></
tr></table><table border='0' width='600' id='table1_0_16'><tr><td width='41' ali
gn='left' valign='top'>Q.17 </td><td width='749' align='left' valign='top
' colspan='2'> ______ writes message to all connected users</td></tr><tr><td
ign='top'>A) </td><td width='711' align='left' valign='top'>write</td></t
r><tr><td width='41' align='left' valign='top'> </td><td width='34' align='
left' valign='top'>B) </td><td width='711' align='left' valign='top'>wall
</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'>C) </td><td width='711' align='left' valign='t
op'>Both A and B</td></tr><tr><td width='41' align='left' valign='top'> </t
d><td width='34' align='left' valign='top'>D) </td><td width='711' align=
'left' valign='top'>Who</td></tr></table><table border='0' width='600' id='table
'749' align='left' valign='top' colspan='2'>Linux community communicates via</td
></tr><tr><td width='41' align='left' valign='top'> </td><td width='34' ali
gn='left' valign='top'>A) </td><td width='711' align='left' valign='top'>
mailing lists</td></tr><tr><td width='41' align='left' valign='top'> </td><
td width='34' align='left' valign='top'>B) </td><td width='711' align='le
ft' valign='top'>usenet newsgroup</td></tr><tr><td width='41' align='left' valig
n='top'> </td><td width='34' align='left' valign='top'>C) </td><td w
idth='711' align='left' valign='top'>Both A and B</td></tr><tr><td width='41' al
ign='left' valign='top'> </td><td width='34' align='left' valign='top'>D
) </td><td width='711' align='left' valign='top'>Neither A nor B</td></tr></
table><table border='0' width='600' id='table1_0_18'><tr><td width='41' align='l
eft' valign='top'>Q.19 </td><td width='749' align='left' valign='top' col
span='2'>A process is ____ if it cannot affect or affected by the other proc
esses executing in system</td></tr><tr><td width='41' align='left' valign='t
op'> </td><td width='34' align='left' valign='top'>A) </td><td width
='711' align='left' valign='top'>Shared</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>B) </td
><td width='711' align='left' valign='top'>Co-operating</td></tr><tr><td width='
'>C) </td><td width='711' align='left' valign='top'>Temporary</td></tr><t
r><td width='41' align='left' valign='top'> </td><td width='34' align='left
' valign='top'>D) </td><td width='711' align='left' valign='top'>Independ
ent</td></tr></table><table border='0' width='600' id='table1_0_19'><tr><td widt
h='41' align='left' valign='top'>Q.20 </td><td width='749' align='left' v
align='top' colspan='2'>Multiple tasks can be accomplished and multiple devi
ces can be accessed at the same time is _______</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' valign='top'>A) </td><td width='711' align='left' valign='top'>Full multitasking</td></t
left' valign='top'>B) </td><td width='711' align='left' valign='top'>Mult
itasking</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
dth='34' align='left' valign='top'>C) </td><td width='711' align='left' v
align='top'>Part multitasking</td></tr><tr><td width='41' align='left' valign='t

op'> </td><td width='34' align='left' valign='top'>D) </td><td width
='711' align='left' valign='top'>None of the above</td></tr></table><table borde
r='0' width='600' id='table1_0_20'><tr><td width='41' align='left' valign='top'>
Q.21 </td><td width='749' align='left' valign='top' colspan='2'>In ______
stage code is usually considered stable and complete</td></tr><tr><td width
op'>A) </td><td width='711' align='left' valign='top'>Alpha stage</td></t
left' valign='top'>B) </td><td width='711' align='left' valign='top'>Beta
stage</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
h='34' align='left' valign='top'>C) </td><td width='711' align='left' val
ign='top'>Gamma stage</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'>D) </td><td width='711' a
lign='left' valign='top'>All of the above</td></tr></table><table border='0' wid
th='600' id='table1_0_21'><tr><td width='41' align='left' valign='top'>Q.22 </td><td width='749' align='left' valign='top' colspan='2'>Encore s version of UN
IX for the Multimax computer is _______</td></tr><tr><td width='41' align='l
eft' valign='top'> </td><td width='34' align='left' valign='top'>A) 
</td><td width='711' align='left' valign='top'>Parallel multiprocessing system</
'>Symmetric multiprocessing system</td></tr><tr><td width='41' align='left' vali
gn='top'> </td><td width='34' align='left' valign='top'>C) </td><td
width='711' align='left' valign='top'>Both A and B</td></tr><tr><td width='41' a
lign='left' valign='top'> </td><td width='34' align='left' valign='top'>
D) </td><td width='711' align='left' valign='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'>Q.23 </td><td width='749' align='left' valign='top'
colspan='2'> ______ is used for filtering input lines and returning certain
patterns to the output</td></tr><tr><td width='41' align='left' valign='top'>&nb
sp;</td><td width='34' align='left' valign='top'>A) </td><td width='711'
align='left' valign='top'>grep</td></tr><tr><td width='41' align='left' valign='
top'> </td><td width='34' align='left' valign='top'>B) </td><td widt
h='711' align='left' valign='top'>grap</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>C) </td>
<td width='711' align='left' valign='top'>grape</td></tr><tr><td width='41' alig
n='left' valign='top'> </td><td width='34' align='left' valign='top'>D)
</td><td width='711' align='left' valign='top'>grepe</td></tr></table><table
border='0' width='600' id='table1_0_23'><tr><td width='41' align='left' valign=
'top'>Q.24 </td><td width='749' align='left' valign='top' colspan='2'>Pro
cess is said to be in critical section when it is ______</td></tr><tr><td wi
dth='41' align='left' valign='top'> </td><td width='34' align='left' valign
='top'>A) </td><td width='711' align='left' valign='top'>accessing shared
modifiable data</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>accessing unshared modifiable data</td></tr><tr><td width='4
>C) </td><td width='711' align='left' valign='top'>accessing shared unmod
ifiable data</td></tr><tr><td width='41' align='left' valign='top'> </td><t
d width='34' align='left' valign='top'>D) </td><td width='711' align='lef
t' valign='top'>accessing unshared unmodifiable data</td></tr></table><table bor
der='0' width='600' id='table1_0_24'><tr><td width='41' align='left' valign='top
'>Q.25 </td><td width='749' align='left' valign='top' colspan='2'> An ope
rating System is a program that acts as an intermediary between _____ and __
___.</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=
'34' align='left' valign='top'>A) </td><td width='711' align='left' valig
n='top'>user and software</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>B) </td><td width='71
1' align='left' valign='top'>user hardware</td></tr><tr><td width='41' align='le
ft' valign='top'> </td><td width='34' align='left' valign='top'>C) <

/td><td width='711' align='left' valign='top'>Software and hardware</td></tr><tr
valign='top'>D) </td><td width='711' align='left' valign='top'>none of a
bove</td></tr></table><table border='0' width='600' id='table1_0_25'><tr><td wid
th='41' align='left' valign='top'>Q.26 </td><td width='749' align='left'
valign='top' colspan='2'> ____ allows to link command together</td></tr><tr><td
gn='top'>A) </td><td width='711' align='left' valign='top'>Pipes</td></tr
eft' valign='top'>B) </td><td width='711' align='left' valign='top'>Ordin
ary files</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>Special files</td></tr><tr><td width='41' align='left' valign='top'
> </td><td width='34' align='left' valign='top'>D) </td><td width='7
11' align='left' valign='top'>None of these</td></tr></table><table border='0' w
idth='600' id='table1_0_26'><tr><td width='41' align='left' valign='top'>Q.27
</td><td width='749' align='left' valign='top' colspan='2'> ______ command
offered by Bash, displays how long a command takes to execute</td></tr><tr><
td width='41' align='left' valign='top'> </td><td width='34' align='left' v
align='top'>A) </td><td width='711' align='left' valign='top'>time</td></
'left' valign='top'>B) </td><td width='711' align='left' valign='top'>tim
e make</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
ign='top'>make time</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>D) </td><td width='711' ali
gn='left' valign='top'>wait time</td></tr></table><table border='0' width='600'
id='table1_0_27'><tr><td width='41' align='left' valign='top'>Q.28 </td><
td width='749' align='left' valign='top' colspan='2'>To see which connected user
accepts messages from others use ______</td></tr><tr><td width='41' align='
left' valign='top'> </td><td width='34' align='left' valign='top'>A) </td><td width='711' align='left' valign='top'>who w</td></tr><tr><td width='41' a
B) </td><td width='711' align='left' valign='top'>who p</td></tr><tr><td width=
p'>C) </td><td width='711' align='left' valign='top'>who a</td></tr><tr><td
gn='top'>D) </td><td width='711' align='left' valign='top'>who mesg</td><
/tr></table><table border='0' width='600' id='table1_0_28'><tr><td width='41' al
ign='left' valign='top'>Q.29 </td><td width='749' align='left' valign='to
p' colspan='2'> ______ command throws content of text files on the screen</t
>ls</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
34' align='left' valign='top'>B) </td><td width='711' align='left' valign
='top'>cd</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>cat</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>pwd</td></tr></table><table border='0' width='600' id='table
'749' align='left' valign='top' colspan='2'> _______ is the first instance where
the operating system must make decisions for users.</td></tr><tr><td wi
='top'>A) </td><td width='711' align='left' valign='top'>Time Sharing</td
gn='left' valign='top'>B) </td><td width='711' align='left' valign='top'>
Multiprocessing</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>C) </td><td width='711' align='
left' valign='top'>Multiprogramming</td></tr><tr><td width='41' align='left' val

ign='top'> </td><td width='34' align='left' valign='top'>D) </td><td
width='711' align='left' valign='top'>All of the above</td></tr></table><table
border='0' width='600' id='table1_0_30'><tr><td width='41' align='left' valign='
top'>Q.31 </td><td width='749' align='left' valign='top' colspan='2'>A ti
me quantum is generally from _____</td></tr><tr><td width='41' align='left' vali
width='711' align='left' valign='top'>10 to 100 milliseconds</td></tr><tr><td wi
='top'>B) </td><td width='711' align='left' valign='top'>10 to 100 second
s</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34
' align='left' valign='top'>C) </td><td width='711' align='left' valign='
top'>10 to 100 nanoseconds</td></tr><tr><td width='41' align='left' valign='top'
11' align='left' valign='top'>10 to 100 picoseconds</td></tr></table><table bord
er='0' width='600' id='table1_0_31'><tr><td width='41' align='left' valign='top'
>Q.32 </td><td width='749' align='left' valign='top' colspan='2'>The ____
_ scheduler selects processes from the pool and loads them into memory for execution</td></tr><tr><td width='41' align='left' valign='top'> </td><t
d width='34' align='left' valign='top'>A) </td><td width='711' align='lef
t' valign='top'>Short term</td></tr><tr><td width='41' align='left' valign='top'
11' align='left' valign='top'>Long term</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>C) </td
><td width='711' align='left' valign='top'>Big term</td></tr><tr><td width='41'
>D) </td><td width='711' align='left' valign='top'>Small term</td></tr></tab
le><table border='0' width='600' id='table1_0_32'><tr><td width='41' align='left
n='2'>To create a primary DOS partition _____ standard DOS utility is used</
lign='left' valign='top'>A) </td><td width='711' align='left' valign='top
'>DISK</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
h='34' align='left' valign='top'>B) </td><td width='711' align='left' val
ign='top'>PDISK</td></tr><tr><td width='41' align='left' valign='top'> </td
left' valign='top'>BDISK</td></tr><tr><td width='41' align='left' valign='top'>&
nbsp;</td><td width='34' align='left' valign='top'>D) </td><td width='711
' align='left' valign='top'>FDISK</td></tr></table><table border='0' width='600'
id='table1_0_33'><tr><td width='41' align='left' valign='top'>Q.34 </td>
<td width='749' align='left' valign='top' colspan='2'>Linux is known for ____</t
>User friendly installation</td></tr><tr><td width='41' align='left' valign='top
'> </td><td width='34' align='left' valign='top'>B) </td><td width='
711' align='left' valign='top'>Weak cryptography</td></tr><tr><td width='41' ali
gn='left' valign='top'> </td><td width='34' align='left' valign='top'>C)
</td><td width='711' align='left' valign='top'>Small documentation</td></tr
eft' valign='top'>D) </td><td width='711' align='left' valign='top'>Multi
user OS</td></tr></table><table border='0' width='600' id='table1_0_34'><tr><td
width='41' align='left' valign='top'>Q.35 </td><td width='749' align='le
ft' valign='top' colspan='2'>Binding of instructions and data to memory addr
esses can be done at which of following steps a. Compile Time b. Loa
d Time c. Execution Time</td></tr><tr><td width='41' align='left' valign='to
p'> </td><td width='34' align='left' valign='top'>A) </td><td width=
'711' align='left' valign='top'>only a</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>B) </td>
<td width='711' align='left' valign='top'>only b</td></tr><tr><td width='41' ali
gn='left' valign='top'> </td><td width='34' align='left' valign='top'>C)
</td><td width='711' align='left' valign='top'>only c</td></tr><tr><td widt

h='41' align='left' valign='top'> </td><td width='34' align='left' valign='
top'>D) </td><td width='711' align='left' valign='top'>All of the above</
td></tr></table><table border='0' width='600' id='table1_0_35'><tr><td width='41
' align='left' valign='top'>Q.36 </td><td width='749' align='left' valign
='top' colspan='2'>Browsing to next page is done by using</td></tr><tr><td width
op'>A) </td><td width='711' align='left' valign='top'>enter</td></tr><tr>
<td width='41' align='left' valign='top'> </td><td width='34' align='left'
valign='top'>B) </td><td width='711' align='left' valign='top'>tab</td></
'left' valign='top'>C) </td><td width='711' align='left' valign='top'>ctr
l + shift</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
idth='34' align='left' valign='top'>D) </td><td width='711' align='left'
valign='top'>space</td></tr></table><table border='0' width='600' id='table1_0_3
6'><tr><td width='41' align='left' valign='top'>Q.37 </td><td width='749'
align='left' valign='top' colspan='2'>Out of the following which is a journalin
g filesystem</td></tr><tr><td width='41' align='left' valign='top'> </t
d><td width='34' align='left' valign='top'>A) </td><td width='711' align=
'left' valign='top'>ext2fs</td></tr><tr><td width='41' align='left' valign='top'
11' align='left' valign='top'>ext3fs</td></tr><tr><td width='41' align='left' va
d width='711' align='left' valign='top'>2.2.x</td></tr><tr><td width='41' align=
b></td><td width='711' align='left' valign='top'>2.4.x</td></tr></table><table b
order='0' width='600' id='table1_0_37'><tr><td width='41' align='left' valign='t
op'>Q.38 </td><td width='749' align='left' valign='top' colspan='2'>A dea
dlock situation can arise if a. Mutual exclusion b. Hold and wait c.
No preemption d. Circular wait</td></tr><tr><td width='41' align='left' val
ign='top'> </td><td width='34' align='left' valign='top'>A) </td><td
width='711' align='left' valign='top'>a, b, c</td></tr><tr><td width='41' align
='left' valign='top'> </td><td width='34' align='left' valign='top'>B) </td><td width='711' align='left' valign='top'>b, c, d</td></tr><tr><td width
op'>C) </td><td width='711' align='left' valign='top'>a, c, d</td></tr><t
' valign='top'>D) </td><td width='711' align='left' valign='top'>a, b, c,
d</td></tr></table><table border='0' width='600' id='table1_0_38'><tr><td width
='41' align='left' valign='top'>Q.39 </td><td width='749' align='left' va
lign='top' colspan='2'>Named pipe file type is denoted by ______ character</
'>c</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
='top'>s</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
align='top'>p</td></tr><tr><td width='41' align='left' valign='top'> </td><
td width='34' align='left' valign='top'>D) </td><td width='711' align='le
ft' valign='top'>d</td></tr></table><table border='0' width='600' id='table1_0_3
9'><tr><td width='41' align='left' valign='top'>Q.40 </td><td width='749'
align='left' valign='top' colspan='2'>BIOS is _______</td></tr><tr><td width='4
>A) </td><td width='711' align='left' valign='top'>Basic Input / Output S
ystem</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
='34' align='left' valign='top'>B) </td><td width='711' align='left' vali
gn='top'>Basis Input / Output System</td></tr><tr><td width='41' align='left' va
d width='711' align='left' valign='top'>Both A and B</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' valign='top'>D) </td><td width='711' align='left' valign='top'>Neither A nor B</td></tr

colspan='2'>In Tooth operating system fixed size of messages is _______</td>
</tr><tr><td width='41' align='left' valign='top'> </td><td width='34' alig
n='left' valign='top'>A) </td><td width='711' align='left' valign='top'>8
words</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
ign='top'>16 words</td></tr><tr><td width='41' align='left' valign='top'> <
/td><td width='34' align='left' valign='top'>C) </td><td width='711' alig
n='left' valign='top'>32 words</td></tr><tr><td width='41' align='left' valign='
top'> </td><td width='34' align='left' valign='top'>D) </td><td widt
h='711' align='left' valign='top'>4 words</td></tr></table><table border='0' wid
th='600' id='table1_0_41'><tr><td width='41' align='left' valign='top'>Q.42 </td><td width='749' align='left' valign='top' colspan='2'>The speed up ratio
with n processors is</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'>A) </td><td width='711' a
lign='left' valign='top'>n</td></tr><tr><td width='41' align='left' valign='top'
11' align='left' valign='top'>less than n</td></tr><tr><td width='41' align='lef
t' valign='top'> </td><td width='34' align='left' valign='top'>C) </
td><td width='711' align='left' valign='top'>greater n</td></tr><tr><td width='4
>D) </td><td width='711' align='left' valign='top'>nn</td></tr></table><t
able border='0' width='600' id='table1_0_42'><tr><td width='41' align='left' val
ign='top'>Q.43 </td><td width='749' align='left' valign='top' colspan='2'
>Vim stands for</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>A) </td><td width='711' align='
left' valign='top'>Very important</td></tr><tr><td width='41' align='left' valig
n='top'> </td><td width='34' align='left' valign='top'>B) </td><td w
idth='711' align='left' valign='top'>Very improved</td></tr><tr><td width='41' a
C) </td><td width='711' align='left' valign='top'>Vi Improved</td></tr><tr><
align='top'>D) </td><td width='711' align='left' valign='top'>Vi Imitatio
n</td></tr></table><table border='0' width='600' id='table1_0_43'><tr><td width=
'41' align='left' valign='top'>Q.44 </td><td width='749' align='left' val
ign='top' colspan='2'> _____ real-time system guarantees that critical tasks
complete on time</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>A) </td><td width='711' align
='left' valign='top'>Hard</td></tr><tr><td width='41' align='left' valign='top'>
1' align='left' valign='top'>Soft</td></tr><tr><td width='41' align='left' valig
n='top'> </td><td width='34' align='left' valign='top'>C) </td><td w
idth='711' align='left' valign='top'>Both A) and B)</td></tr><tr><td width='41'
>D) </td><td width='711' align='left' valign='top'>None of above</td></tr></
table><table border='0' width='600' id='table1_0_44'><tr><td width='41' align='l
eft' valign='top'>Q.45 </td><td width='749' align='left' valign='top' col
span='2'>Informally, a process is _______</td></tr><tr><td width='41' align='lef
t' valign='top'> </td><td width='34' align='left' valign='top'>A) </
td><td width='711' align='left' valign='top'>program to be executed</td></tr><tr
valign='top'>B) </td><td width='711' align='left' valign='top'>completel
y executed program</td></tr><tr><td width='41' align='left' valign='top'> <
n='left' valign='top'>program in execution</td></tr><tr><td width='41' align='le
ft' valign='top'> </td><td width='34' align='left' valign='top'>D) <
/td><td width='711' align='left' valign='top'>program to be coded</td></tr></tab

n='2'> _______ is not a task performed by Memory resident portion of Linux</
'>I/O management</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>Process management</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>C) </td>
<td width='711' align='left' valign='top'>File Management</td></tr><tr><td width
op'>D) </td><td width='711' align='left' valign='top'>None of the task</t
d></tr></table><table border='0' width='600' id='table1_0_46'><tr><td width='41'
align='left' valign='top'>Q.47 </td><td width='749' align='left' valign=
'top' colspan='2'> _____ aims to ensure that the data remains intact on disk
despite a system crash, power outage or other mishap.</td></tr><tr><td widt
top'>A) </td><td width='711' align='left' valign='top'>Security</td></tr>
ft' valign='top'>B) </td><td width='711' align='left' valign='top'>Journa
ling</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=
'34' align='left' valign='top'>C) </td><td width='711' align='left' valig
n='top'>Both A) and B)</td></tr><tr><td width='41' align='left' valign='top'>&nb
sp;</td><td width='34' align='left' valign='top'>D) </td><td width='711'
align='left' valign='top'>Neither A) nor B)</td></tr></table><table border='0' w
</td><td width='749' align='left' valign='top' colspan='2'>Primary partitio
n can be set as ______</td></tr><tr><td width='41' align='left' valign='top'>&nb
align='left' valign='top'>Bootable</td></tr><tr><td width='41' align='left' vali
gn='top'> </td><td width='34' align='left' valign='top'>B) </td><td
width='711' align='left' valign='top'>Non bootable</td></tr><tr><td width='41' a
C) </td><td width='711' align='left' valign='top'>Both A) and B)</td></tr><t
' valign='top'>D) </td><td width='711' align='left' valign='top'>Neither
A) nor B)</td></tr></table><table border='0' width='600' id='table1_0_48'><tr><t
d width='41' align='left' valign='top'>Q.49 </td><td width='749' align='l
eft' valign='top' colspan='2'> ____ program interprets each command being ex
ecuted</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
h='34' align='left' valign='top'>A) </td><td width='711' align='left' val
ign='top'>Editor</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>
Shell</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
='34' align='left' valign='top'>C) </td><td width='711' align='left' vali
gn='top'>Kernel</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>D) </td><td width='711' align='
left' valign='top'>None of these</td></tr></table><table border='0' width='600'
td width='749' align='left' valign='top' colspan='2'>In ____ real-time system ta
sk gets priority over other tasks, and retains that priority until it co
mpletes</td></tr><tr><td width='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'>A) </td><td width='711' align='left' va
lign='top'>Hard</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>B) </td><td width='711' align='
left' valign='top'>Soft</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'>C) </td><td width='711'
align='left' valign='top'>Both A) and B)</td></tr><tr><td width='41' align='lef
t' valign='top'> </td><td width='34' align='left' valign='top'>D) </
td><td width='711' align='left' valign='top'>None of above</td></tr></table><tab
le border='0' width='600' id='table1_0_50'><tr><td width='41' align='left' valig

n='top'>Q.51 </td><td width='749' align='left' valign='top' colspan='2'>T
he primary of an Operating System is</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'>A) </td><t
d width='711' align='left' valign='top'>Running programs</td></tr><tr><td width=
p'>B) </td><td width='711' align='left' valign='top'>User Convenience</td
gn='left' valign='top'>C) </td><td width='711' align='left' valign='top'>
Ensuring smooth functioning of hardware</td></tr><tr><td width='41' align='left'
><td width='711' align='left' valign='top'>None of this</td></tr></table><table
border='0' width='600' id='table1_0_51'><tr><td width='41' align='left' valign='
top'>Q.52 </td><td width='749' align='left' valign='top' colspan='2'>Comm
on output devices in early computers were a. Card reader b. Line Pri
nters c. Tape drives d. Card punches</td></tr><tr><td width='41' align='
></td><td width='711' align='left' valign='top'>a, b, c, d</td></tr><tr><td widt
top'>B) </td><td width='711' align='left' valign='top'>b, c, d</td></tr><
t' valign='top'>C) </td><td width='711' align='left' valign='top'>a, b, c
align='left' valign='top'>D) </td><td width='711' align='left' valign='t
op'>None of above</td></tr></table><table border='0' width='600' id='table1_0_52
'><tr><td width='41' align='left' valign='top'>Q.53 </td><td width='749'
align='left' valign='top' colspan='2'>_______ is the first file system is first
to run under Linux</td></tr><tr><td width='41' align='left' valign='top'>&nb
align='left' valign='top'>Unix</td></tr><tr><td width='41' align='left' valign='
h='711' align='left' valign='top'>Linux</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>C) </td
><td width='711' align='left' valign='top'>Minix</td></tr><tr><td width='41' ali
gn='left' valign='top'> </td><td width='34' align='left' valign='top'>D)
</td><td width='711' align='left' valign='top'>None of the above</td></tr><
/table><table border='0' width='600' id='table1_0_53'><tr><td width='41' align='
left' valign='top'>Q.54 </td><td width='749' align='left' valign='top' co
lspan='2'>Typically 1 inode is counted on having</td></tr><tr><td width='41' ali
gn='left' valign='top'> </td><td width='34' align='left' valign='top'>A)
</td><td width='711' align='left' valign='top'>4 to 8 KB</td></tr><tr><td w
idth='41' align='left' valign='top'> </td><td width='34' align='left' valig
n='top'>B) </td><td width='711' align='left' valign='top'>2 to 6 KB</td><
='left' valign='top'>C) </td><td width='711' align='left' valign='top'>4
to 6 KB</td></tr><tr><td width='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'>D) </td><td width='711' align='left' va
lign='top'>2 to 8 KB</td></tr></table><table border='0' width='600' id='table1_0
_54'><tr><td width='41' align='left' valign='top'>Q.55 </td><td width='74
9' align='left' valign='top' colspan='2'>The state may be</td></tr><tr><td width
op'>A) </td><td width='711' align='left' valign='top'>Running</td></tr><t
' valign='top'>B) </td><td width='711' align='left' valign='top'>Waiting<
/td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'>C) </td><td width='711' align='left' valign='to
p'>Halted</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>All of the above</td></tr></table><table border='0' width='600' id=
'table1_0_55'><tr><td width='41' align='left' valign='top'>Q.56 </td><td
width='749' align='left' valign='top' colspan='2'>Primary partitions are ______<

align='left' valign='top'>A) </td><td width='711' align='left' valign='to
p'>Logical partitions</td></tr><tr><td width='41' align='left' valign='top'>&nbs
p;</td><td width='34' align='left' valign='top'>B) </td><td width='711' a
lign='left' valign='top'>Legal partitions</td></tr><tr><td width='41' align='lef
td><td width='711' align='left' valign='top'>True partitions</td></tr><tr><td wi
='top'>D) </td><td width='711' align='left' valign='top'>False partitions
</td></tr></table><table border='0' width='600' id='table1_0_56'><tr><td width='
41' align='left' valign='top'>Q.57 </td><td width='749' align='left' vali
gn='top' colspan='2'> _______ are servers processes that run continuously.</
'>Daemons</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
idth='34' align='left' valign='top'>B) </td><td width='711' align='left'
valign='top'>Demons</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>C) </td><td width='711' ali
gn='left' valign='top'>Damons</td></tr><tr><td width='41' align='left' valign='t
='711' align='left' valign='top'>None of the above</td></tr></table><table borde
r='0' width='600' id='table1_0_57'><tr><td width='41' align='left' valign='top'>
Q.58 </td><td width='749' align='left' valign='top' colspan='2'> ______ a
bstracted the key notions of mutual expressions in his concept of semaph
ores.</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
gn='top'>Dekker</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>B) </td><td width='711' align='
left' valign='top'>Dijkstra</td></tr><tr><td width='41' align='left' valign='top
711' align='left' valign='top'>D Morgan</td></tr><tr><td width='41' align='left'
><td width='711' align='left' valign='top'>None of above</td></tr></table><table
'top'>Q.59 </td><td width='749' align='left' valign='top' colspan='2'>The
registers vary in number and type, depending on _____</td></tr><tr><td widt
top'>A) </td><td width='711' align='left' valign='top'>Computer Architect
ure</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
='top'>Process state</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'>C) </td><td width='711' al
ign='left' valign='top'>Program Counter</td></tr><tr><td width='41' align='left'
><td width='711' align='left' valign='top'>None of above</td></tr></table><table
'top'>Q.60 </td><td width='749' align='left' valign='top' colspan='2'>If
system can allocate resources to each process (up to its maximum) in some or
der and still avoid a deadlock, system is said to be ______</td></tr><tr
valign='top'>A) </td><td width='711' align='left' valign='top'>Unsafe</t
>Safe</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
gn='top'>
Secure</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
h='34' align='left' valign='top'>D) </td><td width='711' align='left' val
ign='top'>
Unsecure</td></tr></table><table border='0' width='600' id='table1_0_60'><tr><td

ft' valign='top' colspan='2'>When the whole screen is black, showing charact
ers you are in _____ mode</td></tr><tr><td width='41' align='left' valign='top'>
1' align='left' valign='top'>Write</td></tr><tr><td width='41' align='left' vali
gn='top'> </td><td width='34' align='left' valign='top'>B) </td><td
width='711' align='left' valign='top'>Read</td></tr><tr><td width='41' align='le
/td><td width='711' align='left' valign='top'>Text</td></tr><tr><td width='41' a
D) </td><td width='711' align='left' valign='top'>Graphic</td></tr></table><
table border='0' width='600' id='table1_0_61'><tr><td width='41' align='left' va
lign='top'>Q.62 </td><td width='749' align='left' valign='top' colspan='2
'>The processors can share</td></tr><tr><td width='41' align='left' valign='top'
> </td><td width='34' align='left' valign='top'>A) </td><td width='7
11' align='left' valign='top'>Peripherals</td></tr><tr><td width='41' align='lef
t' valign='top'> </td><td width='34' align='left' valign='top'>B) </
td><td width='711' align='left' valign='top'>Cabinets</td></tr><tr><td width='41
' align='left' valign='top'> </td><td width='34' align='left' valign='top'>
C) </td><td width='711' align='left' valign='top'>Power Supplies</td></tr
eft' valign='top'>D) </td><td width='711' align='left' valign='top'>All t
he above</td></tr></table><table border='0' width='600' id='table1_0_62'><tr><td
ft' valign='top' colspan='2'>You are in ____ mode when the whole screen is b
lack</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=
'34' align='left' valign='top'>A) </td><td width='711' align='left' valig
n='top'>Graphical</td></tr><tr><td width='41' align='left' valign='top'> </
='left' valign='top'>Text</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>C) </td><td width='71
1' align='left' valign='top'>
Both A) and B)</td></tr><tr><td width='41' align='left' valign='top'> </td>
<td width='34' align='left' valign='top'>D) </td><td width='711' align='l
eft' valign='top'>Neither A) nor B)</td></tr></table><table border='0' width='60
0' id='table1_0_63'><tr><td width='41' align='left' valign='top'>Q.64 </t
d><td width='749' align='left' valign='top' colspan='2'> ______ partitions are u
sed to support virtual memory</td></tr><tr><td width='41' align='left' valig
n='top'> </td><td width='34' align='left' valign='top'>A) </td><td w
idth='711' align='left' valign='top'>Full Partition</td></tr><tr><td width='41'
>B) </td><td width='711' align='left' valign='top'>Swap Partition</td></tr><
t' valign='top'>C) </td><td width='711' align='left' valign='top'>Both A
and B</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
='34' align='left' valign='top'>D) </td><td width='711' align='left' vali
gn='top'>Neither A nor B</td></tr></table><table border='0' width='600' id='tabl
e1_0_64'><tr><td width='41' align='left' valign='top'>Q.65 </td><td width
='749' align='left' valign='top' colspan='2'>Process may create several new proc
esses, via _____</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'>A) </td><td width='711' al
ign='left' valign='top'>create process system call</td></tr><tr><td width='41' a
B) </td><td width='711' align='left' valign='top'>new process system call</t
ign='left' valign='top'>C) </td><td width='711' align='left' valign='top'
>Both A) and B)</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>D) </td><td width='711' align='
left' valign='top'>Neither A) nor B)</td></tr></table><table border='0' width='6
00' id='table1_0_65'><tr><td width='41' align='left' valign='top'>Q.66 </

td><td width='749' align='left' valign='top' colspan='2'>Dekker s Algorithm is a ___
__ solution to the mutual exclusion problem.</td></tr><tr><td width='41' ali
</td><td width='711' align='left' valign='top'>Software</td></tr><tr><td wi
='top'>B) </td><td width='711' align='left' valign='top'>Hardware</td></t
left' valign='top'>C) </td><td width='711' align='left' valign='top'>Both
A) and B)</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>D) </td><td width='711' align='left'
valign='top'>Neither A) nor B)</td></tr></table><table border='0' width='600' i
d='table1_0_66'><tr><td width='41' align='left' valign='top'>Q.67 </td><t
d width='749' align='left' valign='top' colspan='2'>As a process executes, it ch
anges</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
gn='top'>Time</td></tr><tr><td width='41' align='left' valign='top'> </td><
ft' valign='top'>Processor</td></tr><tr><td width='41' align='left' valign='top'
> </td><td width='34' align='left' valign='top'>C) </td><td width='7
11' align='left' valign='top'>State</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>Program</td></tr></table><table border='0
' width='600' id='table1_0_67'><tr><td width='41' align='left' valign='top'>Q
.68 </td><td width='749' align='left' valign='top' colspan='2'>As process ex
ecutes it changes ______</td></tr><tr><td width='41' align='left' valign='top'>&
nbsp;</td><td width='34' align='left' valign='top'>A) </td><td width='711
' align='left' valign='top'>File</td></tr><tr><td width='41' align='left' valign
='top'> </td><td width='34' align='left' valign='top'>B) </td><td wi
dth='711' align='left' valign='top'>Directory</td></tr><tr><td width='41' align=
'left' valign='top'> </td><td width='34' align='left' valign='top'>C) </td><td width='711' align='left' valign='top'>Path</td></tr><tr><td width='41
D) </td><td width='711' align='left' valign='top'>State</td></tr></table>
<table border='0' width='600' id='table1_0_68'><tr><td width='41' align='left' v
align='top'>Q.69 </td><td width='749' align='left' valign='top' colspan='
2'> IPC is</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>A) </td><td width='711' align='left'
valign='top'>Interrelated Process Communication</td></tr><tr><td width='41' ali
gn='left' valign='top'> </td><td width='34' align='left' valign='top'>B)
</td><td width='711' align='left' valign='top'>Inter Process Communication<
align='left' valign='top'>C) </td><td width='711' align='left' valign='to
p'>Integrated Process Communication</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>None of the above</td></tr></table><table
'top'>Q.70 </td><td width='749' align='left' valign='top' colspan='2'> __
____ means changing the access mode of a file.</td></tr><tr><td width='41' a
A) </td><td width='711' align='left' valign='top'>ch mode</td></tr><tr><td w
n='top'>B) </td><td width='711' align='left' valign='top'>chmode</td></tr
eft' valign='top'>C) </td><td width='711' align='left' valign='top'>ch mo
d</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34
' align='left' valign='top'>D) </td><td width='711' align='left' valign='
top'>chmod</td></tr></table><table border='0' width='600' id='table1_0_70'><tr><
td width='41' align='left' valign='top'>Q.71 </td><td width='749' align='
left' valign='top' colspan='2'>Many Unix operating systems _____ or more</td

gn='left' valign='top'>A) </td><td width='711' align='left' valign='top'>
500 MB</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
ign='top'>1000 MB</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>C) </td><td width='711' align
='left' valign='top'>1500 MB</td></tr><tr><td width='41' align='left' valign='to
p'> </td><td width='34' align='left' valign='top'>D) </td><td width=
'711' align='left' valign='top'>150 MB</td></tr></table><table border='0' width=
'600' id='table1_0_71'><tr><td width='41' align='left' valign='top'>Q.72 
</td><td width='749' align='left' valign='top' colspan='2'>Types of Linux proces
ses are a. Interactive b. Automatic c. Daemons</td></tr><tr><td widt
top'>A) </td><td width='711' align='left' valign='top'>only a</td></tr><t
' valign='top'>B) </td><td width='711' align='left' valign='top'>only b</
lign='left' valign='top'>C) </td><td width='711' align='left' valign='top
'>only c</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
dth='34' align='left' valign='top'>D) </td><td width='711' align='left' v
align='top'>All of above</td></tr></table><table border='0' width='600' id='tabl
='749' align='left' valign='top' colspan='2'>The full form of vi editor is</td><
='left' valign='top'>A) </td><td width='711' align='left' valign='top'>Vi
rtual editor</td></tr><tr><td width='41' align='left' valign='top'> </td><t
d width='34' align='left' valign='top'>B) </td><td width='711' align='lef
t' valign='top'>Visual editor</td></tr><tr><td width='41' align='left' valign='t
op'> </td><td width='34' align='left' valign='top'>C) </td><td width
='711' align='left' valign='top'>Vertical editor</td></tr><tr><td width='41' ali
</td><td width='711' align='left' valign='top'>None of these</td></tr></tab
n='2'> _______ is a program that acts as an intermediary between a user and
hardware</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
dth='34' align='left' valign='top'>A) </td><td width='711' align='left' v
align='top'>Programme</td></tr><tr><td width='41' align='left' valign='top'>&nbs
lign='left' valign='top'>Operating System</td></tr><tr><td width='41' align='lef
td><td width='711' align='left' valign='top'>Both A and B</td></tr><tr><td width
op'>D) </td><td width='711' align='left' valign='top'>None of this</td></
tr></table><table border='0' width='600' id='table1_0_74'><tr><td width='41' ali
gn='left' valign='top'>Q.75 </td><td width='749' align='left' valign='top
' colspan='2'> ______ is a test version</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>A) </td
><td width='711' align='left' valign='top'>Alpha version</td></tr><tr><td width=
p'>B) </td><td width='711' align='left' valign='top'>Beta version</td></t
left' valign='top'>C) </td><td width='711' align='left' valign='top'>Gamm
a Version</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>All of the above</td></tr></table><table border='0' width='600' id=
'table1_0_75'><tr><td width='41' align='left' valign='top'>Q.76 </td><td
width='749' align='left' valign='top' colspan='2'>Components of computer System
are a. Hardware b. Application System c. Operating System d. Use
rs</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
4' align='left' valign='top'>A) </td><td width='711' align='left' valign=

'top'>only a & b</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>a, b, c</td></tr><tr><td width='41' align='left' valign='top
711' align='left' valign='top'>b, c, d</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>D) </td>
<td width='711' align='left' valign='top'>a, b, c, d</td></tr></table><table bor
der='0' width='600' id='table1_0_76'><tr><td width='41' align='left' valign='top
'>Q.77 </td><td width='749' align='left' valign='top' colspan='2'>A proce
ss is ____ if it can affect or affected by the other processes executing in
system</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
h='34' align='left' valign='top'>A) </td><td width='711' align='left' val
ign='top'>Shared</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>Co-operating</td></tr><tr><td width='41' align='left' valign
dth='711' align='left' valign='top'>Temporary</td></tr><tr><td width='41' align=
b></td><td width='711' align='left' valign='top'>Independent</td></tr></table><t
able border='0' width='600' id='table1_0_77'><tr><td width='41' align='left' val
ign='top'>Q.78 </td><td width='749' align='left' valign='top' colspan='2'
> ________ is a logical extension of multiprogramming</td></tr><tr><td width
op'>A) </td><td width='711' align='left' valign='top'>Time Sharing</td></
'left' valign='top'>B) </td><td width='711' align='left' valign='top'>Bat
ch processing</td></tr><tr><td width='41' align='left' valign='top'> </td><
td width='34' align='left' valign='top'>C) </td><td width='711' align='le
ft' valign='top'>Multitasking</td></tr><tr><td width='41' align='left' valign='t
='711' align='left' valign='top'>Both A an B</td></tr></table><table border='0'
width='600' id='table1_0_78'><tr><td width='41' align='left' valign='top'>Q.7
9 </td><td width='749' align='left' valign='top' colspan='2'>Turnaround time
is</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
34' align='left' valign='top'>A) </td><td width='711' align='left' valign
='top'>time taken for execution of job</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>B) </td>
<td width='711' align='left' valign='top'>delay between job submission and job
completion</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>C) </td><td width='711' align='left'
valign='top'>both A & B</td></tr><tr><td width='41' align='left' valign='top'>&
' align='left' valign='top'>None of the above</td></tr></table><table border='0'
width='600' id='table1_0_79'><tr><td width='41' align='left' valign='top'>Q.
80 </td><td width='749' align='left' valign='top' colspan='2'> _____ is an e
laborate extension of minix filesystem</td></tr><tr><td width='41' align='le
ft' valign='top'> </td><td width='34' align='left' valign='top'>A) <
/td><td width='711' align='left' valign='top'>min</td></tr><tr><td width='41' al
ign='left' valign='top'> </td><td width='34' align='left' valign='top'>B
) </td><td width='711' align='left' valign='top'>lin</td></tr><tr><td width=
p'>C) </td><td width='711' align='left' valign='top'>exe</td></tr><tr><td
ign='top'>D) </td><td width='711' align='left' valign='top'>None of above
</td></tr></table> PART B <table border='0' width='6
00' id='table1_1_0'><tr><td width='41' align='left' valign='top'>Q.1 </td
><td width='749' align='left' valign='top' colspan='2'>Match the following S
et A i. chmod 400 file ii. chmod 500 directory iii. chmod 755 direct
ory iv. chmod 775 file Set B a. Standard file sharing mode for a gro
up b. To protect a file against accidental overwriting c. </td></tr>

ft' valign='top'>A) </td><td width='711' align='left' valign='top'>i-a, i
i-b, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>i-b, ii-d, iii-c, iv-a</td></tr><tr><td width='41' align='le
/td><td width='711' align='left' valign='top'>i-b, ii-a, iii-d, iv-c</td></tr><t
' valign='top'>D) </td><td width='711' align='left' valign='top'>i-b, iid, iii-a, iv-c</td></tr></table><table border='0' width='600' id='table1_1_1'><t
r><td width='41' align='left' valign='top'>Q.2 </td><td width='749' align
='left' valign='top' colspan='2'>The value for next CPU burst is predicted b
y the following equation</td></tr><tr><td width='41' align='left' valign='top'>&
' align='left' valign='top'>T(n+1) = atn + (1
a )Tn</td></tr><tr><td width='41' al
) </td><td width='711' align='left' valign='top'>T(n+1) = aTn + (1 a )Tn</td><
='left' valign='top'>C) </td><td width='711' align='left' valign='top'>T(
n+1) = atn + (1
a )tn</td></tr><tr><td width='41' align='left' valign='top'>
gn='left' valign='top'>T(n+1) = aTn + (1 a )tn</td></tr></table><table border='0'
</td><td width='749' align='left' valign='top' colspan='2'>Methods for deali
ng with deadlock problem is a. use a protocol to ensure that the system
will never enter a deadlock state b. allow the system to enter a deadloc
k state and then recover c. ignore the problem</td></tr><tr><td width='4
>A) </td><td width='711' align='left' valign='top'>only a & b</td></tr><t
' valign='top'>B) </td><td width='711' align='left' valign='top'>only b &
c</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
4' align='left' valign='top'>C) </td><td width='711' align='left' valign=
'top'>only a & c</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>All the above</td></tr></table><table border='0' width='600'
id='table1_1_3'><tr><td width='41' align='left' valign='top'>Q.4 </td><t
d width='749' align='left' valign='top' colspan='2'>Existing process makes an ex
act copy of itself with the same environment with only ID number differe
nt. This procedure is called as ______</td></tr><tr><td width='41' align='le
/td><td width='711' align='left' valign='top'>Copying</td></tr><tr><td width='41
B) </td><td width='711' align='left' valign='top'>Duplication</td></tr><t
' valign='top'>C) </td><td width='711' align='left' valign='top'>Forking<
align='left' valign='top'>D) </td><td width='711' align='left' valign='to
p'>Bootstraping</td></tr></table><table border='0' width='600' id='table1_1_4'><
tr><td width='41' align='left' valign='top'>Q.5 </td><td width='749' alig
n='left' valign='top' colspan='2'> ________ is a protected variable whose va
lue can be accessed and altered only by the operations P and V</td></tr><tr>
valign='top'>A) </td><td width='711' align='left' valign='top'>metaphore<
align='left' valign='top'>B) </td><td width='711' align='left' valign='to
p'>semaphore</td></tr><tr><td width='41' align='left' valign='top'> </td><t
d width='34' align='left' valign='top'>C) </td><td width='711' align='lef
t' valign='top'>teraphore</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>D) </td><td width='71

1' align='left' valign='top'>none of the above</td></tr></table><table border='0
' width='600' id='table1_1_5'><tr><td width='41' align='left' valign='top'>Q.
6 </td><td width='749' align='left' valign='top' colspan='2'>_____ is the mo
dule that gives control of the CPU to the process selected by short term scheduler.</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>A) </td><td width='711' align='left
' valign='top'>Thread</td></tr><tr><td width='41' align='left' valign='top'>&nbs
lign='left' valign='top'>Dispatcher</td></tr><tr><td width='41' align='left' val
ign='top'> </td><td width='34' align='left' valign='top'>C) </td><td
width='711' align='left' valign='top'>Sheduler</td></tr><tr><td width='41' alig
n='left' valign='top'> </td><td width='34' align='left' valign='top'>D)
</td><td width='711' align='left' valign='top'>None of above</td></tr></tabl
e><table border='0' width='600' id='table1_1_6'><tr><td width='41' align='left'
valign='top'>Q.7 </td><td width='749' align='left' valign='top' colspan='
2'>Match the following Set A Linux command i. a ii. u iii. X Set B Description a. Append text after the cursor b. Undo the last chan
ge c. Delete the current character</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>A) </td>
<td width='711' align='left' valign='top'>i-a, ii-b, iii-c</td></tr><tr><td widt
top'>B) </td><td width='711' align='left' valign='top'>i-b, ii-c, iii-a</
lign='left' valign='top'>C) </td><td width='711' align='left' valign='top
'>i-c, ii-a, iii-b</td></tr><tr><td width='41' align='left' valign='top'> <
/td><td width='34' align='left' valign='top'>D) </td><td width='711' alig
n='left' valign='top'>i-a, ii-c, iii-b</td></tr></table><table border='0' width=
'600' id='table1_1_7'><tr><td width='41' align='left' valign='top'>Q.8 </
td><td width='749' align='left' valign='top' colspan='2'>Multilevel queue schedu
ling algorithm consists of a. System Processes b. Batch Processes c. Student Processes d. Interactive Processes</td></tr><tr><td width='41'
>A) </td><td width='711' align='left' valign='top'>a, c, d</td></tr><tr><td
gn='top'>B) </td><td width='711' align='left' valign='top'>a, b, c</td></
'left' valign='top'>C) </td><td width='711' align='left' valign='top'>a,
b, d</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=
'34' align='left' valign='top'>D) </td><td width='711' align='left' valig
n='top'>a, b, c, d</td></tr></table><table border='0' width='600' id='table1_1_8
'><tr><td width='41' align='left' valign='top'>Q.9 </td><td width='749' a
lign='left' valign='top' colspan='2'>If the degree of multiprogramming is stable
 then the average rate of process creation must be</td></tr><tr><td widt
top'>A) </td><td width='711' align='left' valign='top'>equal to average r
ate of processes leaving
the system</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>B) </td><td width='711' align='left'
valign='top'>equal to average rate of processes entering
the system</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>greater than average rate of processes
entering the system</td></tr><tr><td width='41' align='left' valign='top'>
gn='left' valign='top'>less than average rate of processes entering
the system</td></tr></table><table border='0' width='600' id='table1_1_9'><tr><t
eft' valign='top' colspan='2'>By moving short process before long one</td></tr><
t' valign='top'>A) </td><td width='711' align='left' valign='top'>waiting

time of short process decreases
more than it increases the waiting time of long
term process.</td></tr><tr><td width='41' align='left' valign='top'> </td><
ft' valign='top'>waiting time of short process increases more
than it decreases the waiting time of long term
process.</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
align='top'>waiting time of short process decreases less
than it increases the waiting time of long term
process.</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
align='top'>waiting time of short process increases less
than it decreases the waiting time of long term
process.</td></tr></table><table border='0' width='600' id='table1_1_10'><tr><td
ft' valign='top' colspan='2'>The list of processes waiting for a particular 
I/O device is called as _____</td></tr><tr><td width='41' align='left' valign='t
='711' align='left' valign='top'>Waiting Queue</td></tr><tr><td width='41' align
='left' valign='top'> </td><td width='34' align='left' valign='top'>B) </td><td width='711' align='left' valign='top'>Device Queue</td></tr><tr><td
gn='top'>C) </td><td width='711' align='left' valign='top'>Process Queue<
align='left' valign='top'>D) </td><td width='711' align='left' valign='to
p'>None of the other</td></tr></table><table border='0' width='600' id='table1_1
9' align='left' valign='top' colspan='2'>When a file is owned by the wrong user
or group, the error can be repaired with the _____ (owner) and _____ (gr
oup) commands</td></tr><tr><td width='41' align='left' valign='top'> </td><
td width='34' align='left' valign='top'>A) </td><td width='711' align='le
ft' valign='top'>chown, chgrep</td></tr><tr><td width='41' align='left' valign='
h='711' align='left' valign='top'>chgrp, chown</td></tr><tr><td width='41' align
='left' valign='top'> </td><td width='34' align='left' valign='top'>C) </td><td width='711' align='left' valign='top'>chown, chgrp</td></tr><tr><td
gn='top'>D) </td><td width='711' align='left' valign='top'>chgrep, chown<
/td></tr></table><table border='0' width='600' id='table1_1_12'><tr><td width='4
1' align='left' valign='top'>Q.13 </td><td width='749' align='left' valig
n='top' colspan='2'>Match the following Set A i. Ps ii. pwd Set
B a. show process started by system b. show current directories c. s
how process started by user d. show details of 1 level down directory</td></
'left' valign='top'>A) </td><td width='711' align='left' valign='top'>i-a
, ii-b</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
ign='top'>i-c, ii-d</td></tr><tr><td width='41' align='left' valign='top'>
gn='left' valign='top'>i-c, ii-b</td></tr><tr><td width='41' align='left' valign
dth='711' align='left' valign='top'>i-a, ii-d</td></tr></table><table border='0'
width='600' id='table1_1_13'><tr><td width='41' align='left' valign='top'>Q.
14 </td><td width='749' align='left' valign='top' colspan='2'>When a process
creates new process, possibilities exist in terms of execution are</td></tr
eft' valign='top'>A) </td><td width='711' align='left' valign='top'>The p
arent continues to execute concurrently
with its children</td></tr><tr><td width='41' align='left' valign='top'> </

='left' valign='top'>The parent waits until some or all its children
have terminated</td></tr><tr><td width='41' align='left' valign='top'> </td
left' valign='top'>The child process has a program loaded into
it</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
'top'>only A) and B)</td></tr></table><table border='0' width='600' id='table1_1
9' align='left' valign='top' colspan='2'>Disk I/O problems are a. per proces
s transfer rate b. aggregate transfer rate c. network overload d. ne
twork integrity</td></tr><tr><td width='41' align='left' valign='top'> </td
><td width='34' align='left' valign='top'>A) </td><td width='711' align='
left' valign='top'>only a</td></tr><tr><td width='41' align='left' valign='top'>
1' align='left' valign='top'>Both a and b</td></tr><tr><td width='41' align='lef
td><td width='711' align='left' valign='top'>Only c & d</td></tr><tr><td width='
'>D) </td><td width='711' align='left' valign='top'>All of above</td></tr
colspan='2'>Major reasons for building distributed systems are a. Resour
ce sharing b. Computation speedup c. Reliability d. Communication</t
>a, b, c</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
dth='34' align='left' valign='top'>B) </td><td width='711' align='left' v
align='top'>b, c, d</td></tr><tr><td width='41' align='left' valign='top'>
gn='left' valign='top'>a, c, d</td></tr><tr><td width='41' align='left' valign='
top'> </td><td width='34' align='left' valign='top'>D) </td><td widt
h='711' align='left' valign='top'>a, b, c, d</td></tr></table><table border='0'
7 </td><td width='749' align='left' valign='top' colspan='2'>Real-time syste
m is considered to function correctly only if _____</td></tr><tr><td width='
'>A) </td><td width='711' align='left' valign='top'>returns the correct r
esult within any time
constraints</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>B) </td><td width='711' align='left
' valign='top'>returns the correct result without time
constraints</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>C) </td><td width='711' align='left
' valign='top'>Either A or B</td></tr><tr><td width='41' align='left' valign='to
'711' align='left' valign='top'>Neither A or B</td></tr></table><table border='0
' width='600' id='table1_1_17'><tr><td width='41' align='left' valign='top'>Q
.18 </td><td width='749' align='left' valign='top' colspan='2'>Match the fol
lowing Set A i. I/O bound process ii. CPU bound process iii. All
processes are I/O bound iv. All processes are CPU bound Set B a. sp
ends more time doing I/O b. spends more time doing computation c. ready
qu</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
4' align='left' valign='top'>A) </td><td width='711' align='left' valign=
'top'>i-a, ii-b, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='to
p'> </td><td width='34' align='left' valign='top'>B) </td><td width=
'711' align='left' valign='top'>i-b, ii-c, iii-d, iv-a</td></tr><tr><td width='4
>C) </td><td width='711' align='left' valign='top'>i-a, ii-b, iii-d, iv-c

op'>i-b, ii-d, iii-a, iv-c</td></tr></table><table border='0' width='600' id='ta
ble1_1_18'><tr><td width='41' align='left' valign='top'>Q.19 </td><td wid
th='749' align='left' valign='top' colspan='2'>Match the following with respect
to colors representing file types Set A i. Blue ii. Red iii.
Green iv. Flashing Red Set B a. broken links b. directories 
c. executables d. compressed archives</td></tr><tr><td width='41' align='lef
t' valign='top'> </td><td width='34' align='left' valign='top'>A) </
td><td width='711' align='left' valign='top'>i-b, ii- d, iii-c, iv-a</td></tr><t
' valign='top'>B) </td><td width='711' align='left' valign='top'>i-b, iic, iii-d, iv-a</td></tr><tr><td width='41' align='left' valign='top'> </td
left' valign='top'>i-a, ii- d, iii-c, iv-b</td></tr><tr><td width='41' align='le
ft' valign='top'> </td><td width='34' align='left' valign='top'>D) <
/td><td width='711' align='left' valign='top'>i-a, ii- b, iii-c, iv-d</td></tr><
/table><table border='0' width='600' id='table1_1_19'><tr><td width='41' align='
left' valign='top'>Q.20 </td><td width='749' align='left' valign='top' co
lspan='2'>State whether true or false a. Data parameter Block is sometimes c
alled media parameter b. Volume Boot Code is specific to the operating system that is using this volume c. Disk Parameter Block does not contain
 specific information</td></tr><tr><td width='41' align='left' valign='top'>
1' align='left' valign='top'>True, False, False, True</td></tr><tr><td width='41
B) </td><td width='711' align='left' valign='top'>False, True, True, Fals
e</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34
' align='left' valign='top'>C) </td><td width='711' align='left' valign='
top'>False, True, False, True</td></tr><tr><td width='41' align='left' valign='t
='711' align='left' valign='top'>True, False, True, False</td></tr></table><tabl
e border='0' width='600' id='table1_1_20'><tr><td width='41' align='left' valign
='top'>Q.21 </td><td width='749' align='left' valign='top' colspan='2'> _
_____ is method for logically implementing a link and the send/receive o
perations</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
idth='34' align='left' valign='top'>A) </td><td width='711' align='left'
valign='top'>Direct or indirect communication</td></tr><tr><td width='41' align=
'left' valign='top'> </td><td width='34' align='left' valign='top'>B) </td><td width='711' align='left' valign='top'>Automatic or explicit buffering
align='left' valign='top'>C) </td><td width='711' align='left' valign='t
op'>Send by copy or send by reference</td></tr><tr><td width='41' align='left' v
align='top'> </td><td width='34' align='left' valign='top'>D) </td><
td width='711' align='left' valign='top'>All of above</td></tr></table><table bo
rder='0' width='600' id='table1_1_21'><tr><td width='41' align='left' valign='to
p'>Q.22 </td><td width='749' align='left' valign='top' colspan='2'>Match
the following SET A 1. Swap partition 2. / Boot partition 3. Roo
t partition SET B a. supports virtual memory b. root directory is lo
cated c. contains the operating system kernel</td></tr><tr><td width='41' al
ign='left' valign='top'> </td><td width='34' align='left' valign='top'>A
a, 2
b, 3 c</td></tr><tr><
) </td><td width='711' align='left' valign='top'>1
='top'>B) </td><td width='711' align='left' valign='top'>1
b, 2 c, 3
a</td
eft' valign='top'>C) </td><td width='711' align='left' valign='top'>1 c, 2
a,
3 b</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
'top'>1
b, 2 a, 3
c</td></tr></table><table border='0' width='600' id='table1_1_2
r><td width='41' align='left' valign='top'>Q.23 </td><td width='749' alig
n='left' valign='top' colspan='2'>Match the following: Set A a. ps b

. wall c. kill d. write Set B 1. Used to send a message to a sin
gle user 2. Used to terminate process 3. Used to send a message to all c
onnected users 4. Used to display a list </td></tr><tr><td width='41' al
ign='left' valign='top'> </td><td width='34' align='left' valign='top'>A
) </td><td width='711' align='left' valign='top'>a-3, b-4, c-1, d-2</td></tr
eft' valign='top'>B) </td><td width='711' align='left' valign='top'>a-2,
b-1, c-3, d-4</td></tr><tr><td width='41' align='left' valign='top'> </td><
td width='34' align='left' valign='top'>C) </td><td width='711' align='le
ft' valign='top'>a-4, b-3, c-2, d-1</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>a-2, b-3, c-4, d-1</td></tr></table><tabl
='top'>Q.24 </td><td width='749' align='left' valign='top' colspan='2'>Tr
ue or False a. Hard Link does not associate two or more file names with
same code b. Soft link is a small file that points to other file c.
Hard link cant span across partitions d. Soft links cant span across partiti
ons</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
='top'>True, False, False, False</td></tr><tr><td width='41' align='left' valign
='top'> </td><td width='34' align='left' valign='top'>B) </td><td wi
dth='711' align='left' valign='top'>False, True, True, True</td></tr><tr><td wid
'top'>C) </td><td width='711' align='left' valign='top'>True, True, False
, False</td></tr><tr><td width='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'>D) </td><td width='711' align='left' va
lign='top'>False, True, True, False</td></tr></table><table border='0' width='60
0' id='table1_1_24'><tr><td width='41' align='left' valign='top'>Q.25 </t
d><td width='749' align='left' valign='top' colspan='2'>Linux implementation is
adherent to ____ and uses ____</td></tr><tr><td width='41' align='left' vali
width='711' align='left' valign='top'>POXIS; non proprietary code</td></tr><tr><
align='top'>B) </td><td width='711' align='left' valign='top'>IEEE; GNU P
roject</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
ign='top'>POSIX; binary code</td></tr><tr><td width='41' align='left' valign='to
'711' align='left' valign='top'>IEEE; proprietary code</td></tr></table><table b
order='0' width='600' id='table1_1_25'><tr><td width='41' align='left' valign='t
op'>Q.26 </td><td width='749' align='left' valign='top' colspan='2'> Linu
x can relay on ____ and can be installed in several machines ____</td></tr><
t' valign='top'>A) </td><td width='711' align='left' valign='top'>Shell &
windows; without configuring the
software</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
align='top'>Kernel; by configuring the software to needs</td></tr><tr><td width=
p'>C) </td><td width='711' align='left' valign='top'>Notepad; by using Ac
ademic version of
software</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
align='top'>Solaris; by configuring the software to needs</td></tr></table><tabl
='top'>Q.27 </td><td width='749' align='left' valign='top' colspan='2'>Bi
nary semaphores can assume only the value ___ and ___ whereas counting s
emaphores can assume only ____ values. </td></tr><tr><td width='41' align='l
</td><td width='711' align='left' valign='top'>0, 1 and nonpositive</td></tr><tr

valign='top'>B) </td><td width='711' align='left' valign='top'>0, 1 and
nonnegative</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'>C) </td><td width='711' align='left
' valign='top'>P, V and nonpositive</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>P, V and nonnegative</td></tr></table><ta
ble border='0' width='600' id='table1_1_27'><tr><td width='41' align='left' vali
gn='top'>Q.28 </td><td width='749' align='left' valign='top' colspan='2'>
Match the following Set A i. export PS1= [|t |j]
 ii. export PS1= [|d][u @|
: iii. export PS!= {|!}
 iv. export PS1= [|033[1;35m|]|u @ |h|[|033[0m|]
>a. Displays time of day and number of running jobs b. </td></tr><tr><td
ign='top'>A) </td><td width='711' align='left' valign='top'>i-a, ii-b, ii
i-d, iv-c</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>i-a, ii-b, iii-c, iv-d</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>i-b, ii-a, iii-c, iv-d</td></tr><tr><td w
n='top'>D) </td><td width='711' align='left' valign='top'>i-b, ii-c, iiid, iv-a</td></tr></table><table border='0' width='600' id='table1_1_28'><tr><td
t' valign='top' colspan='2'>Which of the following statements are true regar
ding GRUB 1. It provides 4 command-based, pre-OS environment to enable f
lexibility in loading operating systems 2. It supports logical block add
ressing, which is used to access IDE an</td></tr><tr><td width='41' align='l
</td><td width='711' align='left' valign='top'>1 and 3</td></tr><tr><td width='4
>B) </td><td width='711' align='left' valign='top'>2 and 3</td></tr><tr><
align='top'>C) </td><td width='711' align='left' valign='top'>2 only</td>
n='left' valign='top'>D) </td><td width='711' align='left' valign='top'>1
, 2, 3</td></tr></table><table border='0' width='600' id='table1_1_29'><tr><td w
idth='41' align='left' valign='top'>Q.30 </td><td width='749' align='left
' valign='top' colspan='2'>A parent may terminate the execution of children
for</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
='top'>The task assigned to the child is no longer
required</td></tr><tr><td width='41' align='left' valign='top'> </td><td wi
align='top'>The child has exceeded its usage of some of
the resources it has been allocated</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>The parent is exiting</td></tr><tr><td wi
='top'>D) </td><td width='711' align='left' valign='top'>All the above</t
d></tr></table><table border='0' width='600' id='table1_1_30'><tr><td width='41'
align='left' valign='top'>Q.31 </td><td width='749' align='left' valign=
'top' colspan='2'>List the events which could occur when the process is allo
cated the CPU and is executing a. The process could issue an I/O request and
 then be placed in an I/O b. The process could create a new subprocess and wait for its termination <</td></tr><tr><td width='41' align='left' valig
n='top'> </td><td width='34' align='left' valign='top'>A) </td><td w
idth='711' align='left' valign='top'>only a</td></tr><tr><td width='41' align='l
eft' valign='top'> </td><td width='34' align='left' valign='top'>B) 
</td><td width='711' align='left' valign='top'>only b</td></tr><tr><td width='41

C) </td><td width='711' align='left' valign='top'>only c</td></tr><tr><td
ign='top'>D) </td><td width='711' align='left' valign='top'>a, b, c</td><
/tr></table><table border='0' width='600' id='table1_1_31'><tr><td width='41' al
ign='left' valign='top'>Q.32 </td><td width='749' align='left' valign='to
p' colspan='2'>Match the following Set A i. wq! ii. w iii. q iv. wq Set B a. will save and exit b. will exit the editor c. o
verrides read-only permission d. will save (write) the file</td></tr><tr><td
ign='top'>A) </td><td width='711' align='left' valign='top'>i-a, ii-b, ii
i-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>i-c, ii-d, iii-a, iv-c</td></tr><tr><td width='41' align='left' val
width='711' align='left' valign='top'>i-c, ii-d, iii-b, iv-a</td></tr><tr><td w
n='top'>D) </td><td width='711' align='left' valign='top'>i-d, ii-b, iiic, iv-a</td></tr></table><table border='0' width='600' id='table1_1_32'><tr><td
t' valign='top' colspan='2'>Which of the following statements are true regar
ding functions in Linux 1. They save a lot of time 2. They help to avoid
rewriting the same code again 3. Programs can be written in an easier m
anner 4. They enable easy maintenance o</td></tr><tr><td width='41' align='l
</td><td width='711' align='left' valign='top'>1 and 3</td></tr><tr><td width='4
>B) </td><td width='711' align='left' valign='top'>2 and 4</td></tr><tr><
align='top'>C) </td><td width='711' align='left' valign='top'>1, 3, 4</td
gn='left' valign='top'>D) </td><td width='711' align='left' valign='top'>
1, 2, 3, 4</td></tr></table><table border='0' width='600' id='table1_1_33'><tr><
td width='41' align='left' valign='top'>Q.34 </td><td width='749' align='
left' valign='top' colspan='2'>Match the following Set A i. SunOS versio
n 4 ii. SunOS version 5 Set B a. provides asymmetric multiprocessing
 b. provides symmetric multiprocessing c. provides symmetric processing
 d. provides asymmetric processing</td></tr><tr><td width='41' align='left' v
td width='711' align='left' valign='top'>i-a, ii-b</td></tr><tr><td width='41' a
B) </td><td width='711' align='left' valign='top'>i-b, ii-d</td></tr><tr><td
ign='top'>C) </td><td width='711' align='left' valign='top'>i-c, ii-a</td
gn='left' valign='top'>D) </td><td width='711' align='left' valign='top'>
i-d, ii-c</td></tr></table><table border='0' width='600' id='table1_1_34'><tr><t
eft' valign='top' colspan='2'>When a process is accessing shared modifiable
data, the process is said to be in ______</td></tr><tr><td width='41' align=
'left' valign='top'> </td><td width='34' align='left' valign='top'>A) </td><td width='711' align='left' valign='top'>Critical state</td></tr><tr><td
ign='top'>B) </td><td width='711' align='left' valign='top'>Critical sect
ion</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
34' align='left' valign='top'>C) </td><td width='711' align='left' valign
='top'>Shared state</td></tr><tr><td width='41' align='left' valign='top'>
gn='left' valign='top'>Shared section</td></tr></table><table border='0' width='
600' id='table1_1_35'><tr><td width='41' align='left' valign='top'>Q.36 <
/td><td width='749' align='left' valign='top' colspan='2'>Partitioning Hard disk

is the act of a. dividing it into pieces b. breaking it into pieces c. dividing it into logical volumes d. dividing it into physical volumes</t
>only a</td></tr><tr><td width='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'>B) </td><td width='711' align='left' va
lign='top'>only b</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>C) </td><td width='711' align
='left' valign='top'>only c</td></tr><tr><td width='41' align='left' valign='top
'> </td><td width='34' align='left' valign='top'>D) </td><td width='
711' align='left' valign='top'>only a and c</td></tr></table><table border='0' w
</td><td width='749' align='left' valign='top' colspan='2'>Switching the CP
U to another process requires a. saving the state of the old process b. loading the saved state for the new process</td></tr><tr><td width='41' alig
n='left' valign='top'> </td><td width='34' align='left' valign='top'>A)
</td><td width='711' align='left' valign='top'>only a</td></tr><tr><td width
op'>B) </td><td width='711' align='left' valign='top'>only b</td></tr><tr
valign='top'>C) </td><td width='711' align='left' valign='top'>both a an
d b</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
34' align='left' valign='top'>D) </td><td width='711' align='left' valign
='top'>
Neither a nor b</td></tr></table><table border='0' width='600' id='table1_1_37'>
<tr><td width='41' align='left' valign='top'>Q.38 </td><td width='749' al
ign='left' valign='top' colspan='2'>directory contains commands and utilities while ____ contains commands and files for system Administration</td></tr>
ft' valign='top'>A) </td><td width='711' align='left' valign='top'>/bin;
/dev</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=
'34' align='left' valign='top'>B) </td><td width='711' align='left' valig
n='top'>/bin; /etc</td></tr><tr><td width='41' align='left' valign='top'> <
n='left' valign='top'>/dev; / etc</td></tr><tr><td width='41' align='left' valig
n='top'> </td><td width='34' align='left' valign='top'>D) </td><td w
idth='711' align='left' valign='top'>/ dev; /bin</td></tr></table><table border=
'0' width='600' id='table1_1_38'><tr><td width='41' align='left' valign='top'>Q.39 </td><td width='749' align='left' valign='top' colspan='2'>Which is no
t the advantage of Shell Script</td></tr><tr><td width='41' align='left' valign=
'top'> </td><td width='34' align='left' valign='top'>A) </td><td wid
th='711' align='left' valign='top'>Shell script can take input from user, file a
nd
output them on screen</td></tr><tr><td width='41' align='left' valign='top'>&nbs
lign='left' valign='top'>Useful to create our own commands</td></tr><tr><td widt
top'>C) </td><td width='711' align='left' valign='top'>To automate some t
ask day to day life</td></tr><tr><td width='41' align='left' valign='top'>
gn='left' valign='top'>D)None of above</td></tr></table><table border='0' width=
'600' id='table1_1_39'><tr><td width='41' align='left' valign='top'>Q.40 
</td><td width='749' align='left' valign='top' colspan='2'>Out following ____ is
not a basic computing resource</td></tr><tr><td width='41' align='left' val
ign='top'> </td><td width='34' align='left' valign='top'>A) </td><td
width='711' align='left' valign='top'>Central Processing Unit</td></tr><tr><td
gn='top'>B) </td><td width='711' align='left' valign='top'>Memory</td></t
left' valign='top'>C) </td><td width='711' align='left' valign='top'>Inpu

t / Output Devices</td></tr><tr><td width='41' align='left' valign='top'> <
n='left' valign='top'>None of the above</td></tr></table> PART C <table border='0' width='600' id='table1_2_0'><tr><td width='41' al
ign='left' valign='top'>Q.1 </td><td width='749' align='left' valign='top
' colspan='2'>Of the following which is/are methods for logically implementi
ng a link and the send/receive operations a. Direct or indirect communic
ation b. Symmetric or asymmetric communication c. Automatic or explicit
buffering d. Send by copy</td></tr><tr><td width='41' align='left' valign='t
='711' align='left' valign='top'>only a and b</td></tr><tr><td width='41' align=
'left' valign='top'> </td><td width='34' align='left' valign='top'>B) </td><td width='711' align='left' valign='top'>a, b and d</td></tr><tr><td wid
'top'>C) </td><td width='711' align='left' valign='top'>b, c and e</td></
'left' valign='top'>D) </td><td width='711' align='left' valign='top'>All
the above</td></tr></table><table border='0' width='600' id='table1_2_1'><tr><t
d width='41' align='left' valign='top'>Q.2 </td><td width='749' align='le
ft' valign='top' colspan='2'>Which of the following statements are trued reg
arding Linux 1. It returns an excellent return on investment as it is fr
eely downloadable 2. It is fast, secure, scalable and robust and provide
s goods support for parallel processing </td></tr><tr><td width='41' align='
></td><td width='711' align='left' valign='top'>2, 3, 4, 5</td></tr><tr><td widt
top'>B) </td><td width='711' align='left' valign='top'>1, 2, 3, 4, 5</td>
n='left' valign='top'>C) </td><td width='711' align='left' valign='top'>1
, 2, 4, 6</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>1, 2, 3, 4, 5, 6</td></tr></table><table border='0' width='600' id=
'table1_2_2'><tr><td width='41' align='left' valign='top'>Q.3 </td><td wi
dth='749' align='left' valign='top' colspan='2'>Select the correct statements wi
th respect to common environment variables a. DISPLAY is used by the X w
indow system to identify the display server b. LANG is preferred languag
e c. LOGNAME is login name d. PATH searches paths for c</td></tr><tr><td
ign='top'>A) </td><td width='711' align='left' valign='top'>a, b, c</td><
='left' valign='top'>B) </td><td width='711' align='left' valign='top'>a,
b, d, e,</td></tr><tr><td width='41' align='left' valign='top'> </td><td w
valign='top'>All the above</td></tr><tr><td width='41' align='left' valign='top'
11' align='left' valign='top'>None of the above</td></tr></table><table border='
0' width='600' id='table1_2_3'><tr><td width='41' align='left' valign='top'>Q
.4 </td><td width='749' align='left' valign='top' colspan='2'>Select true st
atement from the following with respect to advantages of Linux a. Linux
provides an excellent return on investment as it is freely downloadable 
b. It cant be put to work on desktop c. It provides royalty free development
</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34
' align='left' valign='top'>A) </td><td width='711' align='left' valign='
top'>True, False, True, False</td></tr><tr><td width='41' align='left' valign='t
op'> </td><td width='34' align='left' valign='top'>B) </td><td width
='711' align='left' valign='top'>False, True, False, True</td></tr><tr><td width
op'>C) </td><td width='711' align='left' valign='top'>True, True, False,
False</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
='34' align='left' valign='top'>D) </td><td width='711' align='left' vali

gn='top'>False, False, True, True</td></tr></table><table border='0' width='600'
id='table1_2_4'><tr><td width='41' align='left' valign='top'>Q.5 </td><t
d width='749' align='left' valign='top' colspan='2'>Select incorrect statements
from following a. /lost+found directory contains files that were saved d
uring failures b. /misc is home directory for common user c. Every parti
tion has /proc directory in its upper directory d. /opt dir</td></tr><tr
valign='top'>A) </td><td width='711' align='left' valign='top'>only a, d
align='left' valign='top'>B) </td><td width='711' align='left' valign='t
op'>only b</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>only c, d</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'>D) </td><td width='711'
align='left' valign='top'>only b, c</td></tr></table><table border='0' width='6
00' id='table1_2_5'><tr><td width='41' align='left' valign='top'>Q.6 </td
><td width='749' align='left' valign='top' colspan='2'>Match the following S
et A i. Jobs ii. Ctrl+Z iii. Ctrl+C iv. Bg Set B a. Reac
tivate a suspended program in the background b. Stop a process running i
n the foreground c. Show commands in the background d. Interup</td></tr>
ft' valign='top'>A) </td><td width='711' align='left' valign='top'>i-a, i
i-b, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>i-d, ii-c, iii-b, iv-a</td></tr><tr><td width='41' align='le
/td><td width='711' align='left' valign='top'>i-c, ii-d, iii-b, iv-a</td></tr><t
' valign='top'>D) </td><td width='711' align='left' valign='top'>i-c, iid, iii-b, iv-a</td></tr></table><table border='0' width='600' id='table1_2_6'><t
r><td width='41' align='left' valign='top'>Q.7 </td><td width='749' align
='left' valign='top' colspan='2'>The output of the following code will be $c
at > mtable if [ $# -eq 0] then echo number missing from command line argument exit 1 fi n=$1 for I in 1 2 3 4 5 6 7 8 9 10 do echo $n * $i = expr $i \* $n
 do</td></tr><tr><td width='41' align='left' val
' align='left' valign='top'>It will print addition of all numbers from 1 to
10</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
'top'>It will print multiplication of all numbers
from 1 to 10</td></tr><tr><td width='41' align='left' valign='top'> </td><t
t' valign='top'>It will print multiplication table of user
entered number</td></tr><tr><td width='41' align='left' valign='top'> </td>
eft' valign='top'>It will generate error</td></tr></table><table border='0' widt
h='600' id='table1_2_7'><tr><td width='41' align='left' valign='top'>Q.8 
</td><td width='749' align='left' valign='top' colspan='2'>Match the following Set A i. the process is being created ii. the process has finished ex
ecution iii. instructions are being executed iv. the process is waiting
to be assigned to a processor Set B a. ready b. terminated</td><
='left' valign='top'>A) </td><td width='711' align='left' valign='top'>id, ii-b, iii-e, iv-c</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'>B) </td><td width='711' al
ign='left' valign='top'>i-a, ii-b, iii-e, iv-c</td></tr><tr><td width='41' align
='left' valign='top'> </td><td width='34' align='left' valign='top'>C) </td><td width='711' align='left' valign='top'>i-a, ii-b, iii-c, iv-d</td></t
left' valign='top'>D) </td><td width='711' align='left' valign='top'>i-d,

ii-b, iii-e, iv-a</td></tr></table><table border='0' width='600' id='table1_2_8
'><tr><td width='41' align='left' valign='top'>Q.9 </td><td width='749' a
lign='left' valign='top' colspan='2'>Match the following Set A i. Firstcome, first-served scheduling ii. Shortest-job-first scheduling iii. Pri
ority scheduling iv. Round-robin scheduling Set B a. preemption is a
dded to switch between processes b. CPU is a</td></tr><tr><td width='41'
b>A) </td><td width='711' align='left' valign='top'>i-a, ii-c, iii-b, iv-d</
'>i-a, ii-b, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'>&
' align='left' valign='top'>i-d, ii-c, iii-a, iv-b</td></tr><tr><td width='41' a
D) </td><td width='711' align='left' valign='top'>i-d, ii-c, iii-b, iv-a</td
></tr></table><table border='0' width='600' id='table1_2_9'><tr><td width='41' a
lign='left' valign='top'>Q.10 </td><td width='749' align='left' valign='t
op' colspan='2'>Match the following Set A 1. cd 2. pwd 3. man 4. info Set B a. read man pages on command b. read info pages on c
ommand c. display present working directory d. change directories</td></
'left' valign='top'>A) </td><td width='711' align='left' valign='top'>i-a
, ii-b, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'>
</td><td width='34' align='left' valign='top'>B) </td><td width='711' ali
gn='left' valign='top'>i-d, ii-c, iii-a, iv-b</td></tr><tr><td width='41' align=
b></td><td width='711' align='left' valign='top'>i-b, ii-a, iii-c, iv-d</td></tr
eft' valign='top'>D) </td><td width='711' align='left' valign='top'>i-c,
ii-d, iii-a, iv-b</td></tr></table><table border='0' width='600' id='table1_2_10
'><tr><td width='41' align='left' valign='top'>Q.11 </td><td width='749'
align='left' valign='top' colspan='2'>Select the true statements of the followin
g a. In FIFO algorithm, when a page must be replaced, the oldest page is
chosen b. In Optimal Algorithm, the page that will not be used for the
longest period of time c. In LRU algorithm, the p</td></tr><tr><td width='41
A) </td><td width='711' align='left' valign='top'>only a, c, e</td></tr><
t' valign='top'>B) </td><td width='711' align='left' valign='top'>only a,
b, c</td></tr><tr><td width='41' align='left' valign='top'> </td><td width
gn='top'>only b, c, d, e</td></tr><tr><td width='41' align='left' valign='top'>&
' align='left' valign='top'>all are true</td></tr></table><table border='0' widt
b></td><td width='749' align='left' valign='top' colspan='2'> _______ is not a f
eature of GRUB</td></tr><tr><td width='41' align='left' valign='top'> </td>
<td width='34' align='left' valign='top'>A) </td><td width='711' align='l
eft' valign='top'>It provides a true command-based, pre-OS
environment on X86</td></tr><tr><td width='41' align='left' valign='top'> <
/td><td width='34' align='left' valign='top'>B) </td><td width='711' alig
n='left' valign='top'>It does not support Logical Block Addressing
mode</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=
'34' align='left' valign='top'>C) </td><td width='711' align='left' valig
n='top'>Configuration file is read from disk</td></tr><tr><td width='41' align='
left' valign='top'> </td><td width='34' align='left' valign='top'>D) </td><td width='711' align='left' valign='top'>All the above</td></tr></table><
table border='0' width='600' id='table1_2_12'><tr><td width='41' align='left' va
lign='top'>Q.13 </td><td width='749' align='left' valign='top' colspan='2
'>A multilevel feedback scheduler is defined by the following parameters a. The number of queues b. The scheduling algorithm for each queue c. T
he method used to determine when to upgrade a process to a higher priority q
ueue d. The m</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>A) </td><td width='711' align
='left' valign='top'>only b, c and d</td></tr><tr><td width='41' align='left' va
lign='top'> </td><td width='34' align='left' valign='top'>B) </td><t
d width='711' align='left' valign='top'>only a and e</td></tr><tr><td width='41'
b>C) </td><td width='711' align='left' valign='top'>Except d</td></tr><tr><t
d width='41' align='left' valign='top'> </td><td width='34' align='left' va
lign='top'>D) </td><td width='711' align='left' valign='top'>All the abov
e</td></tr></table><table border='0' width='600' id='table1_2_13'><tr><td width=
'41' align='left' valign='top'>Q.14 </td><td width='749' align='left' val
ign='top' colspan='2'>Match the following Set A i. requires each file to
occupy a set of contiguous blocks on the disk. ii. each file is a linke
d list of disk blocks iii. brings all the pointers together into one loc
ation Set B a. indexed alloca</td></tr><tr><td width='41' align='left' v
td width='711' align='left' valign='top'>i-c, ii-b, iii-a</td></tr><tr><td width
op'>B) </td><td width='711' align='left' valign='top'>i-a, ii-c, iii-b</t
ign='left' valign='top'>C) </td><td width='711' align='left' valign='top'
>i-c, ii-a, iii-b</td></tr><tr><td width='41' align='left' valign='top'> </
td><td width='34' align='left' valign='top'>D) </td><td width='711' align
='left' valign='top'>i-a, ii-b, iii-c</td></tr></table><table border='0' width='
/td><td width='749' align='left' valign='top' colspan='2'>Select true statement
from the following with respect to advantages of Linux a. Linux provides
an excellent return on investment as it is freely downloadable b. It ca
nt be put to work on desktop c. It provides royalty free development </td></
'left' valign='top'>A) </td><td width='711' align='left' valign='top'>Tru
e, False, True, False</td></tr><tr><td width='41' align='left' valign='top'>&nbs
lign='left' valign='top'>False, True, False, True</td></tr><tr><td width='41' al
ign='left' valign='top'> </td><td width='34' align='left' valign='top'>C
) </td><td width='711' align='left' valign='top'>True, True, False, False</t
ign='left' valign='top'>D) </td><td width='711' align='left' valign='top'
>False, False, True, True</td></tr></table><table border='0' width='600' id='tab
le1_2_15'><tr><td width='41' align='left' valign='top'>Q.16 </td><td widt
h='749' align='left' valign='top' colspan='2'>Match the following SET A 
1. Directories 2. Special files 3. Links 4. Domain sockets 5. Na
med pipes SET B a. files that are lists of other files b. the mechan
ism for input and output c. a system to make a file or di</td></tr><tr><td w
a, 2
b, 3 c, 4
n='top'>A) </td><td width='711' align='left' valign='top'>1
'>1
b, 2 a, 3
c, 4 e, 5
d</td></tr><tr><td width='41' align='left' valign
left' valign='top'>1 a, 2
b, 3 d, 4
e, 5 c</td></tr><tr><td width='41' al
dth='711' align='left' valign='top'>1
b, 2 a, 3
d, 4 e, 5
c</td></tr></ta
='0' width='600' id='table1_2_16'><tr><td width='41' align='left' valign='top'>Q.17 </td><td width='749' align='left' valign='top' colspan='2'>State of t
he following which is not a reason for providing an environment that allows
 process cooperation a. Information sharing b. Computation breakup c. Granularity d. Convenience e. Modularity f. Computation speedup

align='left' valign='top'>A) </td><td width='711' align='left' valign='t
op'>only b and e</td></tr><tr><td width='41' align='left' valign='top'> </t
'left' valign='top'>only c and e</td></tr><tr><td width='41' align='left' valign
dth='711' align='left' valign='top'>only b and c</td></tr><tr><td width='41' ali
</td><td width='711' align='left' valign='top'>only e and f</td></tr></tabl
e><table border='0' width='600' id='table1_2_17'><tr><td width='41' align='left'
valign='top'>Q.18 </td><td width='749' align='left' valign='top' colspan
='2'> ________ is not a circumstance in which CPU scheduling decisions take
place a. process switches from the running state to the waiting state b. process switches from the running state to the ready state c. proce
ss switches from the</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
;</td><td width='34' align='left' valign='top'>A) </td><td width='711' al
ign='left' valign='top'>a, b, c</td></tr><tr><td width='41' align='left' valign=
'top'> </td><td width='34' align='left' valign='top'>B) </td><td wid
th='711' align='left' valign='top'>only b & d</td></tr><tr><td width='41' align=
b></td><td width='711' align='left' valign='top'>b, c, d</td></tr><tr><td width=
p'>D) </td><td width='711' align='left' valign='top'>All of above</td></t
r></table><table border='0' width='600' id='table1_2_18'><tr><td width='41' alig
n='left' valign='top'>Q.19 </td><td width='749' align='left' valign='top'
colspan='2'>Match the following SET A 1. New 2. Running 3. Wait
ing 4. Ready 5. Terminated SET B a. The process is being created
 b. Instructions are being executed c. The process is waiting for some e
vent to occur d. The</td></tr><tr><td width='41' align='left' valign='to
p'> </td><td width='34' align='left' valign='top'>A) </td><td width=
a, 2 b, 3
c, 4 e, 5 - d</td></tr><tr><td wi
'711' align='left' valign='top'>1
) </td><td width='711' align='left' valign='top'>1 a, 2
c, 3 b, 4
e, 5
valign='top'>C) </td><td width='711' align='left' valign='top'>1
c, 2 b, 3
e, 5
d</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='
34' align='left' valign='top'>D) </td><td width='711' align='left' valign
='top'>1 a, 2
b, 3 c, 4
d, 5 e</td></tr></table><table border='0' width='
9' align='left' valign='top' colspan='2'>Methods for logically implementing a li
nk are a. Direct or indirect communication b. Automatic or explicit
buffering c. Send by copy or send by reference d. Symmetric or asymmetri
c communication e. Fixed-sized or variable-sized mes</td></tr><tr><td width=
p'>A) </td><td width='711' align='left' valign='top'>a, b, c, d, e</td></
'left' valign='top'>B) </td><td width='711' align='left' valign='top'>b,
d, a, c</td></tr><tr><td width='41' align='left' valign='top'> </td><td wid
th='34' align='left' valign='top'>C) </td><td width='711' align='left' va
lign='top'>c, d, e</td></tr><tr><td width='41' align='left' valign='top'> <
n='left' valign='top'>a, b, c, e</td></tr></table><table border='0' width='600'
td width='749' align='left' valign='top' colspan='2'>Match the following Set
A i. Throughput ii. Turnaround time iii. Waiting time iv. Respo
nse time Set B a. number of processes that are completed per time un
it b. interval from the time of submission of a process to t</td></tr><t
' valign='top'>A) </td><td width='711' align='left' valign='top'>i-b, ii-
a, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'> </td>

<td width='34' align='left' valign='top'>B) </td><td width='711' align='l
eft' valign='top'>i-a, ii-b, iii-d, iv-c</td></tr><tr><td width='41' align='left
' valign='top'> </td><td width='34' align='left' valign='top'>C) </t
d><td width='711' align='left' valign='top'>i-a, ii-b, iii-c, iv-d</td></tr><tr>
valign='top'>D) </td><td width='711' align='left' valign='top'>i-a, ii-c,
iii-b, iv-d</td></tr></table><table border='0' width='600' id='table1_2_21'><tr
><td width='41' align='left' valign='top'>Q.22 </td><td width='749' align
='left' valign='top' colspan='2'>Match the following SET A 1. CPU Schedu
ling Information 2. Memory Management Information 3. Accounting Informat
ion 4. I/O Status Information SET B a. Includes the amount of CPU an
d real time used b. Includes information</td></tr><tr><td width='41' ali
</td><td width='711' align='left' valign='top'>1
a, 2 b, 3
c, 4 d</td></
gn='top'>B) </td><td width='711' align='left' valign='top'>1
b, 2 c, 3
d,
gn='left' valign='top'>C) </td><td width='711' align='left' valign='top'>
1 c, 2
b, 3
a, 4 d</td></tr><tr><td width='41' align='left' valign='top'>&nbs
width='34' align='left' valign='top'>D) </td><td width='711' align='left'
valign='top'>1
d, 2 a, 3
b, 4 c</td></tr></table><table border='0' width='60
='749' align='left' valign='top' colspan='2'>The output of the following code wi
ll be $cat > mtable if [ $# -eq 0] then echo number missing from co
mmand line argument exit 1 fi n=$1 for I in 1 2 3 4 5 6 7 8 9 1
0 do echo $n * $i = expr $i \* $n
 do</td></tr><tr><td width='41' alig
lign='top'> </td><td width='34' align='left' valign='top'>A) </td><t
d width='711' align='left' valign='top'>It will print addition of all numbers fr
om 1 to
10</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='3
'top'>It will print multiplication of all numbers
from 1 to 10</td></tr><tr><td width='41' align='left' valign='top'> </td><t
t' valign='top'>It will print multiplication table of user
entered number</td></tr><tr><td width='41' align='left' valign='top'> </td>
eft' valign='top'>It will generate error</td></tr></table><table border='0' widt
b></td><td width='749' align='left' valign='top' colspan='2'>Match the following
 Set A i. cd ii. pwd iii. man iv. info Set B a. read
man pages on command b. read info pages on command c. display present w
orking directory d. change directories</td></tr><tr><td width='41' align='le
/td><td width='711' align='left' valign='top'>i-a, ii-b, iii-c, iv-d</td></tr><t
' valign='top'>B) </td><td width='711' align='left' valign='top'>i-d, iic, iii-a, iv-b</td></tr><tr><td width='41' align='left' valign='top'> </td>
<td width='34' align='left' valign='top'>C) </td><td width='711' align='l
eft' valign='top'>i-b, ii-a, iii-c, iv-d</td></tr><tr><td width='41' align='left
' valign='top'> </td><td width='34' align='left' valign='top'>D) </t
d><td width='711' align='left' valign='top'>i-c, ii-d, iii-a, iv-b</td></tr></ta
ble><table border='0' width='600' id='table1_2_24'><tr><td width='41' align='lef
t' valign='top'>Q.25 </td><td width='749' align='left' valign='top' colsp
an='2'>Match the following SET A 1. Zero Capacity 2. Bounded Capacit
y 3. Unbounded Capacity SET B a. The queue has infinite length b
. The queue has finite length n c. The queue has maximum length 0</td></tr><
t' valign='top'>A) </td><td width='711' align='left' valign='top'>1 a, 2
b, 3
- c</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=

'34' align='left' valign='top'>B) </td><td width='711' align='left' valig
n='top'>1
b, 2 c, 3
a</td></tr><tr><td width='41' align='left' valign='top'>&nbsp
left' valign='top'>1 c, 2
a, 3 b</td></tr><tr><td width='41' align='left' valign=
11' align='left' valign='top'>1
c, 2 b, 3
a</td></tr></table><table border='0' wi
/td><td width='749' align='left' valign='top' colspan='2'> Select incorrect stat
ements from following a. /lost+found directory contains files that were 
saved during failures b. /misc is home directory for common user c. Ever
y partition has /proc directory in its upper directory d. /opt di</td></
'left' valign='top'>A) </td><td width='711' align='left' valign='top'>onl
y a, d</td></tr><tr><td width='41' align='left' valign='top'> </td><td widt
ign='top'>only b</td></tr><tr><td width='41' align='left' valign='top'> </t
d><td width='34' align='left' valign='top'>C) </td><td width='711' align=
'left' valign='top'>only c, d</td></tr><tr><td width='41' align='left' valign='t
='711' align='left' valign='top'>only b, c</td></tr></table><table border='0' wi
dth='600' id='table1_2_26'><tr><td width='41' align='left' valign='top'>Q.27
</td><td width='749' align='left' valign='top' colspan='2'>Match the followi
ng Hard drives with their names in Linux SET A 1. First IDE 2. S
econd IDE 3. Third IDE 4. Fourth IDE SET B a. /dev/hda b. /d
ev/hdb c. /dev/hdc d. /dev/hdd</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>A) </td>
<td width='711' align='left' valign='top'>1 a, 2 b, 3
c, 4 d</td></tr><tr><td
b>B) </td><td width='711' align='left' valign='top'>1
b, 2 c, 3
d, 4 a</t
valign='top'>C) </td><td width='711' align='left' valign='top'>1
c, 2 d, 3
b</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
op'>1
d, 2 a, 3
b, 4 c</td></tr></table><table border='0' width='600' id='tab
tr><td width='41' align='left' valign='top'>Q.28 </td><td width='749' ali
gn='left' valign='top' colspan='2'>True or False a. As microprocessors becom
e less expensive and more powerful, additional operating-system function
s are off-loaded to slave processors, or back-ends b. It is fairly easy
to add a microprocessor with its own memory to</td></tr><tr><td width='41' a
A) </td><td width='711' align='left' valign='top'>True, False, False True</t
>True, True, True, False</td></tr><tr><td width='41' align='left' valign='top'>&
' align='left' valign='top'>True, False, True, False</td></tr><tr><td width='41'
b>D) </td><td width='711' align='left' valign='top'>True, True, True, True</
td></tr></table><table border='0' width='600' id='table1_2_28'><tr><td width='41
' align='left' valign='top'>Q.29 </td><td width='749' align='left' valign
='top' colspan='2'>Match the following: Set A a. Is b. file c. c
at d. pwd e. man f. exit Set B 1. Used to display descriptiv
e information about various commands 2. Used to exit from a Linux sessio
n 3. Used to display a list of</td></tr><tr><td width='41' align='left' vali
width='711' align='left' valign='top'>a-3, b-5, c-4, d-6, e-1, f-2</td></tr><tr>
valign='top'>B) </td><td width='711' align='left' valign='top'>a-6, b-4,
c-1, d-3, e-2, f-5</td></tr><tr><td width='41' align='left' valign='top'> <

n='left' valign='top'>a-5, b-1, c-3, d-6 e-4, f-2</td></tr><tr><td width='41' al
ign='left' valign='top'> </td><td width='34' align='left' valign='top'>D
) </td><td width='711' align='left' valign='top'>a-4, b-2, c-6, d-1 e-3, f-5
</td></tr></table><table border='0' width='600' id='table1_2_29'><tr><td width='
41' align='left' valign='top'>Q.30 </td><td width='749' align='left' vali
gn='top' colspan='2'>Out of following which are reasons for building distrib
uted systems a. Resource Sharing b. Computation Speedup c. Reliabili
ty d. Communication</td></tr><tr><td width='41' align='left' valign='top'>&n
bsp;</td><td width='34' align='left' valign='top'>A) </td><td width='711'
align='left' valign='top'>only a and b</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'>B) </td
><td width='711' align='left' valign='top'>only c and d</td></tr><tr><td width='
'>C) </td><td width='711' align='left' valign='top'>a, b, c</td></tr><tr>
valign='top'>D) </td><td width='711' align='left' valign='top'>a, b, c, d
</td></tr></table>

MC0085 1

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

MC0085 1

Transféré par

Droits d'auteur :

Formats disponibles

Subject : Advanced Operating Systems (Distributed systems) (MC0085)<br><br>Provi

ded by <a href='http://www.programmer2programmer.net'>www.programmer2programmer.

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

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

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

align='top'>Part multitasking</td></tr><tr><td width='41' align='left' valign='t

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

left' valign='top'>Multiprogramming</td></tr><tr><td width='41' align='left' val

</b></td><td width='711' align='left' valign='top'>only c</td></tr><tr><td widt

b>D) </b></td><td width='711' align='left' valign='top'>Neither A nor B</td></tr

' valign='top'><b>Q.46 </b></td><td width='749' align='left' valign='top' colspa

le border='0' width='600' id='table1_0_50'><tr><td width='41' align='left' valig

width='749' align='left' valign='top' colspan='2'>Primary partitions are ______<

Unsecure</td></tr></table><table border='0' width='600' id='table1_0_60'><tr><td

00' id='table1_0_65'><tr><td width='41' align='left' valign='top'><b>Q.66 </b></

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

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

up <br>b. To protect a file against accidental <br>overwriting <br>c. </td></tr>

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

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

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

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

n='left' valign='top' colspan='2'>Match the following: <br>Set A <br>a. ps <br>b

</td><td width='711' align='left' valign='top'>0, 1 and nonpositive</td></tr><tr

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

/td><td width='749' align='left' valign='top' colspan='2'>Partitioning Hard disk

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

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

left' valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>i-d,

r>c. Granularity <br>d. Convenience <br>e. Modularity <br>f. Computation speedup

a, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'>&nbsp;</td>

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

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

Vous aimerez peut-être aussi

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

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

/tr><tr><td width='41' align='left' valign='top'> </td><td width='34' align

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

></tr><tr><td width='41' align='left' valign='top'> </td><td width='34' ali

</td><td width='34' align='left' valign='top'><b>D) </b></td><td width='71

with its children</td></tr><tr><td width='41' align='left' valign='top'> </

</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'

' align='left' valign='top'> </td><td width='34' align='left' valign='top'>

a, iii-c, iv-d</td></tr><tr><td width='41' align='left' valign='top'> </td>

- c</td></tr><tr><td width='41' align='left' valign='top'> </td><td width=