66. To avoid deadlock a. there must be a fixed number of resources to allocate b. resource allocation must be done only once c. all deadlocked processes must be aborted d. inversion technique can be used
Added by Jennifer B.
Step 1
There must be a fixed number of resources to allocate: This is true. Deadlock can be avoided if there is a fixed number of resources and the system can allocate them in a way that prevents circular waiting. b. Resource allocation must be done only once: This is Show more…
Show all steps
Your feedback will help us improve your experience
Rashmi Sinha and 91 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
12. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock. a. Mutual exclusion b. Hold and Wait c. Circular Wait d. No Preemption
Joy D.
47. Before proceeding with its execution, each process must acquire all the resources it needs is called a. hold and wait b. No pre-emption c. circular wait d. starvation
Sanchit J.
83. A state is safe, if : a. the system does not crash due to deadlock occurrence b. the system can allocate resources to each process in some order and still avoid a deadlock c. the state keeps the system protected and safe d. all of the mentioned
Chandra J.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD