USN 10css3

Fifth Semester B.E. Degree Examination, June/July 2014

Operating $ystem
hrs. Max. Marks:100-
*"rd'.Tittt":3 Note: Answer FIVEfult questions, selecting
d Jt;'
*+rw "^-.^^.'r^-^ a..^--^'^^^r^ *.P,.5"
3 at^-^a.rrr/a-1
atleast TWO questionfrom each part.
--lt
g *u*. Kl

E
E
6
,'.".{,,*
-
r
pART
r nl\ I
-A
-
A ry
',,,,,,,

€ I a. "E-xolain
multiprogramming and time sharing operating systems. .:l '.;"'
" (08 Marks)
E b. List'qpt the different serviies that an OS provides? Explain any two. ,{h; '' (06 Marks)
o g
oo
c. What are
::
the different categories of system program? Explain. l';,,,,, ''' (06 Marks)
::::::-;:: ii__ i
,,

'={
o. :':*/
:::,8,..!
"''l

7
3 2 a. With neat dragram, exnlain components
diasram- explain PCB-
comnonents of PCB. 1
)
" ". f;-'
(05
(05 Marks)
? b. \i
Explain direH,&d indirect communication with respect to mg6p$'passing p, systems.
bo
,flY *J
ca
T ffire ffirywse
.dq. ,t '
(05 Marks)
s
an
c. set of processes with CPU burst tide\in
Consider the folloaftfiLg-set
sB
tfuSe\in m secs)
I bi
(.)' \* i
ttme
'-6F ln."fiPocess
**BJocess I ttme .r/t*J
Arrival time
Arrtval t],Burst
Burst time
0 6
I

l-/,&
&*,
,Pi.+
| 0 l- 6 I

AJ
r
.9
1 ,.t "a'l;ii J
r rl c
Pr rrr n I
= - I

e =
o r
in I P,
Pr d",-*:' 'i 1"n\ * 3'' | +
4 I

o
"
;:..;
i) Draw Gantt chart illustratinq'@e,ffiebution
illustratinq*{e#ebution of above
above processes using SRTF and non
b0
F
cg
€Lo..'
h.^^*^+;.,^
--^^--+:-.^
pt lwlrtpll
..\ PreemPtive Yv SJF
o TTI
Q TE
JJt
1 ,. J4l
ii) Find the turn around timex""foi each proce*.e* fot SRTF and SJF. Hence show that SRTF'
>l
tE is faster than SJF. *-.{".t' *;n (10 Marks)
o .f*tp.nb
f
! ^ ",'"

a. o-i 3 a. What do you mean by a binary semaphore and :counting semaphore? Explain the
F implementation of-Wdit( ) and signal( ) semaphore operatior-l;, (10 Marks)

! .E b. What is race condiiton? List the requirements that a solutftilr-to^critical

",:::.:::", section must satisfy.
(J
E (05 Marks)

E c. Explain pTJ. one synchronization problem for testing newlyl;glgprsed synchronization

o €
L
scheme,*u-t
oo
E
o q*.%,fS" '"*'"ir
,#'
g
,+t"...);?

()
(s
4 a. eq#ffb. the following snapshot of resource allocation at time tr ld ,,,,,,,,,,.,,,

3 (l)i-

o E u i, Allocation Request Available '

;'t.-,
''.. "'.
o F i";'"., AB C AB C AB C
;'.....:.,P0010000000,.
c'i ,r";ripr2oo2o2vvu'"'l$t
o
o
z
o
0,
\Fs'-p i:P+002002
) ???33 -

E
i) Show that the system is not deadlocked by generating one safe sequence
ii) At instance tz, Pz makes one additional request for instance of type C. Show that the
system is deadlocked if the request is granted. Write down the deadlocked processes.
(08 Marks)
b. Describe resource allocation graph
i) With deadlock ii) With a cycle but no deadlock. (06 Marks)
c. What is wait for graph? Explain how it is useful for detection of deadlock. (06lvtarks)
 t0cs53

PART _ B

