00:01
So, in this case we have two processes p1 and p2.
00:06
So, with maximum claim, edge is 60 and 50 respectively.
00:11
The current allocation edges are 30 for pi, 30 for p1 and 35 for p2.
00:22
So, to check for deadlock, we need to see there is possibility that p1 and p2 can both request additional resources.
00:29
Since the total number of unit resources are 100 and the current allocation is 30 plus 35 is equal to 65, there are still 100 minus 65 is equal to 35 units of resources.
00:49
So, both p1 and p2 have not reached their maximum reaches yet.
01:05
So, it is possible for them to request additional resources.
01:10
However, since there are still 35 units left, it is possible to request for the additional using without causing deadlock.
01:29
Therefore, the current state does not contain a deadlock.
01:33
Now coming to the b part, now let's consider the arrival of two new processes that is p3 and p4.
01:41
Now, p3, the maximum claim edge is 45 and request edge is 15.
01:49
So to determine if p3's request can be granted without incurring the possibility of deadlock, we need to check if there are enough available sources...