MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Banker's Algorithm

A system shar...

Question

A system share 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:

Process Current Allocation Maximum Requirement

P1
P2
P3 3
1
3 7
6
5

Which of the following best describes current state of the system?

Open in App

Solution

P.id Current
Allocation Maximum
Requirement Remaining
need Current
available

P1
P2
P3 3
1
3 7
6
5 4
5
2 9 - 7 = 2
5
8
9

Safe sequence $\Rightarrow P 3 \to P 1 \to P 2$
Safe and Not deadlocked

Suggest Corrections

thumbs-up

1

Similar questions

Q. A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is

Q. An operating system uses the Banker's alogrithm, for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.

	Allocation	Max
	X Y Z	X Y Z
P0 P1 P2	0 0 1 3 2 0 2 1 1	8 4 3 6 2 0 3 3 3

There are 3 units of type X, 2 units of type Y and 2 uits of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state :
REQ 1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ 2: P1 requests 2 units of X, 0 units of Y and 0 units of Z

Which one of the following is TRUE?

Q. In a system, there are three types of resources: E, F and G. Four processes

P_{0}, P_{1}, P_{2} a n d P_{3}

execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example Max

[P_{2} . F]

is the maximum number of instances of F that

P_{2}

would require. The number of instances of the resources allocated to the various processes at any given state is given by a matri named Allocation.
Consider a state of the system with the Allocation matrix as shown below and in which 3 instances of E and 3 of F are the only resources available.

Allocation
	E	F	G
$P_{0}$	1	0	1
$P_{1}$	1	1	2
$P_{2}$	1	0	3
$P_{3}$	2	0	0

Max
	E	F	G
$P_{0}$	4	3	1
$P_{1}$	2	1	4
$P_{2}$	1	3	3
$P_{3}$	5	4	1

From the perspecitve of deadlock avoidance, which one of the following is true?

Q. A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

Q. Consider following table showing the max demand of each process & currently allocated resources to the process. There are total 15 resources. Which of the following is not safe sequence?

\begin{matrix} Process & Maximum Demand & Current Allocation P_{1} & 5 & 2 P_{2} & 2 & 1 P_{3} & 7 & 1 P_{4} & 10 & 5 P_{5} & 12 & 3 \end{matrix}

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Banker's Algorithm

OTHER

Watch in App

explore_more_icon

Explore more

Banker's Algorithm

Join BYJU'S Learning Program

CrossIcon