6

14

15

16

17

18

19

20

a)
b)

a)
b)

a)
b)
a)
b)
a)
b)

D1032 Pages: 2

Consider the following snapshot of a system with five processes 21, P2, P3, P4,
PS and four resources A,B,C,D. Using Bankers Algorithm check whether the

system is in safe state or not.

Allocation Max Available |

Answer any four questions. Each carries 10 marks.
Differentiate logical address and physical address with an example.

What is dynamic storage-allocation problem with respect to contiguous memory
allocation? Discuss the three strategies that act as a common solution to this
problem.

What is demand paging? What are its advantages?

Consider the reference string: 8 4 6 4 3 5 8 4 3 2 3 5 8. Assuming demand paging
with four frames, how many page faults would occur for:-

i) FIFO replacement algorithm

ii) Optimal replacement algorithm

With the help of an example explain the paging concept.

Does paging suffer from fragmentation? Explain.

Compare sequential access and direct access methods of storage devices.

What is the significance of access rights associated with each file in a system?
How can we make a new magnetic disk ready for use (to store files)?

What is swap space? How is it managed in Linux system?

Explain FCFS, SSTF and SCAN disk scheduling algorithms, using thegiven disk
queue of requests: - 20, 89, 130, 45 and 180. Assume that, the disk has 200

platters ranging from 0 to 199 and the current position of head is at cylinder 100.

Page 2 of 2

9

൧൧൭ +> +> ॐ ஓ ൭

نے

0