Deadlock in Concurrency | Dataford Interview Questions

What is deadlock, and how does it occur?

Implement detect_deadlock(wait_for) to determine whether processes represented by a directed wait-for graph are deadlocked. A directed edge from process A to process B means A is waiting for B to release a resource. Return True if the graph contains a cycle, otherwise return False.

Input is a dictionary mapping process identifiers to lists of processes they currently await. Processes appearing only as destinations may be absent as keys.

Constraints

1 <= number of distinct processes <= 10^4
0 <= number of wait-for edges <= 5 * 10^4
Process identifiers are hashable values
The input represents a directed graph

Function Signature

def detect_deadlock(wait_for):

Your question is Deadlock in Concurrency. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

What is deadlock, and how does it occur?

Input is a dictionary mapping process identifiers to lists of processes they currently await. Processes appearing only as destinations may be absent as keys.

Constraints

1 <= number of distinct processes <= 10^4
0 <= number of wait-for edges <= 5 * 10^4
Process identifiers are hashable values
The input represents a directed graph

Function Signature

def detect_deadlock(wait_for):

Your question is Deadlock in Concurrency. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.