## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## First-in, First-out Algorithm (FIFO) Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

Question 1 |

..... is a typical online problem from the competitive analysis to determine the optimal solution.

Page replacement algorithm | |

Segmentation | |

Paging | |

Segmentation with paging |

**Puzzles Questions answers**

Question 1 Explanation:

Page replacement is a typical online problem from the competitive analysis. They determine which pages to page out or write to disk.

Question 2 |

Which of the following is the simplest page replacement algorithm?

FIFO | |

Optimal page replacement | |

LRU replacement | |

Counting based replacement |

**ICT Questions answers**

Question 2 Explanation:

FIFO is the simplest page replacement algorithm since LRU and optimal replacement algorithms require past and future data patterns respectively.

Question 3 |

..... algorithm associates with each page the time when the page was brought into memory.

Optimal page replacement | |

FIFO | |

LRU replacement algorithm | |

Counting based replacement |

**Library science Questions answers**

Question 3 Explanation:

FIFO algorithm associates with each page the time when the page was brought into memory. The new page is inserted at the tail of the queue.

Question 4 |

As the number of frames available increases, the number of page faults decreases.

True | |

False |

**ICT Questions answers**

Question 4 Explanation:

One of the rules of the page replacement algorithm is that, as the number of frames available increases, the number of page faults decreases.

Question 5 |

Which of the following page replacement algorithms return the minimum number of page faults?

LRU replacement algorithm | |

Optimal page replacement algorithm | |

FIFO | |

Counting based replacement |

**Puzzles Questions answers**

Question 5 Explanation:

Though FIFO is the simplest of all algorithms, optimal page replacement algorithm returns the minimum number of page faults.

There are 5 questions to complete.