Consider the following page address stream formed by executing a program: 2, 1, 5, 1, 2,...

 

Transcribed Image Text:

Consider the following page address stream formed by executing a program: 2, 1, 5, 1, 2, 3, 6, 1, 2, 3, 2, 3, 5, 6, 3, 2, 4, 6, 2, 1 Produce calculations to show the number of page faults that would occur if Least Recently Used (LRU) and FIFO policies are used as the replacement algorithms with four frame allocation. Consider the following page address stream formed by executing a program: 2, 1, 5, 1, 2, 3, 6, 1, 2, 3, 2, 3, 5, 6, 3, 2, 4, 6, 2, 1 Produce calculations to show the number of page faults that would occur if Least Recently Used (LRU) and FIFO policies are used as the replacement algorithms with four frame allocation.