Test series

Question

Consider the following Resource Allocation Graph (RAG) and set of sequences.

I) <P1,P4,P3,P5,P2>
II) <P1,P4,P3,P2,P5>
III) <P1,P4,P2,P5,P3>
IV) <P1,P4,P5,P2,P3>
Which of the above sequences can be safe?

Comments

	NEED	ALLOCATION	AVAILABLE
	R1 R2 R3	R1 R2 R3	R1 R2 R3
P1	0    0    0	0    1    0	0    2   0
P2	1    0    0	2    0    0
P3	0    0    1	1    2    0
P4	0    0    0	0    1    1
P5	0    0    1	0    0    1

Now, check all the sequences with the following conditions:

 if NEED[Pi]<=AVAILABLE

    then AVAILABLE=AVAILABLE + ALLOCATION[Pi]

 else

    break // sequence not possible

Sequence I & II are the safe sequence

---

Thanks

---

graph image in question is not loading. here it is: