Vidyalelo
Data Structure · Q1003

Miscellaneous on Data Structures

Programming · Data Structure · question 1003

Q1003

In a FIFO algorithm, when a page is to be replaced, which of the following page is chosen?

A.
Oldest page
Answer
B.
Newest page
C.
Frequently occurred page in past
D.
Frequently occurred page in future

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board