Operating Systems - May 18
Information Technology (Semester 4)
Total marks: 80
Total time: 3 Hours INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.
a. First-come, first-served
b. Shortest job first
c. Round robin
Answer the following questions using the banker's algorithm:
a. What is the content of the matrix Need?
b. Is the system in a safe state?
c. If a request from process Pl arrives for $(0,4,2,0),$ can the request be granted immediately?
$1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6$ . How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, and seven frames?
Remember that all frames are initially empty, so your first unique pages will cost one fault each.
$\bullet$ FIFO replacement
$\bullet$ Optimal replacement
Write a short notes on: (Any Four)