Question 11 : An edge from process Pi to Pj in a wait for graph indicates that :
1. Pi is waiting for Pj to release a resource that Pi needs
2. Pj is waiting for Pi to release a resource that Pj needs
3. Pi is waiting for Pj to leave the system
4. Pj is waiting for Pi to leave the system
View Answer   Discuss with Members

Question 12 : The wait-for graph is a deadlock detection algorithm that is applicable when :
1. all resources have a single instance
2. all resources have multiple instances
3. all resources have a single 7 multiple instance
4. all of the mentioned
View Answer   Discuss with Members

Question 13 : The content of the matrix Need is :
1. Allocation – Available
2. Max – Available
3. Max – Allocation
4. Allocation – Max
View Answer   Discuss with Members

Question 14 : The resource allocation graph is not applicable to a resource allocation system :
1. with multiple instances of each resource type
2. with a single instance of each resource type
3. single & multiple instance of each resource type
4. none of the mentioned
View Answer   Discuss with Members

Question 15 : If no cycle exists in the resource allocation graph :
1. then the system will not be in a safe state
2. then the system will be in a safe state
3. all of the mentioned
4. none of the mentioned
View Answer   Discuss with Members

Question 16 : All unsafe states are :
1. deadlocks
2. not deadlocks
3. fatal
4. none of the mentioned
View Answer   Discuss with Members

Question 17 : A system is in a safe state only if there exists a :
1. safe allocation
2. safe resource
3. safe sequence
4. all of the mentioned
View Answer   Discuss with Members

Question 18 : A state is safe, if :
1. the system does not crash due to deadlock occurrence
2. the system can allocate resources to each process in some order and still avoid a deadlock
3. the state keeps the system protected and safe
4. all of the mentioned
View Answer   Discuss with Members

Question 19 : A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
1. resource allocation state
2. system storage state
3. operating system
4. resources
View Answer   Discuss with Members

Question 20 : Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
1. minimum
2. average
3. maximum
4. approximate
View Answer   Discuss with Members