A. That can be used by one process at a time and is not depleted by that use
B. That can be used by more than one process at a time
C. That can be shared between various threads
D. None of the mentioned

A. Mutual exclusion
B. A process may hold allocated resources while awaiting assignment of other resources
C. No resource can be forcibly removed from a process holding it
D. All of the mentioned

A. The system can allocate resources to each process in some order and still avoid a deadlock
B. There exist a safe sequence
C. All of the mentioned
D. None of the mentioned

A. Defining a linear ordering of resource types
B. Using thread
C. Using pipes
D. All of the mentioned

A. Banker’s algorithm
B. Round-robin algorithm
C. Elevator algorithm
D. Karn’s algorithm

A. In advance processes rarely know how much resource they will need
B. The number of processes changes as time progresses
C. Resource once available can disappear
D. All of the mentioned

A. Deadlock
B. Starvation
C. Inversion
D. Aging

A. Resource allocation graph
B. Starvation graph
C. Inversion graph
D. None of the mentioned

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