If no cycle exists in the resource allocation graph____________

1. 		then the system will not be in a safe state
   		then the system will be in a safe state
   		all of the mentioned
   		none of the mentioned

1 points

QUESTION 7

1. In wait for graph contains a cycle ____________

   		then a deadlock does not exist
   		then a deadlock exists
   		then the system is in a safe state
   		either deadlock exists or system is in a safe state

1 points

QUESTION 8

1. What is the disadvantage of invoking the detection algorithm forevery request?

   		overhead of the detection algorithm due to consumption ofmemory
   		excessive time consumed in the request to be allocatedmemory
   		considerable overhead in computation time
   		all of the mentioned

1 points

QUESTION 9

1. A deadlock avoidance algorithm dynamically examines the__________ to ensure that a circular wait condition can neverexist.

   		resource allocation state
   		system storage fitness
   		operating system
   		resources

1 points

QUESTION 10

1. A system is in a safe state only if there exists a____________

   		safe request
   		safe resource
   		safe sequence
   		all of the mentioned