Consider the P ..... 0, P ..... 1, P ..... 2, and P ..... 3 process with resources A, B, C and D with maximum instances of 10, 4, 9 and 6. The follwing scenario expains the process allocatiaon and maximum resouces (in term of A, B, C, D)P ..... 0$rightarrow$ 2, 1, 2, 0 (Allocated resources)$rightarrow$ 4, 1, 3, 2 ( Max resources )P ..... 1$rightarrow$ 1, 0, 0, 2 (Allocated resources) $rightarrow$ 4, 1, 0, 3 ( Max resources )P ..... 2$rightarrow$ 2, 0, 2, 1 (Allocated resources)$rightarrow$ 5, 4, 4, 1 ( Max resources )P ..... 3$rightarrow$ 2, 3, 4, 1 (Allocated resources)$rightarrow$ 3, 3, 6, 6 ( Max resources )What is the safe sequence

MISCELLENOUS

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

Consider the P ____ 0, P ____ 1, P ____ 2, and P ____ 3 process with resources A, B, C and D with maximum instances of 10, 4, 9 and 6. The follwing scenario expains the process allocatiaon and maximum resouces (in term of A, B, C, D)P ____ 0

A	P ____ 0, P ____ 1, P ____ 3, and P ____ 2
B	P ____ 0, P ____ 1, P ____ 2, and P ____ 3
C	P ____ 0, P ____ 1, P ____ 3, and P ____ 3
D	P ____ 0, P ____ 2, P ____ 3, and P ____ 1

Explanation:

Detailed explanation-1: -Need: It is an M x N matrix sequence representing the number of remaining resources for each process. When the Need[i] [j] = k, then process P[i] may require K more instances of resources type Rj to complete the assigned work. Nedd[i][j] = Max[i][j]-Allocation[i][j]. Finish: It is the vector of the order m.

Detailed explanation-2: -The four necessary conditions for a deadlock situation to occur are mutual exclusion, hold and wait, no preemption and circular set.

There is 1 question to complete.

COMPILER DESIGN

TOOLS AND TECHNIQUES FOR COMPILER DESIGN

MISCELLENOUS