,1,N, 5 a. Explain internal and external fragmentation, with examples. (06 Mar
*?;i-. b. _C_onsiderthefollowingpagereferencestringl,2,3,4,2,I,5,6,2,I,2,3,7,6,3,2,Lt:E:'6, -sJ

*J"?-* How many page faults would occur for the following asrffig
%ril/fu 3 and 5 frames-. i) LRU ii) optimal. ' - "- "'page replac€ment algorithms *-"-^'-^;c,gg{arks)
'e. 'lWhat is the cause of Thrashing? How does the system
J - detect thrashing?
-----'^---o foi'lru.r.s;
t ".,I
{ " r,
6 a. iW'hat=do you mean by free space list? With suitable example, explain - qrry*,#J-ethods
'' \
of
irnp'ffientation of free space list. "
" (08 Marks)
b. What"me--r'the three methods for allocating disk space? Explain with-su{table example.
P,* . (12 Marks)
*{*
7 a. Suppose that a disk.has 50 cylinders named 0 to 49. The,ffp h6ad is currently serving at
cylinder 15. The@e of pending requests are in orderr..!'ffffi 11 35 7 14 starting from1he
current head positi&ffihat is the total distance travelffin cylinders) by the disk arm to
satisfy the requests uiinq;algorithms FCFS, SSTF drfr.I.OOI(. Ilustrate with figure in each
case. "' ,,ri,r*r (12 Marks)
b. Write a note on : i.n .,:,i,3
t
i) Domain of protection V' * . t,
l*\
ii) Access matrix. q"k *' (0E Marks)
(08
-
ffL.*d"

8 a. with diagrarn, explain ccmponegt{"fff'lfm,rix system. (08 Marks)

b. Explain in detail, the compone@fiet the kerpe{module support under Linux. (r2 Marks)
u
"****
,i*"
{ %- w F-,
@' .df4L

/P
.

" {<***tk
i% a
.,,".. {{:.!:
a_ J
4-._ %f rsq,
' 1*;
:;k"3*rl ''
{
\
{.
\L. q\r
%""
\-,)
, \#... "^
"",*
qnq-'41"
!4.::'"4, \ p
?r;f I 7:::::
,....--t,,,. "'
*i .,
k
,".,*^ ?
%;t*+?# .2.1
..fi:."
!4."- L X* -
{ u$", "
{.:t/.a",^
*"*;,3
:,4.q0,"1
" o* *
6
'- . '',,,,1: ':t, -a'f{'r}

..*,,,',. '"i !,,.'::

.. if.-a"r' ..:"aa:

t u"\ ,"")
\4' 'P
*#_
w

2 of2
 USN 10css3

Fifth Semester B.E. Degree Examination, June/July 2014

Operating $ystem
hrs. Max. Marks:100-
*"rd'.Tittt":3 Note: Answer FIVEfult questions, selecting
d Jt;'
*+rw "^-.^^.'r^-^ a..^--^'^^^r^ *.P,.5"
3 at^-^a.rrr/a-1
atleast TWO questionfrom each part.
--lt
g *u*. Kl

E
E
6
,'.".{,,*
-
r
pART
r nl\ I
-A
-
A ry
',,,,,,,

€ I a. "E-xolain
multiprogramming and time sharing operating systems. .:l '.;"'
" (08 Marks)
E b. List'qpt the different serviies that an OS provides? Explain any two. ,{h; '' (06 Marks)
o g
oo
c. What are
::
the different categories of system program? Explain. l';,,,,, ''' (06 Marks)
::::::-;:: ii__ i
,,

'={
o. :':*/
:::,8,..!
"''l

7
3 2 a. With neat dragram, exnlain components
diasram- explain PCB-
comnonents of PCB. 1
)
" ". f;-'
(05
(05 Marks)
? b. \i
Explain direH,&d indirect communication with respect to mg6p$'passing p, systems.
bo
,flY *J
ca
T ffire ffirywse
.dq. ,t '
(05 Marks)
s
an
c. set of processes with CPU burst tide\in
Consider the folloaftfiLg-set
sB
tfuSe\in m secs)
I bi
(.)' \* i
ttme
'-6F ln."fiPocess
**BJocess I ttme .r/t*J
Arrival time
Arrtval t],Burst
Burst time
0 6
I

l-/,&
&*,
,Pi.+
| 0 l- 6 I

AJ
r
.9
1 ,.t "a'l;ii J
r rl c
Pr rrr n I
= - I

e =
o r
in I P,
Pr d",-*:' 'i 1"n\ * 3'' | +
4 I

o
"
;:..;
i) Draw Gantt chart illustratinq'@e,ffiebution
illustratinq*{e#ebution of above
above processes using SRTF and non
b0
F
cg
€Lo..'
h.^^*^+;.,^
--^^--+:-.^
pt lwlrtpll
..\ PreemPtive Yv SJF
o TTI
Q TE
JJt
1 ,. J4l
ii) Find the turn around timex""foi each proce*.e* fot SRTF and SJF. Hence show that SRTF'
>l
tE is faster than SJF. *-.{".t' *;n (10 Marks)
o .f*tp.nb
f
! ^ ",'"

a. o-i 3 a. What do you mean by a binary semaphore and :counting semaphore? Explain the
F implementation of-Wdit( ) and signal( ) semaphore operatior-l;, (10 Marks)

! .E b. What is race condiiton? List the requirements that a solutftilr-to^critical

",:::.:::", section must satisfy.
(J
E (05 Marks)

E c. Explain pTJ. one synchronization problem for testing newlyl;glgprsed synchronization

o €
L
scheme,*u-t
oo
E
o q*.%,fS" '"*'"ir
,#'
g
,+t"...);?

()
(s
4 a. eq#ffb. the following snapshot of resource allocation at time tr ld ,,,,,,,,,,.,,,

3 (l)i-

o E u i, Allocation Request Available '

;'t.-,
''.. "'.
o F i";'"., AB C AB C AB C
;'.....:.,P0010000000,.
c'i ,r";ripr2oo2o2vvu'"'l$t
o
o
z
o
0,
\Fs'-p i:P+002002
) ???33 -

E
i) Show that the system is not deadlocked by generating one safe sequence
ii) At instance tz, Pz makes one additional request for instance of type C. Show that the
system is deadlocked if the request is granted. Write down the deadlocked processes.
(08 Marks)
b. Describe resource allocation graph
i) With deadlock ii) With a cycle but no deadlock. (06 Marks)
c. What is wait for graph? Explain how it is useful for detection of deadlock. (06lvtarks)
 t0cs53

PART _ B

,1,N, 5 a. Explain internal and external fragmentation, with examples. (06 Mar
*?;i-. b. _C_onsiderthefollowingpagereferencestringl,2,3,4,2,I,5,6,2,I,2,3,7,6,3,2,Lt:E:'6, -sJ

*J"?-* How many page faults would occur for the following asrffig
%ril/fu 3 and 5 frames-. i) LRU ii) optimal. ' - "- "'page replac€ment algorithms *-"-^'-^;c,gg{arks)
'e. 'lWhat is the cause of Thrashing? How does the system
J - detect thrashing?
-----'^---o foi'lru.r.s;
t ".,I
{ " r,
6 a. iW'hat=do you mean by free space list? With suitable example, explain - qrry*,#J-ethods
'' \
of
irnp'ffientation of free space list. "
" (08 Marks)
b. What"me--r'the three methods for allocating disk space? Explain with-su{table example.
P,* . (12 Marks)
*{*
7 a. Suppose that a disk.has 50 cylinders named 0 to 49. The,ffp h6ad is currently serving at
cylinder 15. The@e of pending requests are in orderr..!'ffffi 11 35 7 14 starting from1he
current head positi&ffihat is the total distance travelffin cylinders) by the disk arm to
satisfy the requests uiinq;algorithms FCFS, SSTF drfr.I.OOI(. Ilustrate with figure in each
case. "' ,,ri,r*r (12 Marks)
b. Write a note on : i.n .,:,i,3
t
i) Domain of protection V' * . t,
l*\
ii) Access matrix. q"k *' (0E Marks)
(08
-
ffL.*d"

8 a. with diagrarn, explain ccmponegt{"fff'lfm,rix system. (08 Marks)

b. Explain in detail, the compone@fiet the kerpe{module support under Linux. (r2 Marks)
u
"****
,i*"
{ %- w F-,
@' .df4L

/P
.

" {<***tk
i% a
.,,".. {{:.!:
a_ J
4-._ %f rsq,
' 1*;
:;k"3*rl ''
{
\
{.
\L. q\r
%""
\-,)
, \#... "^
"",*
qnq-'41"
!4.::'"4, \ p
?r;f I 7:::::
,....--t,,,. "'
*i .,
k
,".,*^ ?
%;t*+?# .2.1
..fi:."
!4."- L X* -
{ u$", "
{.:t/.a",^
*"*;,3
:,4.q0,"1
" o* *
6
'- . '',,,,1: ':t, -a'f{'r}

..*,,,',. '"i !,,.'::

.. if.-a"r' ..:"aa:

t u"\ ,"")
\4' 'P
*#_
w

2 of2