Question 41
Optimal Page Replacement algorithm replaces the page that -
Belady's Optimal algorithm replaces the page that will not be used for the longest duration in the future (requires future knowledge).
Optimal Page Replacement algorithm replaces the page that -
Belady's Optimal algorithm replaces the page that will not be used for the longest duration in the future (requires future knowledge).
Which page replacement algorithm is free from Belady's Anomaly?
LRU belongs to the class of stack algorithms, which are mathematically guaranteed never to exhibit Belady's Anomaly.
Overlays technique in memory management was used when -
Overlays kept only instructions and data needed at any given time in memory, enabling execution of programs larger than physical RAM.
Which disk scheduling algorithm services requests in the exact order of their arrival?
First-Come First-Served (FCFS) disk scheduling processes I/O requests sequentially as they arrive in the disk queue.
Shortest Seek Time First (SSTF) disk scheduling selects the request that -
SSTF chooses the pending disk request closest to the current read/write head position to minimize seek time.