Back to the 2025 paper
Similar questions
OPERATING SYSTEMWhich of the following page replacement algorithms suffers from Belady's anomaly? (i) Optimal replacement (ii) LRU (iii) FIFO (iv) Both (a) and (c)20232mOPERATING 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: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1. How many page faults would occur for the FIFO, LRU and Optimal page replacement algorithms, assuming demand paging with four frames? Remember that all frames are initially empty, so first unique pages will cost one fault each.20239mOPERATING 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
PreviousInternal fragmentation occurs when (i) Processes are swapped out (ii) Pages are missing (iii) Memory is completely utilized (iv) Unused space exists within an allocated memory partitionNextWhich disk scheduling algorithm services requests in the order they arrive? (i) SCAN (ii) SSTF (iii) FCFS (iv) C-SCAN