A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, – McqOptions

MCQOPTIONS

1.	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 page frames is increased to 4, then the number of page transfers ____________
A.	decreases
B.	increases
C.	remains the same
D.	none of the mentioned
Answer» C. remains the same

Discussion

No Comment Found

Related MCQs

For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
LRU page replacement algorithm associates with each page the ______
Optimal page replacement algorithm is difficult to implement, because ____________
What is the Optimal page replacement algorithm?
The aim of creating page replacement algorithms is to ____________
When a page is selected for replacement, and its modify bit is set ____________
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________
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 page frames is increased to 4, then the number of page transfers ____________
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 page transfers with an empty internal store of 3 frames is?
Which of the following page replacement algorithms suffers from Belady s Anomaly?