edited by
2,225 views
1 votes
1 votes
Identify the incorrect statement :

1. If there are no cycles in resource allocation graph then there is no deadlock.

2. If there is only one instance per resource type and resource allocation graph has a cycle then there is a deadlock.

3. If there is more than one instance for some resource type and resource allocation graph has a cycle , there may or may not be a deadlock.

4. All of these
edited by

2 Answers

0 votes
0 votes
statement 1 i=if there is no cycle in resource allocation graph then it means that there is no circular wait so one of the necessary condition for deadlock is not satisfy that's why there will be no deadlock.

statement 2=if there is cycle in resource allocation graph if it is of single instance type then it satisfy all the condition for deadlock i.e

mutual exclusion,circular wait,hold and wait,no preemption so deadlock will occur.

statement 3=if there is cycle in multi instance resource type then it is not necessary that deadlock will occur because sometimes it may happen that one of the resource will be available for the other process.

so all the statement is correct.

Related questions

2 votes
2 votes
2 answers
1
Sunnidhya Roy asked Dec 30, 2022
647 views
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??
0 votes
0 votes
1 answer
2
0 votes
0 votes
3 answers
4
Vegeta asked Oct 22, 2018
867 views
All safe states are deadlock free. But we can go to deadlock with some combination of sequence? So if the question is, from the safe state can we enter deadlock? Ans shou...