1. (2 points) In load-time address binding: a) The logical address is the same as the physical address b) External fragmentation is eliminated c) Internal fragmentation is eliminated d) The shell will compute the physical addresses 2. (2 points) If a page replacement algorithm is subject to the Belady's anomaly: a) The same program can take more time to execute with more memory b) The number of page faults may increase with the number of frames for the same memory reference string c) The activity on the paging disk may increase if we run the same program with more memory d) All of the above 3. (2 points) The Least-Recently-Used (LRU) page replacement algorithm: a) typically provides a performance reasonably close to OPT b) can be implemented accurately and efficiently in real systems c) may suffer from Belady's anomaly d) all of the above 1. (2 points) In load-time address binding: a) The logical address is the same as the physical address b) External fragmentation is eliminated c) Internal fragmentation is eliminated d) The shell will compute the physical addresses 2. (2 points) If a page replacement algorithm is subject to the Belady's anomaly: a) The same program can take more time to execute with more memory b) The number of page faults may increase with the number of frames for the same memory reference string c) The activity on the paging disk may increase if we run the same program with more memory d) All of the above 3. (2 points) The Least-Recently-Used (LRU) page replacement algorithm: a) typically provides a performance reasonably close to OPT b) can be implemented accurately and efficiently in real systems c) may suffer from Belady's anomaly d) all of the above