If no cycle exists in the resource allocation graph____________ then the system will not be in a
Question:
If no cycle exists in the resource allocation graph____________
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
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
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
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
A system is in a safe state only if there exists a____________
safe request
safe resource
safe sequence
all of the mentioned
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill