Back to the 2023 paper
Similar questions
Operating 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 Replacement202414mOPERATING SYSTEMHow many page faults would occur for the following reference string for four page frames and three page frames using LRU and FIFO algorithms: 1, 2, 3, 4, 5, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.201914mOperating SystemHow many page faults would occur for the following reference string for four page frames and three page frames using LRU and FIFO algorithms: 1, 2, 3, 4, 5, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.201914m
PreviousWhat do you mean by critical section problem. Discuss a solution for critical section problem.NextSuppose a disk drive has cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.