Given memory partitions of $400$K$,700$K$,200$K$,100$K and $600$K $($in that order$),$

show how the best$-$fit algorithm would place processes of $238$KB$,413$ KB$,164$ KB

and $521$ KB $($in that order$)$ in memory. $[3$ marks$]$

$($b$)$ Assume that the total memory is $2400$KB 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$]$

$6$

The University of the West Indies July $2023$

$.$

$($c$)$ Give one reason why paging would be preferred for memory management over

contiguous memory allocation.