Assingment of
ASSIGNMENT UNIT 3
- Explain with all data structures, the Banker algorithm for deadlock avoidance.
- How the resource –allocation graph is used to describe deadlocks.
- Discuss the various approaches, used for deadlock recovery.
- Explain the terms "Deadlock avoidance”, ”Deadlock detection ”, "Deadlock prevention” taking suitable examples
- What is deadlock? What are necessary conditions for deadlock?
- "A safe state is not a deadlock state but deadlock state is an unsafe state”. Explain
- Consider following snap shot of a system
|
Answer following questions using Banker’s algorithm
8) What is the content of Matrix ‘Need’?
9) Is system in safe state? Find safe sequence.
10) If a request from process P1 arrives for (0, 4, 2, 0) can request be granted immediately ?
Consider following snap shot of a system
|
Answer the following questions using Banker’s Algorithm
11) What is a content of matrix need?
12) If a request from process P1 arrives for (1, 0, 2) can the request be granted immediately.