//se
For More Question Papers Visit - www.pediawikiblog.com
ile:14€9!{t}+{ '+
r:7
i'J
z
USN
.,$s li'i1
rbcsss
?l
Fifth Semester B.E. Degree Examind
,2015lJan.20l6
Operating Systems Time: 3 hrs.
Max. Marks: lOp
tu
I a.
!
b.
($
6 (g
c.
0) (d 0)
-A
,i:ti|; ,l*
Define an operatiing system? What is system's viewpoiint of an operating qysfam? -1;--- Explain the dual mode operation of an operating system. id*;.u,) Explain the types of multiprocessor systems and the types of clustering. What are fault (06 Marks) tolerant systems? (06 Marks) Explain the concept of virtual machines.
g.
o o
!
What is a process? Draw and explain the state diagram ofua.".process. Give a note on context
2
lo
Ss E=
l
switch.
''u'E
Ec oo =T coa
/;i1!'
*+ i. ?;"3, -
co
PART o)
m
Note: Answer FIVE full questions, selecting at least TWO questions fro* each part.
b.
es Yd
0
Pz
0
P3
J
2
J
Pq
5
1
4
Ps
10
10 1
1
4...,..
!:.:;;::,
t,
ik
EE
Priority
Pr
a
w
tr'tr o>
2
(dO
ooi (!(B
'f,r
ls, =E !d
" ..+.1, *d., threadi issues that come *
c.
Discuss any 3
a.
What are Describe
with multithreaded
programs.
(04 Marks) of semaphores. cess solution to critical section problem which uses test and set ( ) . Prove how this algorithm satisfies all the requirements of critical
ho?es? Explain any three use cases
.p
se
[em's solution. how Readers - writers problem can be solved using semaphores.
w w
L
o
60
\{ *i5 ts aa 6 s" fl-v q,\e#s o -"i'5qf,P
w
-
-
Po
C.I
Pr
rt)
o
z
Pz
d
P3
o
P+
o,
AB
002 100 135 63 t43
C
2
lf a request from process
c.
ABC ABC 102 004 201 137 8 42 1 5 7. Pz arrives
for (0 0 2), can the request be granted immediately? (10 Marks) (04 Marks)
How is a system recovered from deadlock?
For More Question Papers Visit - www.pediawikiblog.com
I of2
3:.:.t:;llLl*'
j:."
ii! 'i'?
(08 Marks) (08 Marks)
ith the help of a system model, explain a deadlock and discuss the necessary conditions that must hold simultaneously in a system for a deadlock to occur. (06 Marks) Usine Banker's alsorithm determine whether the following system is in a safe state. Process Allocation Max Available
4
+.
(06 Marks) (u0 NrarKs, (06 Marks)
ed
2-B b.
ia
ecllflon of o these processes using FCFS'and pre-emptive Draw Gantt charts illrrsfre illustrating-'t$e'bxecution priority scheduling algoritffi"-Assume highest priority: 1 and lowest priority: 4. Also, calculate average waitinF;lii,ft€ and averuge turn around time of both the algorithms.
oo r9
oo
(08 Marks)
ib
Arrival Time Burst Time
Process
ut ol do
,
Consider the following set of processes. Assume the length'of the CPU burst time is given in
ll
,EA .d+
.r,;
For More Question Papers Visit - www.pediawikiblog.com
PART _ B
example. string r,2,3,5,2,3,5,7,2,1,2,3,8,6,4,312,2,3,6.
5a.
Discuss paging with an Consider the following page reference
Assuming there are 3 memory frames, how many page faults would occur ii) Optimal D Note that initially all frames are What is thrashing?
LRU
Algorithm. empty. Explain.
dS
m
b.
(08 Mapks)
,1- r in the Wffibf O( f/
lo
g. co
(06 Marks) (\L/ \d{ "t (06 Marks) c. * ^q) (Q6-!talkq) 6a. Explain the different file access methods. *-*m t r* W b. Describe the various directory structures. ioii'rtilfl6:-u'r'ts+d'it *,.$ 1, (06 Marks) c. Write a note on any four different methods for managing free S*dd 7 a. Suppose the position of cylinder is at 53. The disk driv& Ccylinders numbered from 0 to
E1h" purpose.
:to
vvllttr short SI-lUIt IlUtcS Write notes UIr on :
d*\
Linux ,d;\/
b.
Process Management in Linux file system.
c. d.
Benefits of Multi threading;5 e;,*ii Inter process communic{i@
a.
ib
case.
ia w ik
b.
199. The queue of pending request in FIFO orderffi"98, 183, 37,122, l4;'t24;65;''67;'""'""= "'"" Starting from the current head position, what is theWll distance traveled (in cy.lrndgf$).rb1,,:;i_r.;Hn the disk arm to satisff the requests using alftithms FCFS, SSTF, SCAN ;nd'Iiiok. . ..,,{.1&Hs,_d.&-*Ft&IrIiS Illustrate with figures in each '' Describe the access matrix model used for.plofection (0s Marki)
'n( !'
_
*$*
F
{<*t**
.p
ed
\.i
i.,",
w
,4- k
*'. i \.$ fl*s
I
t'\w
w
\{ r\
r*^b d t
.{Y \q\/}
w
*.4\*
2 of2 For More Question Papers Visit - www.pediawikiblog.com
(20 Marks)
