Deadlock occurs when a set of processes are blocked because each process is holding a resource and waiting for another resource held by another process in the set, creating a circular wait. Deadlock is characterized by mutual exclusion of resources, processes holding resources while waiting for additional resources, an inability to preempt resource usage, and a circular chain of processes each waiting for a resource held by the next process. Methods to handle deadlock include detection and prevention strategies.

1. DEADLOCK

2. Deadlock is a situation where a set of processes are blocked because each
process is holding a resource and waiting for another resource acquired by
some other process.

3. WHAT IS A DEADLOCK?
 Multiprogramming Environment
 Multiple Processes in waiting state for an unspecified period
 Caused by only one of the waiting processes
 Soft lock/Software
 Handling/Avoiding Deadlock

4. EXAMPLE OF DEADLOCK
Real World Example
Traffic in one direction
Bridge as a resource
Handling Deadlock

5. CHARACTERIZATION
Mutual Exclusion
Hold and Wait
No Pre-emption
Circular Wait

6. • SEQUENCE
Request
Use
Release
• DETECTION
• PREVENTION

7. ADVANTAGES &
DISADVANTAGES