![Business](/tpl/images/cats/ekonomika.png)
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](/tpl/images/cats/otvet.png)
Answers: 3
Similar questions
![Предмет](/tpl/images/cats/informatica.png)
Computers and Technology, 23.07.2019 04:30, sofiisabella10
Answers: 3
![Предмет](/tpl/images/cats/informatica.png)
Computers and Technology, 02.09.2019 19:10, labrandonanderson00
Answers: 2
![Предмет](/tpl/images/cats/informatica.png)
Computers and Technology, 06.09.2019 17:30, naajaae5040
Answers: 1
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](/tpl/images/cats/himiya.png)
![Konu](/tpl/images/cats/mat.png)
Mathematics, 20.02.2021 20:20
![Konu](/tpl/images/cats/en.png)
![Konu](/tpl/images/cats/mat.png)
![Konu](/tpl/images/cats/fizika.png)
![Konu](/tpl/images/cats/istoriya.png)
![Konu](/tpl/images/cats/mat.png)
![Konu](/tpl/images/cats/himiya.png)
Chemistry, 20.02.2021 20:20
![Konu](/tpl/images/cats/mat.png)
Mathematics, 20.02.2021 20:20