Question 1
Question 2
repeat P(mutex) {Critical section} V(mutex) foreverThe code for P10 is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment?
Question 4
A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the table below, where P0, P1, P2 are processes, and R0, R1, R2 are resources types.
[caption width="800"] [/caption]a) Show that the system can be in this state. b) What will the system do on a request by process P0 for one unit of resource type R1?
Question 5
Question 6
Question 7
There are 42 questions to complete.