The sequence of pages which are to be referred by microprocessor is as follows:D,C,B,A,D,C,E,D,C,B,A,BThe number of page faults that will occur in the algorithm LRU with three page frames will beSelect one:a. 9b. 10c. 8d. 7
Question
The sequence of pages which are to be referred by microprocessor is as follows:D,C,B,A,D,C,E,D,C,B,A,BThe number of page faults that will occur in the algorithm LRU with three page frames will beSelect one:a. 9b. 10c. 8d. 7
Solution
To determine the number of page faults that will occur in the LRU algorithm with three page frames, we need to analyze the given sequence of pages: D, C, B, A, D, C, E, D, C, B, A, B.
Step 1: Initially, all three page frames are empty. Step 2: The first page, D, is referenced and causes a page fault. The page frame now contains D. Step 3: The second page, C, is referenced and causes a page fault. The page frame now contains D, C. Step 4: The third page, B, is referenced and causes a page fault. The page frame now contains D, C, B. Step 5: The fourth page, A, is referenced and causes a page fault. The page frame now contains C, B, A. Step 6: The fifth page, D, is referenced and causes a page fault. The page frame now contains B, A, D. Step 7: The sixth page, C, is referenced and causes a page fault. The page frame now contains A, D, C. Step 8: The seventh page, E, is referenced and causes a page fault. The page frame now contains D, C, E. Step 9: The eighth page, D, is referenced and causes a page fault. The page frame now contains C, E, D. Step 10: The ninth page, C, is referenced and causes a page fault. The page frame now contains E, D, C. Step 11: The tenth page, B, is referenced and causes a page fault. The page frame now contains D, C, B. Step 12: The eleventh page, A, is referenced and causes a page fault. The page frame now contains C, B, A. Step 13: The twelfth page, B, is referenced and causes a page fault. The page frame now contains B, A, B.
Therefore, the total number of page faults that will occur in the LRU algorithm with three page frames is 10.
Answer: b. 10
Similar Questions
For 3 page frames, the following is the reference string: 7 2 3 2 1 3 0 6 2 3 0 4 2 1 3 2 1 7 1 8 How many page faults does the LRU page replacement algorithm produceAnswer( Please choose a correct answer ) CLEAR10151216
the page faults.(c) Repeat (b) above for the LRU page replacement algorithm. (d) What would be the lowest number of page faults achievable in this example, assuming an optimal page replacement algorit
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 For FIFO page replacement algorithms with 3 frames, the number of page faults is?a.15b.14c.11d.16
[8, 6, 2, 2, 1, 3, 6, 8, 5, 3, 3, 0, 1] page sequence is executed on two processors with memory space of 3K and 4K each for processor A and processor B respectively. Page replacement policy takes recent usage while replacing pages in blocks. What seems to be true?10 faults are observed in 4K memory space12 faults are observed in 3K memory space2K page size is efficient than 4K memory space4K memory space is efficient than 3K memory space
Page sequence executed through FIFO is 8, 7, 6, 3, 7, 4, 2, 5, over a memory space. Choose the correct option:7 page faults occur if 5 blocks in memory6 page faults occur if 3 blocks in memory8 page faults occur if 3 blocks in memory9 page faults occur if 5 blocks in memory
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.