Question: A process references five pages, A, B, C, D, and E, in the following order: B; C; B; A; E; A; D; E; C; B;
- A process references five pages, A, B, C, D, and E, in the following order:
B; C; B; A; E; A; D; E; C; B; D; A
Assume that the replacement algorithm is Optimal, find out the number of page faults occurring after the frame allocation is initially filled with an empty main memory with three page frames.
Optimal
| B | C | B | A | E | A | D | E | C | B | D | A |
|
| |||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
