Deadlock Quiz

What is a deadlock in concurrent computing?

• A situation where processes compete for resources

• A situation where no member of a group of entities can proceed

• A situation where processes are terminated

• A situation where processes are preempted

Which of the following is not a condition for deadlock according to the Coffman conditions?

• Resource preemption

• Hold and wait

• Mutual exclusion

• Circular wait

What is the approach where it is assumed that a deadlock will never occur?

• Deadlock avoidance

• Ignoring deadlock

• Deadlock prevention

• Deadlock detection

Which condition is removed in deadlock prevention by requiring processes to request all the resources they will need before starting up?

• Mutual exclusion

• Hold and wait

• Circular wait

• No preemption

What is the term for a situation where the states of the processes involved constantly change with regard to one another, none progressing?

• Livelock

• Distributed deadlock

• Resource starvation

• Deadlock

What is the term for deadlocks that are falsely detected in a distributed system due to system internal delays but do not actually exist?

• Circular reference

• Impasse

• Distributed deadlocks

• Phantom deadlocks

Which algorithm is used for deadlock avoidance?

• Race condition algorithm

• Ostrich algorithm

• Catch-22 algorithm

• Banker's algorithm

What is the main goal of deadlock avoidance approach?

• To detect and correct deadlocks

• To analyze each resource request to avoid deadlock

• To impose conditions to prevent deadlock

• To ensure that deadlocks will occur in the system

What is the condition that may be removed in deadlock avoidance by using a hierarchy to determine a partial ordering of resources?

• Hold and wait

• No preemption

• Mutual exclusion

• Circular wait

What is the term for deadlocks that can occur in distributed systems when distributed transactions or concurrency control is being used?

• Livelock

• Phantom deadlocks

• Impasse

• Distributed deadlocks