Question

For 4 page frames, the following is the reference string:
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
How many page faults does the LRU page replacement algorithm produce?​

Answer 1

Step-by-step explanation:

I saw how Russell and Whitehead come to "prove" (may be not, depending on views) that 1+1 = 2. So how does modern logic/set theory prove that 1+1=2? (Is it just that we derive it from Peano axioms, and just say that it is true by axiom..?)

Share Follow

Mar it as brainlist pls

Answer 2

Answer:

2

Step-by-step explanation:

Using the formula

no of pages / occurence =2

A page replacement algorithm is required in an operating system that employs paging to manage memory in order to determine which page has to be replaced when a new page is received.

A page fault occurs when an active programme tries to access a memory page that is loaded in virtual memory but not physically in the system. Page errors occur because actual physical memory is substantially less than virtual memory. In the event of a page fault, the operating system might have to swap out one of the current pages for the one that is now required. Different page replacement algorithms offer various suggestions for selecting the appropriate replacement page. All algorithms strive to lower the number of page defects.

See more:

https://brainly.in/question/54601944

#SPJ2