11.

12.

13.

14.

CC201 Pages: 2

OR
b) Differentiate between short term, medium term and long term schedulers.
೩) What is critical section problem? How is it solved by Peterson’s solution?
OR
b) Explain inter process communication.
a) Explain how Banker’s algorithm can be used to avoid deadlock.
OR
b) Describe paging.
a) Explain FIFO, LRU and Optimal page replacement algorithms with the following reference
string using 4 frames.
0, 2, 1, 6, 4, 0, 1, 0, 3, 1, 2, 1
OR
b) Suppose a disk has 200 cylinders numbered from 0 to 199. The disk arm is currently at
cylinder 63. There is a queue of disk access request for cylinders 100, 175, 51, 133, 8, 140,
73, 77. Assume seek rate of 5ms and compute total seek time for FCFS and SCAN disk
scheduling algorithms.
a) Explain the different file access methods.
OR

b) Describe any 2 file allocation methods.

Page 2 of 2