1.

In FIFO page replacement algorithm, when a page must be replaced ____________(a) oldest page is chosen(b) newest page is chosen(c) random page is chosen(d) none of the mentionedThe question was asked in semester exam.This is a very interesting question from Virtual Memory in portion The Linux System of Operating System

Answer»

Correct choice is (a) OLDEST page is chosen

The best I can EXPLAIN: NONE.



Discussion

No Comment Found

Related InterviewSolutions