Q.A process refers to 5 pages A, B, C, D, E in the order A; B; C; D; A; B; E; A; B; C; D; E If the page replacement algorithm is FIFO, the number of pages which transfer with an 'empty internal store of 3 frames' is
Correct answer: 9
Explanation
From the table below, we can see that pages have been transferred into frames 9 times. A B C D A B E A B C D E A A A D D D E E E B B B A A A C C C C C B B B D According to the FIFO algorithm, the first page to enter is the first page that should be replaced. Every time a page is required by a process, and existing page needs to be replaced from the memory with the page that is needed.
From the table below, we can see that pages have been transferred into frames 9 times. A B C D A B E A B C D E A A A D D D E E E B B B A A A C C C C C B B B D According to the FIFO algorithm, the first page to enter is the first page that should be replaced. Every time a page is required by a process, and existing page needs to be replaced from the memory with the page that is needed.