Business
Business, 26.09.2019 18:30, minecrafter3882

Consider the following page reference string for a 20-page executable. 0,1,3,5,1,3,7,9,1,10,9,11,7,6,9,1,1 2,15,11,19 how many page faults would occur for the following replacement algorithms, assuming two and five frames? remember that all frames are initially empty, so your first unique pages will cost one fault each. a. lru replacement b. fifo replacement c. optimal replacement

answer
Answers: 3

Similar questions

Do you know the correct answer?
Consider the following page reference string for a 20-page executable. 0,1,3,5,1,3,7,9,1,10,9,11,7,6...

Questions in other subjects:

Konu
Mathematics, 20.02.2021 20:20
Konu
Chemistry, 20.02.2021 20:20
Konu
Mathematics, 20.02.2021 20:20