edited by
4,645 views
1 votes
1 votes

The page replacement algorithm which gives the lowest page fault rate is

  1. LRU
  2. FIFO
  3. Optimal page replacement
  4. Second chance algorithm
edited by

1 Answer

Answer:

Related questions

9 votes
9 votes
2 answers
1
go_editor asked Jun 13, 2016
5,847 views
The performance of Round Robin algorithm depends heavily onsize of the processthe I/O bursts of the processthe CPU bursts of the processthe size of the time quantum
4 votes
4 votes
1 answer
2
go_editor asked Jun 12, 2016
2,498 views
Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. How many bits are there in the logical address?13 bits15 bits14 bits12 bits
8 votes
8 votes
2 answers
3
go_editor asked Jun 12, 2016
4,045 views
Which of the following need not necessarily be saved on a Context Switch between processes?General purpose registersTranslation look-aside bufferProgram counterStack poin...
3 votes
3 votes
3 answers
4
go_editor asked Jun 12, 2016
2,144 views
Fork isthe creation of a new jobthe dispatching of a taskincreasing the priority of a taskthe creation of a new process