Computer Sciences > GATE 2015 SET-1 > Page Replacement
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?
A
Both incur the same number of page faults.
B
FIFO incurs 2 more page faults than LRU.
C
LRU incurs 2 more page faults than FIFO.
D
FIFO incurs 1 more page fault than LRU.

Correct : a

Similar Questions

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using...
#1204 NAT
A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, ..., 100 in that order,...
#1265 MCQ
A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page fr...
#1294 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......