(A) A process may hold allocated resources while awaiting assignment of other resources
(B) Mutual exclusion
(C) No resource can be forcibly removed from a process holding it
(D) All of the above
A reusable resource is?
(A) That can be used by more than one process at a time
(B) That can be shared between various threads
(C) That can be used by one process at a time and is not depleted by that use
(D) None of the above
To ensure that deadlock will never occur the system can be used?
(A) Deadlock Avoidance Scheme
(B) Deadlock Prevention Scheme
(C) Deadlock Recovery Scheme
(D) Both A & B
Deadlocks can be described more precisely in terms of a directed graph called a?
(A) System Resource Allocation Graph
(B) Bar graph
(C) Pie graph
(D) Line graph
A process must be holding at least one resource and waiting to acquire additional resources that are currently being held by other processes. This condition for deadlock is referred to as?
(A) No preemption
(B) Circular wait
(C) Mutual exclusion
(D) Hold and wait
All deadlocks involve connecting needs for?
(A) Users
(B) Computers
(C) Programs
(D) Resources
With deadlock detection requested resources are granted to?
(A) Users
(B) Processes
(C) Resources
(D) Programs
No preemption means that a resource is released as?
(A) Voluntarily
(B) Non voluntarily
(C) Terminated
(D) None of the above