Read carefully.

Question 7 [10 marks] (a) Given memory partitions of 400K,700K,200K,100K and 600K (in that order), show how the best-fit algorithm would place processes of 238KB,413KB,164KB and 521KB (in that order) in memory. [3 marks] (b) Assume that the total memory is 2400KB and that paging is used instead of contiguous allocation as described above. Also assume that the page size is 200 KB. (i) If the Free Frame List is as follows: 5, 7, 8, 3, 9, 6, 4, 2, 1, 0 show the page table for the first two processes in part (a) above. [3 marks] (ii) Determine the physical address of the first bytes of the 413 byte process. [2 marks] The University of the West Indies July 2023 6 (c) Give one reason why paging would be preferred for memory management over contiguous memory allocation. [2 marks]