Back to the 2024 paper
Similar questions
OPERATING 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 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 SystemConsider the main memory with the capacity of 4 page frames. Assume that the page of 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?20247m
PreviousCompare and contrast Deadlock Prevention and Deadlock Avoidance. Can a system be in a state that is neither deadlock nor safe? If so, give an example. If not, prove that all states are either deadlock or safe.NextWrite short notes on any two of the following:- (a) Dispatcher and Scheduler (b) Starvation and Aging (c) Paging and Segmentation (d) Semaphore and Mutex
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.