IIII

USN

Fi ft h Semester R.E. Degree Examination, Dec.2013/Jan.2014

Operating Systems

~.

00

~fi
/Q

d'

:c~

~
"
=~

2 +

E
= "0

il
=

-5
= C

betwee;'~'?J

-o~ -.e"
0

O ~

~f~~

.....

";. ~

i)
ii)
c. Describe. theJtct ions an operating system takes to context switch ber( en proce sses.

11

~ 'e

~~
5-11

~;;:

.s ~

-0

~u

g'h

a. E
Dining-Philosopher' s problem using monitors.
/(..
b. .f"\..
What is race condition? Explain Reader' s writer' s problem with semaphores.?

0'"

4 Ca. For the following snapshot find the safe sequence using Banker' s algorit hm:
...\
The number of resource units are Rr , R2, R3 which are 7, 7, 10 respectively.

11~

Process Allocated resources Maximum requirements

R,
R,
RI
2
2
3
6
8
3
PI
P,
2
0
3
4
3
3
PJ
I
2
4
3
4
4

~ .~~

~~

...; .-.i

(04 Marks)

(10 Marks)
(10 Marks)

-Q

~Q-

VA
AJ

(06 Marks)
(06 Marks)
Dead lock exists if a cycle exists. Yes or no. Justify your answer with a suitable example.
(08 Marks)
lof 2

b. Explain different methods to recover from deadlock .

c.

8.

(08 Ma rks)

"

~~

(06 M"ks)

Prooes: Burst time Arrival time

0
IlV A
<PI.:'"
I
V
.'1.. P',
~
0
P,
2
I
n
~
P,
lQ/2
4
P,
2)'
3
C"
Draw Gantt ~harts using FCFS, SJF preemptive and notlPJ;remptive scheduling.
Calculat ~ average waiting time for each of the schedurrn~lgorithm.
(08 Marks)

.E-~

~.

<1>

a. Differentiate
-,
i)
Process and a threa<l.(':)
~
ii} Short term and mediumf~5P1 schedules~ ~
iii) User level and kemel levl1 ~ilds.
iv) Waiting and tum around ti 01e;"
'/' . "
b. Consider the following set ofproces ie' ~it h arrival time:

~ ~

"

a. Explain ~e-8.dvantage of the layered approach with a neat diagrar:~

(06 Marks)
(08 Marks)
b. What are;~ machines? Explain its advantage with a neat )f~7.dn.
tal properties of batch, real time and dist~ ed operating systems?
c. What are the es

: .9

,~

<:,

PART-A

,,~

,,-<0

.(;j~

0:..':5

No te : A ns wer FIVEfulJ questions, selecting

at least TWO questions from each p art.

~.lI

Max. Mar~ 0

' me : 3 hrs.

8. '"
~

lOeSS3

lOeSS3
PAR T - B

Why are translation loan-aside bubbles (TLB) important? In a simple paging system. what
information is stored in TLB ? Explain.
(08 Marks)
b. Given memory partitions of lOOK. 500K. 200K, 300K and 6OOK, apply first fit and best fn
algorithm to place 212K, 417K. 112K and 426K.
(04 Mnk
What is swapping? Does this increase the operating systems overhead? Justify your answer.

a.

is a file? Explain the different allocat ion methods.

, at.are directories? Write a brief note on mounting file systems.

c.

I ~ free space managed? Explain.

~

a. Explain~ifference between protection and security? Descrilfe.' (

lists to i~~~t protect ion.
A,\ V
b. Write short nme"",) >:
, \
i)
Swap spacY~nagement.
ii)
Revocation 0
e 55 rights.
" V

"

c:,

1>1000)

~qjtlO Marks)

(05 Marks)
(OS Mar-ks)

scheme of capability
(10 Marks)

('l,\

a. What are the design prindi

ofLinux operating
(ems? Explain.
b. What do you mean by clomn Q:\Jow is it achi,e\ed in Linux systems?
c. How is IPC handled in Linux? ~X1l ain with~Jitable example.

'"

<,\CP,

~V 7.

.'1..

6'~

(10 Mar-ks)

(08 Marks)
(06 Marks)
(06 Marks)