9.3 (3 points for correct answer, 7 points for steps) Consider the following page reference string:...

Question

Question

9.3 (3 points for correct answer, 7 points for steps) Consider the following page reference string:

6, 1, 5, 5, 4, 6, 2, 6, 0 , 1, 7, 2, 3, 1, 4, 6, 7, 2, 5, 2,.

Assuming demand paging with three frames, how many page faults would occur for the following

replacement algorithms?

• LRU replacement

• FIFO replacement

• Optimal replacement

engineering Computer-Science

Answer 1

Answer #1

LRO 6ISS462G 7 2 3 672S2 2 4 64 2 2 44 6 6 Ss2 4 22 4412 1 6 6 7777 36 33 SS V No of Page Pruls FIFO Y6 S2 4422 2 23 2 2 24 3

Answer 2

Similar Homework Help Questions

Consider the following page reference string: 1, 0, 3, 2, 6, 4, 5, 0, 1, 7,...

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

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

Consider the following page reference string for a specific process: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1 Assuming demand paging with 3 frames, determine the page fault rate for each of the following page replacement algorithms: a. LRU replacement b. FIFO replacement c. Optimal replacement

Consider the following page reference string:

4, 6, 7, 8, 6, 7, 8, 4, 6, 4, 4, 7, 5, 8Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? illustrate your work. i. FIFO replacement. ii. LRU replacement.
Consider the following page reference string: A C B D B A E F B F...

Consider the following page reference string: A C B D B A E F B F A G E F A Assuming demand paging with four frames, how many page faults would occur for the following replacement algorithms? Remember that all frames are initially empty, so your first unique pages will cost one fault each. Show all of your works. LRU replacement FIFO replacement Optimal (MIN) replacement
Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has...

Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has 4 page frames allocated to these 7 pages. Follow the page placement and replacement using the following three replacement algorithms: • LRU replacement • FIFO replacement • Optimal replacement How many page faults will occur for these three algorithms? Assume that all frames are initially empty, so your first unique pages will all cost one fault each USE ENCLOSED TABLES! Show all calculations in...

Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1,...

Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each. • LRU replacement • FIFO replacement • Optimal replacement
Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1,...

Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1 If OPT replacement is used, the number of page faults will be a. 8 b. 9 c. 10 d. 7 e.None of the above If LRU replacement is used, the number of page fault will be a. 8 b. 9 c. 10 d. 11 e. None of the above
Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4...

Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4 3 2 5 4 3 4 5 1 5 3 1 6 3 1 Apply LRU, Clock and FIFO algorithms What will be the number of page faults for each replacement algorithm note that page faults at the beginning are counted?

Consider the following page reference string 43.2,145,5,4,3,2.1,5. How many page faults would occur for the following...

Consider the following page reference string 43.2,145,5,4,3,2.1,5. How many page faults would occur for the following page replacement algorithms assuming three frames? Initially, all frames are empty. a.FIFO b.LRU C-Optimal