1What does a system consist of in deadlock context?
Finite resources distributed among competing threads
2What is the sequence of resource usage?
Request → Use → Release
3When does deadlock occur?
When threads wait for resources held by each other
4What is an example of a deadlock situation?
Dining philosophers problem
5What tools are common sources of deadlock?
Mutex locks and semaphores
6How many conditions must hold simultaneously for deadlock?
Four
7What is mutual exclusion in deadlock?
At least one resource must be non-sharable
8What is hold and wait?
A thread holding resources waits for additional resources
9What is no preemption?
Resources cannot be forcibly taken; must be released voluntarily
10What is circular wait?
Threads wait in a cycle where each holds a resource needed by the next
11What is the most common OS strategy for deadlocks?
Ignore the problem
12What is a drawback of ignoring deadlocks?
Performance deteriorates; system may stop and need restart
13What is deadlock prevention?
Ensuring at least one of the four conditions does not hold
14How can hold and wait be prevented?
Request all resources before execution or only when none are held
15What is a disadvantage of hold and wait prevention?
Low resource utilization and possible starvation
16What is deadlock avoidance?
Techniques to ensure the system never enters a deadlocked state
17How does prevention differ from avoidance?
Prevention limits requests, avoidance uses information to decide dynamically