Knowee
Questions
Features
Study Tools

A process refers to 7 pages, A, B, C, D, E,F,G in the order : A, B, C, D, A, B, E, A, B, C, D, E,A,F,G,E,F,G. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames isAnswer( Please choose a correct answer )   CLEAR81097

Question

A process refers to 7 pages, A, B, C, D, E,F,G in the order : A, B, C, D, A, B, E, A, B, C, D, E,A,F,G,E,F,G. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames isAnswer( Please choose a correct answer )   CLEAR81097

🧐 Not the exact question you are looking for?Go ask a question

Solution

The FIFO (First In, First Out) page replacement algorithm replaces the oldest page, i.e., the page that has been in the memory for the longest time.

Let's go through the page references one by one:

  1. A - Page fault (Empty frames: 2, Pages in memory: A)
  2. B - Page fault (Empty frames: 1, Pages in memory: A, B)
  3. C - Page fault (Empty frames: 0, Pages in memory: A, B, C)
  4. D - Page fault, A is replaced (Empty frames: 0, Pages in memory: D, B, C)
  5. A - Page fault, B is replaced (Empty frames: 0, Pages in memory: D, A, C)
  6. B - Page fault, C is replaced (Empty frames: 0, Pages in memory: D, A, B)
  7. E - Page fault, D is replaced (Empty frames: 0, Pages in memory: E, A, B)
  8. A - No page fault (Empty frames: 0, Pages in memory: E, A, B)
  9. B - No page fault (Empty frames: 0, Pages in memory: E, A, B)
  10. C - Page fault, E is replaced (Empty frames: 0, Pages in memory: C, A, B)
  11. D - Page fault, A is replaced (Empty frames: 0, Pages in memory: C, D, B)
  12. E - Page fault, B is replaced (Empty frames: 0, Pages in memory: C, D, E)
  13. A - Page fault, C is replaced (Empty frames: 0, Pages in memory: A, D, E)
  14. F - Page fault, D is replaced (Empty frames: 0, Pages in memory: A, F, E)
  15. G - Page fault, E is replaced (Empty frames: 0, Pages in memory: A, F, G)
  16. E - Page fault, A is replaced (Empty frames: 0, Pages in memory: E, F, G)
  17. F - No page fault (Empty frames: 0, Pages in memory: E, F, G)
  18. G - No page fault (Empty frames: 0, Pages in memory: E, F, G)

So, the total number of page faults is 11. Therefore, the correct answer is 11.

This problem has been solved

Similar Questions

The system uses 5 page frames with the page reference string as follows:0,1,2,3,0,1,4,0,1,2,3,7Find the number of page hits in FIFO Replacement Policy.

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

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

[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

1/2

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.