Total No. of Questions : 8] SEAT No.

8
23
PB3640 [6261]-48 [Total No. of Pages :2

ic-
tat
S.E. (Artificial Intelligence and Data Science)

9s
OPERATING SYSTEMS

1:2
02 91
(2019 Pattern) (Semester- III) (217521)

3:4
0
41
Time : 2½ Hours ] 7/0 13 [Max. Marks : 70
0
Instructions to the candidates:
5/2
.23 GP

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Neat diagrams must be drawn wherever necessary.
E
82

8
3) Figures to the right indicate full marks.
C

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

tat
8.2

9s
.24

1:2
Q1) a) What is a deadlock? State and explain the conditions for deadlock to
91
49

3:4
occur. [6]
30
41

b) Write the structure of Producer-Consumer problem in bounded buffer

01
02

using semaphore. Discuss how critical section requirements are fulfilled?

5/2

[6]
GP
7/0

c) What is semaphore? Explain the concept of binary semaphore. [5]

CE
82

8
23
OR
.23

Q2) a) State and explain in brief different methods of handling deadlock. ic-[6]
16

tat
8.2

9s

b) What is Readers-Writers problem? How Reader and Writer processes

.24

1:2

synchronize? [6]
91
49

3:4

c) What is monitor? Explain the concept of monitor with example. [5]

30
41
01
02

Q3) a) Explain segmentation with suitable diagram. [6]

5/2
GP
7/0

b) How sharing and protection is provided in a paging system? Explain

CE

with suitable diagram. [6]

82
.23

c) Explain with example first-fit, best-fit and worst-fit memory allocation

16

techniques. [6]
8.2

OR
.24
49

P.T.O.
Q4) a) Explain paging with suitable diagram. [6]

8
23
b) Write a short note on swapping. [6]

ic-
tat
c) What are the advantages and disadvantages of fixed and dynamic

9s
partitioning of memory? When there is a need of compaction? [6]

1:2
02 91
3:4
0
Q5) a) Which are different file organization techniques? Describe any one in

41
brief. 7/0 13 [6]
0
b) What is an I/O buffer? What is its use? [6]
5/2
.23 GP

c) Describe any one disk scheduling policy with an example. [5]

E
82

8
OR
C

23
ic-
Q6) a) What are the file access methods? Explain them in detail. [6]
16

tat
b) Describe working of FIFO and C-SCAN algorithms with suitable
8.2

9s
diagrams. [6]
.24

1:2
91
c) Write a note on free space management. [5]
49

3:4
30
41

Q7) a) How process and threads are implemented in Linux? Explain. [6]
01
02
5/2

b) How process scheduling is performed in Linux? [6]

GP
7/0

c) What are goals of Linux? Also interfaces to linux. [6]

CE
82

8
OR

23
.23

Q8) a) Explain process management system calls in Linux. [6]

ic-
16

tat
b) Write a short note on kernel structure. [6]
8.2

9s

c) Define the components of LINUX system with diagram. What is the

.24

1:2

responsibility of kernel in LINUX operating system? [6]

91
49

3:4
30
41


01
02
5/2
GP
7/0
CE
82
.23
16
8.2
.24
49

[6261]-48 2