1- Consider the following resource allocation graph and check whether it contains deadlock or not? Justify your answer in detail.
2- Consider the following page reference string:
4, 6, 7, 8, 6, 7, 8, 4, 6, 4, 4, 7, 5, 8
Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? illustrate your work.
FIFO replacement.
LRU replacement.
3- What is swapping? explain the terms "swap in" and "swap out" with a neat...