Multiple Choice
Stack algorithms are a class of page replacement algorithms that
A) are implemented using stacks.
B) are guaranteed to incur the least number of page faults.
C) do not suffer from Belady's anomaly.
D) are guaranteed to incur no more page faults than FIFO page replacement algorithm.
Correct Answer:
Verified
Correct Answer:
Verified
Q2: A free-frame list<br>A) is a set of
Q3: Given the reference string of page accesses:
Q4: How is the effective access time computed
Q5: The buddy system for allocating kernel memory
Q6: Explain the distinction between a demand-paging system
Q8: What are the benefits of using slab
Q9: Suppose we have the following page accesses:
Q10: If an instruction modifies several different locations,
Q11: Suppose we have the following page accesses:
Q12: An advantage of virtual memory is that<br>A)