Question
a.
first in first out algorithm
b.
additional reference bit algorithm
c.
least recently used algorithm
d.
counting based page replacement algorithm
Posted under Linux System Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?
Similar Questions
Discover Related MCQs
Q. A process is thrashing if
View solution
Q. Working set model for page replacement is based on the assumption of
View solution
Q. Virtual memory allows :
View solution
Q. The instruction being executed, must be in :
View solution
Q. Error handler codes, to handle unusual errors are :
View solution
Q. The ability to execute a program that is only partially in memory has benefits like :
View solution
Q. In virtual memory. the programmer __________ of overlays.
View solution
Q. Virtual memory is normally implemented by ________
View solution
Q. Segment replacement algorithms are more complex than page replacement algorithms because :
View solution
Q. A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process.
View solution
Q. Using a pager :
View solution
Q. The valid – invalid bit, in this case, when valid indicates :
View solution
Q. A page fault occurs when :
View solution
Q. When a page fault occurs, the state of the interrupted process is :
View solution
Q. When a process begins execution with no pages in memory :
View solution
Q. If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is :
View solution
Q. When the page fault rate is low :
View solution
Q. Locality of reference implies that the page reference being made by a process :
View solution
Q. Which of the following page replacement algorithms suffers from Belady’s Anomaly ?
View solution
Q. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is :
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
