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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Beginning Apache Cassandra Development
Authors: Vivek Mishra
1st Edition
1484201426, 9781484201428
