Total No. of Questions : 8] SEAT No.

8
23
PA-1295 [Total No. of Pages : 3

ic-
[5925]-326

tat
5s
S.E. (Artificial Intelligence and Data Science)

9:5
02 91
OPERATING SYSTEMS

3:1
0
(2019 Pattern) (Semester - III) (217521)

31
1/0 13
0
2/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates:

E

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

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
8.2

4) Assume suitable data, if necessary.

5s
.24

9:5
91
Q1) a) What is deadlock detection and recovery? Explain two options of
49

3:1
deadlock recovery.
30

[6]
31
01

b) What is the producer consumer problem? How to solve it using

02

semaphore and Mutex?

2/2

[6]
GP
1/0

c) What are different types of classical synchronization problems? Explain

CE

any one in detail.

80

8
[6]

23
.23

OR
ic-
16

tat
Q2) a) What is Inter Process Communication? Why it is important for operating
8.2

5s

system. [6]
.24

9:5
91

b) Write short note on critical section, Monitors and mutex. [6]

49

3:1
30

c) What do you mean by pipe? Explain anonymous and named/FIFO

31

pipe.
01

[6]
02
2/2
GP
1/0

Q3) a) Explain the following term : [6]

CE
80

i) Compaction
.23

ii) Belady's anomaly

16
8.2

iii) Thrashing
.24
49

P.T.O.
 b) Why is the principle of locality crucial to use of virtual memory? Explain

8
with example.

23
[6]

ic-
c) Reference String 1 2 3 2 1 5 2 1 6 2 5 6 3 1 3 6 1 2 4 3. Execute LRU

tat
and OPR on above string. Consider page frame of 3 pages Write page

5s
hit and page faults if any. [5]

9:5
02 91
OR

3:1
0
Q4) a) Write and explain algorithms for :

31
[6]
1/0 13
i) Allocating region
0
2/2
.23 GP

ii) Freeing region

b) Differentiate between :
E

[6]
80

8
C

23
i) Internal and external fragmentation

ic-
16

tat
ii) Fixed and variable size partitioning
8.2

5s
c) Explain in brief what is paging and segmentation. How logical physical
.24

9:5
Address Translation is done in both.
91
[5]
49

3:1
30
31

Q5) a) What is file system? Explain File system implementation in detail. [6]
01
02
2/2

b) Explain following term with respect to directory structure

GP

[6]
1/0

i) Two level directory structure (with diagram)

CE
80

8
23
ii) Tree structured Directories (with diagram)
.23

c) Define following term with respect to disk access ic-

16

[6]
tat
8.2

5s

i) Seek time
.24

9:5

ii) Rotational Latency

91
49

3:1
30

iii) Data transfer time

31
01

OR
02
2/2
GP

Q6) a) Explain directory structure with types its types. Also discuss directory
1/0

implementation in details. [6]

CE
80

b) What is free space management (FSM)? Explain how bit vector and
.23

linked list performs on FSM. [6]

16

c) What is the advantage of the double buffering scheme over single

8.2

buffering? [6]
.24
49

[5925]-326 2
Q7) a) Explain scheduling in [6]

8
23
i) Linux Operating Systems

ic-
tat
ii) UNIX free BSD OS

5s
b) Explain grep utility and its variations with examples.

9:5
[5]

02 91
3:1
c) Explain system calls exec() and brk(). [6]

0
31
1/0 13 OR
0
2/2
Q8) a) What are the requirements for Linux system administrator? Define the
.23 GP

design principles of LINUX systems. [6]

E
80

8
b) Explain different types of hypervisors. [5]
C

23
ic-
c) Explain in detail the memory management in LINUX system. [6]
16

tat
8.2

5s
.24

9:5
91

49

3:1
30
31
01
02
2/2
GP
1/0
CE
80

8
23
.23

ic-
16

tat
8.2

5s
.24

9:5
91
49

3:1
30
31
01
02
2/2
GP
1/0
CE
80
.23
16
8.2
.24
49

[5925]-326 3