File-System
April 23, 2024Question 8819 – Database-Management-System
April 23, 2024Operating-Systems
| Question 26 |
Consider the virtual page reference string
1, 2, 3, 2, 4, 1, 3, 2, 4, 1
On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then
| OPTIMAL < LRU < FIFO | |
| OPTIMAL < FIFO < LRU | |
| OPTIMAL = LRU | |
| OPTIMAL = FIFO |
Question 26 Explanation:
FIFO:
No. of page faults with FIFO = 6
No. of page faults with FIFO = 6
LRU:
No. of page faults with LRU = 9
Optimal:
No. of page faults with optimal = 5
∴ Optimal < FIFO < LRU
Correct Answer: B
Question 26 Explanation:
FIFO:
No. of page faults with FIFO = 6
No. of page faults with FIFO = 6
LRU:
No. of page faults with LRU = 9
Optimal:
No. of page faults with optimal = 5
∴ Optimal < FIFO < LRU
Subscribe
Login
0 Comments