Scribd
Upload
6 views

Module-3 DeadLock Assignment

The document discusses deadlocks, their characteristics, and the necessary conditions for their occurrence. It explains recovery processes, Resource Allocation Graphs (RAG), and the Banker's algorithm for determining system safety. Additionally, it provides examples and questions related to system snapshots and the application of the Banker's algorithm to assess safe states and resource requests.

Uploaded by

mubassiruddin072
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Module-3 DeadLock Assignment

The document discusses deadlocks, their characteristics, and the necessary conditions for their occurrence. It explains recovery processes, Resource Allocation Graphs (RAG), and the Banker's algorithm for determining system safety. Additionally, it provides examples and questions related to system snapshots and the application of the Banker's algorithm to assess safe states and resource requests.

Uploaded by

mubassiruddin072
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DEADLOCKS

1. What are deadlocks? What are its characteristics? Explain the necessary
conditions forits occurrence.
2. Explain the process of recovery from deadlock.
3. Describe RAG:
i) With deadlock
ii) With a cycle but no deadlock
4. What is Resource Allocation Graph (RAG)? Explain how RAG is very
useful indescribing deadly embrace (dead lock ) by considering your
own example.
5. With the help of a system model, explain a deadlock and explain the
necessaryconditions that must hold simultaneously in a system for a
deadlock to occur.
6. Explain how deadlock can be prevented by considering four necessary
conditions cannothold.
7. Using Banker's algorithm determines whether the system is in a safe state.
8. How is a system recovered from deadlock? Explain the different
methods used torecover from deadlock.
9. Explain deadlock detection with algorithm and example
10. Define the terms: safe state and safe sequence. Give an algorithm to find
whether or nota system is in a safe state.
11. Consider the following snapshot of the system

Process Allocation Max. Available


A B C A B C A B C
P0 0 1 0 7 5 3 1 5 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Answer the following questions using bankers algorithm


1 What is the contents of need matrix

2 Is the system in safe state


3 If the request from the process P1 arrives for ( 1 0 2 ) can the request be granted
immediately.
12. Consider the following snapshot of the system

Process Allocation Max. Available


A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6

Answer the following questions using bankers algorithm


1 What is the contents of need matrix
2 Is the system in safe state
3 If the request from the process P1 arrives for ( 0 4 2 0 ) can the request be granted
immediately

You might also like