Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
File COP4610
| Question | Answer |
|---|---|
| A cycle in a resource-allocation graph is ____. | a necessary and sufficient condition for deadlock in the case that each resource has exactly one instance |
| The witness software product is a ____. | lock-order verifier that uses mutual-exclusion locks to protect critical sections |
| The witness software product is a ____. | lock-order verifier that uses mutual-exclusion locks to protect critical sections |
| In a system resource-allocation graph, ____. | a directed edge from a process to a resource is called a request edge |
| The banker's algorithm is useful in a system with multiple instances of each resource type. | true |
| Deadlock prevention and deadlock avoidance are essentially the same approaches for handling deadlock. | False |
| Protocols to prevent hold-and-wait conditions typically also prevent starvation. | False |
| The wait-for graph scheme is not applicable to a resource allocation system with multiple instances of each resource type. | True |
| One necessary condition for deadlock is ______, which states that a resource can be released only voluntarily by the process holding the resource. | |
| A deadlocked state occurs whenever ____. | every process in a set is waiting for an event that can only be caused by another process in the set |
| Which of the following data structures in the banker's algorithm is a vector of length m, where m is the number of resource types? | Available |
| To handle deadlocks, operating systems most often _____. | pretend that deadlocks never occur |
| Which of the following statements is true? | An unsafe state may lead to a deadlocked state. |
| A _____ could be preempted from a process. | CPU |
| In a system resource-allocation graph, ____. | a directed edge from a process to a resource is called a request edge |
| Ordering resources and requiring the resources to be acquired in order prevents the circular wait from occurring and therefore prevents deadlock from occurring. | False |
| If a resource-allocation graph has a cycle, the system must be in a deadlocked state. | False |
| The wait-for graph scheme is not applicable to a resource allocation system with multiple instances of each resource type. | True |
| A system in an unsafe state will ultimately deadlock. | True |
Created by:
gumaturana