(b) If the process is allocated 5 frames, the -chance algorithm incurs 14 page faults.  Assume that we start searching from the frame next to the fame with the last brought in page.    If the page last brought in is in the last frame, then we start searching from the first frame.

相關申論題

相關試卷