$4.[30$ points$]$ Memory Management

$1)(15$ points$)$ Given five memory partitions of $100$ KB$,500$ KB$,200$ KB$,300$ KB$,$ and $600$ KB $($in order$),$ how would each of the first$-$fit, best$-$fit, and worst$-$fit algorithms place processes of $212$ KB$,417$ KB$,112$ KB$,$ and $426$ KB $($in order$)?$ Which algorithm makes the most efficient use of memory?

$2)(15$ points$)$ Consider the segment table shown in Table A$.$ Translate each of the virtual addresses in Table B into physical addresses. Indicate errors if an address cannot be translated.

Table A

Segment number Starting address Segment length

$014080$

$11377150$

$22800180$

$33000157$

$4518200$

Table B

Segment number Offset

$010$

$1144$

$2122$

$3187$

$455$

$564[30$ points$]$ Memory Management

$(15$ points$)$ Given five memory partitions of $100KB,500KB,200KB,300KB,$ and

$600KB($in order$),$ how would each of the first$-$fit, best$-$fit, and worst$-$fit algorithms

place processes of $212KB,417KB,112KB,$ and $426KB($in order$)?$ Which algorithm

makes the most efficient use of memory?

$(15$ points$)$ Consider the segment table shown in Table A$.$ Translate each of the

virtual addresses in Table B into physical addresses. Indicate errors if an address

cannot be translated.

Table A

Table B