Questions

Consider the following example of page replacement policy. - Three pages of physical memory - Page reference string: ABCABDADBCB - In the Optimal Page-Replacement Algorithm, what would the frames in memory look like when page "D" is first referenced? - Answer: (in the format of x,y,z ) What is the total number of page faults at the end of page reference string? - Answer: - In the FIFO Page-Replacement Algorithm, what would the frames in memory look like when page "D" is first referenced? - Answer: (in the format of x,y,z ) What is the total number of page faults at the end of page reference string? - Answer: - In the LRU Page-Replacement Algorithm, - what would the frames in memory look like when page "D" is first referenced? - Answer: (in the format of x,y,z ) What is the total number of page faults at the end of page reference string