sophkeis409 sophkeis409
  • 24-03-2020
  • Computers and Technology
contestada

Consider the following page reference string:
7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.
Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms?
(a) LRU replacement
(b) FIFO replacement
(c) Optimal replacement

Respuesta :

abdullahfarooqi
abdullahfarooqi abdullahfarooqi
  • 29-03-2020

Answer:

a) 18

b) 17

c) 13

Answer Link

Otras preguntas

Frank scored 75% on his spelling test with 40 questions. How many questions did he get right ?
can someone help me im tryna finish as. much as pre-algebra as i can im leaving to vacation and i need to finsish allot of math! someone help :C
Write a newspaper article explaining the events in "The Speckled Band" no less than 2 paragraphs
In what cities is the highest population of Buddhism?
A grocery store sells 5 lemons in a bag for $2.00 what is the unit cost of each lemon in the bag?
5. Matt needs to buy 9 dogs and cats. Dogs cost $50 each and cats cost $20 each. What is the price for each dog and each cat? I
What happened when red light and cyan light combine, what colour of light results?
Who is depicted in the image below?
Graph the line y= 12x–3.
How would u do this question?