' paper / Subject Code:

SE (ro*p) f Sn* rv R-rr I ) 1 z

Du'ration:3hrs

N.B.: (1) Question No 1 is Compulsory.

o6
(2) Attempt any three questions
(3) All questions carry equal
(4) Assume suitable data, if and it

1 Attempt any FOUR

a What is an Operating its
b Explain in brief the
c Define Thread.
d Whatis a a to
e Explain MFT

2a Discuss CPU
b Explain of

3a 1n

L b the

4a 1S the an
b disk 00
as 20, 50, 25,
that 1S

be head
as to
it

110l
[10]
to

proposed to t10l

the [10]
Available
BC :D
.l
A BCD
PO 2 +. )z 1 1

P 1 50 11 0

2 5 1 54
6 JJ

I 56 2 1 2
(2M)
of instances of each type A, B, C, D (2r![)
Matrix
is in Safe State. If so, find the Safe Sequence (6IvD

Page 1 of 1

080895368 I 9395OFB2662CA
 Palrer / Subject Code: 10524 / Operating System

C?- (e:n\P ('r; rT) nr (n -rll

_) qli lf -) J
(Xf ('r'ric -1FSte, \Git2l2 ,

Duration: 3hrs [Max Marks:80]

N.B. :

Q. 1 Attempt any FOUR [201

a Explain Goals and objectives of OS tsl
b Differentiate betrveen Preemptive and Non-preemptive scheduling tsl
algorithnrs
c Explain Resonrce Allocation Graph rvith an example l5l
d Write in detail aboLit Memory lvlarragement Requirements lsl
e Discuss File access n',ethods [.i]

Q. 2 a Discuss Prorlucer and Consumer ploblem with solr.rtion using Semaphoru- [10]
b Explain cliffererrr sU'Lrcrut'es of Op.'ratiug System [101

Q.3 a What is thr't'olc ol-PCB'? Explain the stmcfure of PCB with its [101
disadvantage-.
b ' Explain Deadlock Avoidance algorithms with example. u0l
Q' 4 *:r1"'Tl:t:i":','.: wit]r.suilafte examples
:b :in',"'" l":'
Discuss in derail abor-rt Disk Scheduling Algorithms with an examples
[10]
[101

Q. 5 a Explain Memor'1'Allocation Strategies with suitable exampies [101

b Explain Five stare Process model with two suspendeci states lt 0l

Q. 6 Write short:ot:s on Following [201

a Concept of ivlLtltithleading tsl
b Principles of Clor rcurrcncy lsl
c TLB lsl
d File Directories lsl
*,f)k>k*****>kXr<*

t."
t. ''

'.,'.

38918

.10 8(,ti BC D69D FAL 2CAE5 5 E5C I 67 U F'2 F7C

 Faper / Subject Code: $SZ4l Operafing System
Cornf SErh-ty/ R.^tg Ce-Jehnm.e) /(f '
( 'F.g1". I ru.l p-zfsp/l
v-'|\ t 4 7 ' *5- v"3
,rrs / '

Duration:3hrs , [Max lV{arks: 80]

Arrlv*I
Froeera Burrt Timr ?nms
PL 10 o
F2 5 1
p3 2 A
 B7
F0
23
5B

3
Paper / Subject Code: 40524 / Operating System

X2
7Y

F5
7X
0F

B7
F0
23
5B
YF

X2
7Y

F5
7X
0F
37

B7
F0
23
5B
YF
X2

F5
X
F
7
B7

7
7
0

0
3

3
5B
YF

F
X2

2
F5
Duration: 3hrs [Max Marks: 80]

Y
X
F
7
B7

7
F0

7
0
3

3
5B
YF

F
X2

2
7Y

F5

7Y
N.B.: (1) Question No 1 is Compulsory.

7X
0F
7
B7
0
23

23
(2) Attempt any three questions out of the remaining five.

YF

5B
YF
X2
F5
7X

7X
(3) All questions carry equal marks.

0F
7

7
7
0
3
5B

3
B
F

5B
YF
2
(4) Assume suitable data, if required and state it clearly.

X2
7Y

F5
7X
0F

0F
37
7
0
3
B
YF

B
F

B
F
2

2
5

7Y

F5
1 Attempt any FOUR (Draw neat diagrams if applicable) [20]

7X

F5
X
F
37

7
F0

7
0

F0
3
5B

23
5B
YF
X2

a Differentiate between a Process and a Thread.

X2
Y

7Y
X
F

F
7
B7

7
B7
0

7
0
3

3
b Explain the CPU Scheduling Criteria

23
F

5B
YF
X2

X2
F5

F5

7X
F
37
B7

7
F0

B7
c What is External Fragmentation in Memory Management System? Explain with

0
3
F

5B
F
2

X2
7Y

F5

X2
an example.

7Y

F5
X

0F
B7

7
0

B7
F0
23

B7
d Explain Disk Organization within the OS.
3

3
F

YF
X2

X2
7Y

F5
7X

7Y

F5

F5
e Explain the Critical Section problem.
7

7
0

7
0
3
5B

F0
3
5B

3
F

B
F
2

X2
7Y
7X

7Y

F5
7X

7Y
0F

F
F0

7
F0
23
5B

3
YF

23
5B
X2
2 a Suppose the following disk request sequence for a disk with 200 tracks is given [10]
Y

5
7X

7Y
0F

7X
0F
37

F
7

B7
as:

0
3
B

3
YF

YF
X2

5B
YF
X2

X2
5

F5

100, 150, 20, 180, 30, 70, 190, 50, 120.

0F
37

0F
B7

7
B7

7
B7
F0
3

Assume that initial head position of the R/W head is on track 80. Count the

3
F
X2

YF
2
F5

X2
Y

F5

7Y

F5
X

difference in the distance that will be traversed by the head when SSTF
37
B7
F0

B7

37
0

B7
F0
3

algorithm is used as compared to the SCAN algorithm, assuming that SCAN

F
X2

2
7Y

F5

X2
7Y

F5

7Y

F5
7X

moves towards 200 when it starts the execution.

B7
F0

F0
23

B7
0
3

3
B

b Explain different File Organization Methods. [10]

YF
2

X2
7Y

F5
7X

7Y

F5
7X

F5
37
F0

B7
0
23
5B

F0
3
B

YF
2

X2
7Y

5
7X

5
7X

7Y
F

0F

0F
37

What is a process? Draw and Explain Process State Transition Diagram with six
F0

3 a [10]
B7
23
5B

23
F

F
X2

states.
7Y

5
X

F5
F

7X
0F
B7

37
F0

B7

b Calculate the Hit and Miss Ratio for the following string using LRU [10]
F0
3

5B
X2

X2

technique. Compare the results for frame size 3 and 4 in terms of “number of
7Y

F5

F5

7Y

0F
37
B7
0

hits”
F0
3

23
YF

5B
X2

YF
2
F5

7Y
X

Page String : 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 7, 2, 0, 7, 5, 0, 7, 5
7X
F
37
B7

B7

37
0

F0
3
YF

5B
X2

X2
F5

Y
7X

0F
37
B7

4 a Explain ULT and KLT. Explain the differences between the two. [10]
0

B7
3
5B
YF

YF
X2

X2
F5

F5
0F

b What is a Deadlock? Explain various Deadlock Prevention Techniques. [10]

37
B7

37
F0

B7

F0
F
X2

X2
7Y

F5

7Y
0F
37
B7
F0

B7
23

23
F
X2

5 a Explain the three types of schedulers with a proper diagram illustrating [10]
7Y

F5

F5

7X
37
B7

connection within them.

F0

F0
3

5B
X2

b What is Producer-consumer Problem? Provide the solution to the problem using

7Y

F5

[10]
7Y
X

0F
B7

B7
F0

Semaphores.
23

23

YF
F5

7Y

F5
7X

7X

37
F0

F0
23
5B

5B

X2
7Y
7X
0F

0F

B7
23
5B
YF

YF

F5
7X
0F
37

F0
23
5B
YF
X2

54552 Page 1 of 2
7Y
7X
0F
37
B7

23
5B
YF
2
7X

7X
0F
37
5B

5B
YF

X237YF0F5B7X237YF0F5B7X237YF0F5B7X237YF0F5B7
X2
 F0 23 B7 F0
B7
X2 F5 7Y X2 F 5B
37 B7 F0
F5 3 7Y 7X
5B YF X2 23
7X 0F 37Y
B7
X2
F0
F 7Y
2 5B F0 5B F0
37 7X F5 37 7X F5
YF 23 YF 23 B7
0F 7Y
B7
X2 0 F5 7Y X2
X2 5B F0
6 a
F0 37 B7 37
37 7X F5 X F5

54552
YF YF 23 B7 YF
0F 23 B7 0 7Y 0F
5B 7Y X2 F5 X2 5B
F0 B7 F0 37 i.

v.
ii.
37 7X

iv.
iii.

an OS.
7X F5 YF X2 F5 YF 23
YF
0F 23
7Y
B7 0F5 3 7Y
7Y
B7
X2 0F
5B X2 F
F0 5B
F0 B7 0F 3737 7X
F5 Y 7X X 2 5 B Y F 2
F5
B7 F 23 37 0F 3 7Y
B7
Aging

7 X 0F Y 7X 5 X2
5B YF 237
5B F 0F 2 3 B 7X F 0 37
Thrashing
Starvation

7X 0F Y 7X 5 7Y F5 YF
23 5B F 0F 2 3 B 7X F 0 23
7Y
B7 0F
7X 7Y F5
Convoy Effect

7Y X2 5B
5 2 F
Context Switch

F0 23 B7 F0 3 B7 0 3 7 7X
F5 7Y X2 F5 7Y X2 F5 Y 23
B7 F0 3 7
B7 F0 3 7
B7
X
F0
F 7Y
X2 F5 Y X2 F5 Y F0 2 5 B F0
F0 B7 37
Explain the following terms in brief

37 B7
F 37 X F Y 7X F5
YF X2 5B YF 2 3
5B F 0 23 B7
0F 37 7 X2 0 F5 7 YF 7 X2 F 5B 7 YF X2
5B YF
0F 37 B 7X 0F 3 7Y 7X 0F5 37
7X 5B Y F 2 5 B F 2 3 B7 YF
23 0F 3 7Y 7X 0 7Y 0F

Page 2 of 2
7Y 7X 5 F5 X2 5B
F0 23 B7 F0 2 3 B7 F 0 37
7Y F5 7Y X2 F5 YF
_______________________

F5 X2
B7 F0 3 7Y
B7 F0
F5 3 7Y
B7
X2 0F
F5 X2 F 5B
X2
37 B7 F0 3 7Y
B7 0F5 37 7X
F5 X2 B YF 23
YF
0F
X2
37 B7 F 0 3 7 7 0 F
X2 F5 YF X2 5B
5B YF
3 0 3
Paper / Subject Code: 40524 / Operating System

X237YF0F5B7X237YF0F5B7X237YF0F5B7X237YF0F5B7
7X 0 F5 7Y
B7
X2 F5 7 YF 7X
23 F0 3 B 7 0 23
7Y
B7
X2 F5 7 YF X2 F 5B 7Y
F0 3 B 7 0 3 7 7 F0
F5 7 YF X2 F 5B YF X 23
B7 0 F 3 7 7 X 0F 7Y
X2 5B Y F 2 5B F0
0 7
b With the help of a diagram and an example, explain how a System Call works in

37 7 F 37 X F5
YF X2
3
5B YF 23 B7
0F 7 YF 7 X 0F
5B 7 Y
5B 23 F0
[10]
[10]

7X 0F 7 Y 7X F5
23 5B F 23 B7
7Y 7X 0F 7 Y X2
F0 23 5B
7X F 0 3
F5 7Y F5
B7 F0 23 B7
F5 7Y X2
X2 B F