operation system

Page loaded first 12 14 15 18 loaded page A is treated like a 8 12 14 1518 20 newhy loaded page Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs at time 20 and A has its R bit set. The numbers above the pages are their load times. 25. Consider the page sequence of Fig. 3-15(b). Suppose that the R bits for the pages B through A are 11101011, respectively. Which page will second chance remove? Why? 26. Explain why second chance page replacement is an improvement over FIFO 27. In page replacement algorithms, LRU stands for 28. In the clock page replacement algorithm, when R is set to 1, the page should be evicted. (True or False) 29. In the working set algorithm, if R -0 and age > T, then the page should be evicted. (True or False)