Operating System – FIFO -First In First Out Page replacement Algorithm Long Questions Answers

Here in this section of Operating System Long Questions and Answers,We have listed out some of the important Long Questions with Answers on FIFO -First In First Out Page replacement Algorithm which will help students to answer it correctly in their University Written Exam.

Lists of Long Descriptive type Questions that may be asked in Written Exams.

• (1) Explain FIFO Page replacement Algorithm
  

Question-1 Explain FIFO Page replacement Algorithm
FIFO Page replacement Algorithm

• The first in first out page replacement algorithm is the simplest page replacement algorithm.
• The operating system maintains a list of all pages currently in memory, with the most recently arrived page at the tail and least recent at the head.
• On a page fault, the page at head is removed and the new page is added to the tail.
• When a page replacement is required the oldest page in memory needs to be replaced.
• The performance of the FIFO algorithm is not always good because it may happen that the page which is the oldest is frequently referred by OS.
• Hence removing the oldest page may create page fault again.