Deadlock and Starvation

Explain briefly the essence of the term 'deadlock prevention'. $[1\mathrm{.}0$ credits$]$

Suppose three processes are running simultaneously and require the following resources:

Process P$0$ currently needs resources RI and R$2$;

Process Pl currently needs resources R$2$ and R$3$;

Process P$2$ currently needs resources $RI$ and $R3.$

a$)$ Create a resource allocation order that creates a deadlock between processes.

b$)$ Draw the resource allocation graph corresponding to case $($a$).(2\mathrm{.}0$credits$)$

Memory Management

Assume that the page table of a running process looks like the one below $($all numbers in

hexadecimal$).$ The length of the logical and physical addresses is $16$ bits, the page size is $4,096$

bytes. $[2\mathrm{.}0$ credits$]$

Example of a page table

Log. adr.: $02$ ECE; $011A1$;$04010.$