Multiple Choice
What is the Optimal page - replacement algorithm?
A) replace the page that has not been used for a long time
B) replace the page that has been used for a long time
C) replace the page that will not be used for a long time
D) none of the mentioned
Correct Answer:
Verified
Correct Answer:
Verified
Q1: A page fault occurs when?<br>A)a page gives
Q2: When using counters to implement LRU, we
Q3: A swapper manipulates_ whereas the pager is
Q4: LRU page - replacement algorithm associates with
Q5: When a process begins execution with no
Q7: When a page fault occurs, the state
Q8: Virtual memory is normally implemented by_ <br>A)demand paging<br>B)buses<br>C)virtualization<br>D)all
Q9: If the memory access time is denoted
Q10: The ability to execute a program that
Q11: When the page fault rate is low<br>A)the