Total No. of Questions :6] SEAT No.

8
23
P75 [Total No. of Pages :3

ic-
Oct./ TE/ Insem. - 194

tat
T.E. (Information Technology)

1s
7:1
OPERATING SYSTEM

01 91
0:3
(2015 Course) (Semester - I) (314444)

0
91
2/0 13
Time : 1 Hour] [Max. Marks :30
0
8/2
Instructions to the candidates:
.23 GP

1) Answers Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6.

E
82

2) Neat diagrams must be drawn wherever necessary.

8
C

23
3) Figures to the right side indicate full marks.

ic-
4) Assume suitable data, if necessary.
16

tat
8.2

1s
.24

7:1
Q1) a) Write C program for fork system call in which main program accept the
91
49

array, parent process sort and display the element in ascending order
0:3
30

whereas child process sort and print elements in descending order by

91

using any sorting strategy. [6]

01
01

b) Explain the difference between the monolithic kernel and a microkernel

8/2
GP

with advantages and disadvantages. [4]

2/0

OR
CE
82

8
23
Q2) a) Explain the concept of virtual machine with its implementation and benefits.
.23

ic-
Also explain example of virtual machine. [6]
16

tat
b) State and explain different services provided by an operating sytem. [4]
8.2

1s
.24

7:1
91

Q3) a) For the table given below calculate the average waiting time and average
49

0:3

turn around time and draw a Gantt Chart illustrating the process execution
30
91

using following scheduling algorithms. [8]

01
01

i) RR (Time slice -2 units)

8/2
GP

ii) SJF (non-preemptive)

2/0

Process Arrival Time Burst time

CE
82

P1 0 10
.23

P2 1 06
16

P3 2 12
8.2

P4 3 15
.24

TE/ Insem. - 194 1 P.T.O.

49

JOIN @PuneEngineers | Telegram

 b) How PCB helps in process management? Explain the structure of PCB.

8
23
[2]

ic-
OR

tat
Q4) a) For the table given below calculate the average waiting time and average

1s
turn around time and draw a Gantt Chart illustrating the process execution

7:1
01 91
using following scheduling algorithms.

0:3
0
i) RR (Time slice - 2 units) [8]

91
2/0 13
ii) FCFS
0
8/2
.23 GP

Process Arrival Time Burst time

E

P1 0 4
82

8
C

23
P2 1 5

ic-
16

tat
P3 2 2
8.2

1s
P4 3 1
.24

7:1
91
49

0:3
P5 4 6
30
91

P6 6 3
01
01

b) Differentiate between thread and process. [2]

8/2
GP
2/0
CE
82

8
Q5) a) Consider the following snapshot of a system: [6]

23
.23

Allocation Maximum Available ic-

16

tat
8.2

1s

A B C D A B C D A B C D
.24

7:1

P0 0 0 1 2 0 0 1 2 1 5 2 0
91
49

0:3
30

P1 1 0 0 0 1 7 5 0
91
01
01

P2 1 3 5 4 2 3 5 6
8/2
GP

P3 0 6 3 2 0 6 5 2
2/0
CE

P4 0 0 1 4 0 6 5 6
82
.23

Answer the following question using banker’s algorithm.

16

i) What are the contents of need matrix?

8.2

ii) Is system in a safe state?

.24

TE/ Insem. - 194 2

49

JOIN @PuneEngineers | Telegram

 b) Write a Semaphore solution for reader-writer problem. [4]

8
23
OR

ic-
tat
Q6) a) What is busy waiting with respect to process synchronization? Explain

1s
how semaphore solves problem of synchronization. [6]

7:1
01 91
b) How resource allocation graph helps to deadlock? Write the necessary

0:3
conditions of deadlock to be occurred. [4]

0
91
2/0 13
0
8/2
.23 GP


E
82

8
C

23
ic-
16

tat
8.2

1s
.24

7:1
91
49

0:3
30
91
01
01
8/2
GP
2/0
CE
82

8
23
.23

ic-
16

tat
8.2

1s
.24

7:1
91
49

0:3
30
91
01
01
8/2
GP
2/0
CE
82
.23
16
8.2
.24

TE/ Insem. - 194 3

49

JOIN @PuneEngineers | Telegram