Back to the 2016 paper
Similar questions
Operating SystemConsider the virtual page reference string 0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92 on a demand paged virtual memory system running on computer system that has main memory of size 4 page frames which one initially empty. The CPU uses LRU page replacement policy. (i) How many page faults does this sequence cause? (ii) What are the page numbers of the pages present in the main memory at the end of the sequence?20227mOperating SystemConsider the main memory with the capacity of 4 page frames. Assume that the pages of a process are referenced in the order as given below: 1, 3, 4, 4, 3, 2, 1, 7, 5, 6, 4, 2, 1, 2 Which of FIFO or LRU would be better in this case as a page replacement policy? Why?20257mOPERATING SYSTEMConsider the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults would occur for the following replacement algorithms? Assuming 3 frames are available. Also assume that initially none of pages in main memory. (i) Optimal replacement (ii) FIFO replacement20237mOPERATING SYSTEMConsider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Compare the page faults occur for the following replacement algorithms using 3 frames? Assume, initially all the frames are empty. (i) LRU replacement (ii) FIFO Replacement202414m