Consider the following reference strings with three frames: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Find out the total number of page fault, if LRU (Least Recently Used) page replacement algorithm is implemented.

Keep practicing — related questions

• A process has been allocated 3 page frames. Assume that none of the pages of the process are available in t...
• A process has been allocated 3 page frames. Assume that none of the pages of the process are available in t...
• Consider a FIFO page replacement algorithm containing three frames. Initially, there is no page loaded in a...
• Consider the virtual page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory s...
• Which of the following options gives the correct combinations of the following statements about LRU (Least ...
• A job has 3 pages A, B, C and the main memory has 2 page frames only. The job needs to process its pages in...
• A job has 3 pages A, B, C and the main memory has two page frames only. The job needs to process its pages ...
• A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. Th...