Question: Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical

Consider the following page reference string:

A, C, D, B, A, C, E, A, C, D, B, E

Suppose there are 3 frames in physical memory, how many page faults will occur for the following replacement algorithms:

a. FIFO Replacement algorithm: (2 marks)

b. Optimal Replacement algorithm: (2 marks)

c. LRU replacement algorithm: (2 marks)

Write your detailed answer as the following for each algorithm:

Read A: Frame1, Frame2, Frame3

Read C: Frame1, Frame2, Frame3

Read D: Frame1, Frame2, Frame3

Read B: Frame1, Frame2, Frame3

Read A: Frame1, Frame2, Frame3

Read C: Frame1, Frame2, Frame3

Read E: Frame1, Frame2, Frame3

Read A: Frame1, Frame2, Frame3

Read C: Frame1, Frame2, Frame3

Read D: Frame1, Frame2, Frame3

Read B: Frame1, Frame2, Frame3

Read E: Frame1, Frame2, Frame3

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

Question 20 6 Points Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical memory, how many page faults will occur for the following...

Q:

Question 20 6 Points Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical memory, how many page faults will occur for the following...

Q:

Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical memory, how many page faults will occur for the following replacement...

Q:

Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical memory, how many page faults will occur for the following replacement...

Q:

Question 21 6 Points Consider the following page reference string: 1,4,3,2,1,4,5, 1, 4, 3, 2,5 In addition, there are 3 frames want to use in the physical memory. how many page faults will occur for...

Q:

i need entire solution thx 9. Suppose you have 16M bytes of main memory. Using the list method. You have an overhead of eight bytes per memory block. Using the bitmap method, you use an allocation...

Q:

1) Consider a paging system with the page table stored in memory. a. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? b. Add TLBs, and assume 75 percent of...

Q:

Question 20 6 Points Consider the following page reference string: C, A, B, E, C, A, D, C, A, B, E, D Suppose there are 3 frames in physical memory, how many page faults will occur for the following...

Q:

Question 20 6 Points Consider the following page reference string: C, A, B, E, C, A, D, C, A, B, E, D Suppose there are 3 frames in physical memory, how many page faults will occur for the following...

Q:

[ 2 4 points ] Problem 3 Page Replacement Algorithms Consider the following page reference string: 1 , 2 , 5 , 3 , 1 , 5 , 4 , 2 , 5 , 3 , 4 , 2 , 3 , 1 , 3 , 2 Assuming demand paging with 3 frames....

Q:

The author surveyed Facebook users in one of his statistics classes about the number of friends they have on Facebook. Here are their responses: For parts (b) and (c), begin with lower class limit 0...

Q:

Into the same funnel is poured carefully 50 mL of hexane (density = 0.660 g/ml) so that the other two layers are not disturbed. The hexane forms a third layer. The funnel is stoppered and the mixture...

Q:

When completing stock transactions, payment for stocks is generally required within _ _ _ _ _ _ _ _ _ _ blank business days after the transaction. Multiple Choice 3 1 2 4 5

Q:

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

Q:

How do modern Dashboards differ from earlier implementations?

Q:

Provide an example of a descending Hierarchy of Data Validation/Lookup Tables.

Q:

In a HCM Database, how does applying Relational Design and Third Normal Form rules avoid duplication of Job Title storage in each employee base record?