Save
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password

Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

Question

A cycle in a resource-allocation graph is ____.
click to flip
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't know

Question

The witness software product is a ____.
Remaining cards (18)
Know
0:00
edit
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

File COP4610

QuestionAnswer
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
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards