Question: A process references five pages, A, B, C, D, and E, in the following order: A; B; C; D; A; B; E; A; B; C;
A process references five pages, A, B, C, D, and E, in the following order: A; B; C; D; A; B; E; A; B; C; D; E
Assume that the replacement algorithm is Optimum and find the number of page transfers during this sequence of references starting with an empty main memory with three page frames. Repeal for LRU
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
