Q$4.($a$)$ Table $4\mathrm{.}1$ shows the current allocation of resources to each process and the

resources that are still needed by each process to proceed and complete their

execution.

The resources currently available are $R1=0,R2=0,R3=1$ and $R4=1.$ It is

obvious that all the processes are deadlocked. Resolve the deadlock by

successively abort deadlocked processes with the least total resources allocated.

Show the resources available after each abortion in your workings. $(9$ marks$)$

Table $4\mathrm{.}1$

$($b$)$ Given a user process of $8GB,$ page frame size is $8KB$ and each page table entry

is $2$ bytes, calculate the size of root page table in two$-$level scheme. Show all

your calculations.

$(4$ marks$)$

$($c$)$ A $16-$bit virtual address format is shown in Table $4\mathrm{.}2$ and a portion of a segment

table is shown in Table $4\mathrm{.}3.$ Translate the following virtual addresses to their

corresponding physical address. Show all the relevant values in your answer.

Table $4\mathrm{.}2$: $16-$bit virtual address format

Table $4\mathrm{.}3$: Portion of a segment table

$($i$)1001100010010111$

$(3$ marks$)$

$($ii$)1001111000001001$

$(3$ marks$)$

$($d$)$ Pre$-$paging is one of the fetch policies. Do you agree that pre$-$paging fetch

policy follows the principle of locality? Justify your answer.

$(6$ marks$)$help