Multiple Choice
Which of the following is the first step in reducing a directed graph to eliminate deadlock?
A) Remove the process that is holding on to the most resources.
B) Find a process that's waiting only for resource classes that aren't fully allocated
C) Find a process that is currently using a resource and not waiting for one.
D) Find the oldest process and remove it from the graph.
Correct Answer:
Verified
Correct Answer:
Verified
Q2: In the "dining philosophers" problem,a philosopher can
Q3: Although the Banker's Algorithm has been used
Q4: Resource holding,where a job holds on to
Q5: The Banker's Algorithm is an example of
Q6: Database locking should be done only at
Q8: Fixing a deadlock situation requires outside intervention.
Q9: In printing systems using _,a disk accepts
Q10: In general,operating systems must either choose avoidance
Q11: An algorithm designed to detect starvation by
Q12: A livelock can be caused by two