osg part3

Each of the following characteristics applies to deadlock avoidance except *

• Relying on ability to predict effect of satisfying resource allocation requests
• Inherently conservative strategy
• Widely used in modern operating systems
• None of the other choices

What's true about non-preemptable resources? *

• Can be taken away from a process with no ill effects
• None of the other choices
• Will cause the process to fail if taken away
• Can share among processes

____ allows a resource to be held by a process as long as it is needed.. *

• No preemption condition
• Circular-wait condition
• Mutual-exclusion condition
• Hold and wait condition

A system is said to be in an unsafe state if *

• The operating system cannot guarantee that all current processes can complete their work
• None of the other choices
• A process is indefinitely postponed
• The system is deadlocked

What is the correct approach with the hold and wait condition to prevent Deadlock? *

• Take resources away
• Spool everything
• Request all resources initially
• Order resources numerically

In a directed graph used to model deadlock, processes are represented using *

• Rectangle
• Circular
• Ellipse
• Square

All deadlocks involve conflicting needs for resources by *

• Three or more processes
• None of the other choices
• Two or more processes
• One or more processes

Dijkstra's Banker's Algorithm require the system to maintain the resource information for each process, including: *

• The maximum resources that can be requested by the process
• The number of resources currently acquired by the process
• A count of the system's total resources
• The maximum resources that can be requested and The number of resources currently acquired by the process

What is the weakness of the Banker's algorithm? *

• Enabling the number of resources to fluctuate
• Enabling processes to hold their resources indefinitely
• Requiring that processes state their maximum needs in advance
• Allowing the population of processes to vary over time

If a system is deadlocked, no processes can *

• release resources
• be awakened
• run
• all of the other choices