Preparing for the final, if you could explain briefly why your choice should be correct, that would be helpful.

11. [3 points] When a page fault occurs and the page replacement algorithm selects a modified page as the victim, how many total number of I/O operations required b. 1 d. 4 12. [3 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 activity on the paging disk may increase if we run the same program with more memory c. The number of page faults may increase with the number of frames for the same memory reference string d. All of the above 13. 3 points] Which of the following is not true for segmentation? a. It eliminates external fragmentation b. t allows re-compiling of individual functions after modification t allows assigning different protection rules for different parts of address space d. t allows finer-granularity memory sharing among processes 14. [3 points] Consider an instruction within a certain instruction-set architecture (ISA) SUB R1, M2, R3. This instruction subtracts the contents ofthe memory location M2 (direct addressing) from the value in Register R1, and stores the result in Register R3. What is the maximum number of page faults that may be caused by this single instruction? b. 2 d. 4