1.

A FIFO replacement algorithm associates with each page the _______(a) time it was brought into memory(b) size of the page in memory(c) page after and before it(d) all of the mentionedThis question was addressed to me during an internship interview.The doubt is from Virtual Memory in section The Linux System of Operating System

Answer»

The correct ANSWER is (a) time it was BROUGHT into memory

The BEST explanation: NONE.



Discussion

No Comment Found

Related InterviewSolutions