Solved

In FIFO Page Replacement Algorithm, When a Page Must Be

Question 13

Multiple Choice

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 mentioned

Related Questions

Q8: For every process there is a_ A)page table B)copy

Q9: When there is a large logical address

Q10: Paging increases the_ time. A)waiting B)execution C)context - switch D)all of the

Q11: _is the concept in which a process

Q12: Swap space exists in_ A)primary memory B)secondary memory C)cpu D)none of

Q14: The operating system maintains a_ table that

Q15: For larger page tables, they are kept

Q16: The_ is used as an index into the

Q17: The page table registers should be built

Q18: The size of a page is typically A)varied B)power