What are the strategies for handling deadlocks?

Four approaches: Prevention (eliminate one of four conditions - e.g., order resources to prevent circular wait), Avoidance (dynamically check safety before allocation - Banker's algorithm), Detection and Recovery (allow deadlocks, detect via wait-for graph, recover by killing processes or preempting resources), Ignorance (Ostrich algorithm - do nothing, used in most desktop OS as deadlocks are rare). Trade-off between overhead and deadlock risk.