DEADLOCK

What is the graph used for deadlock identification

• resource allocation graph

• process allocation graph

• thread allocation graph

• instance allocation graph

Which of the following condition is required for deadlock to be possible?

• mutual exclusion

• a process may hold allocated resources while awaiting assignment of other resources

• no resource can be forcibly removed from a process holding it

• all of the mentioned

Which of the following is not a necessary condition for deadlock?

• Mutual Exclusion

• Reentrancy

• Hold and wait

• No pre-emption

If any of the process is waiting for a long time then it is called as

• Deadlock

• semaphore

• starvation

• None

Only one thread at a time can use a resource

• mutual exclusion

• hold and wait

• no preemption

• CIRCULAR WAIT

If there is an edge from resource to process then we called that edge as

• assignment edge

• request edge

• forward edge

• back edge

If there is an edge from process to resource then we called that edge as

• assignment edge

• request edge

• back edge

• front edge

A set of process or thread waits for a resource which is held by another waiting process is called

• Deadlock

• starvation

• synchronization

• concurrency

Resources are released only voluntarily by the thread holding the resource, after thread is finished with it

• mutual exclusion

• hold and wait

• no preemption

• circular wait

Thread holding at least one resource is waiting to acquire additional resources held by other threads are called as

• hold and wait

• no preemption

• circular wait

• mutual exclusion