CameraIcon

SearchIcon

MyQuestionIcon

1

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

Banker's Algorithm

Consider foll...

Question

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}$

Open in App

Solution

Available : 15 -12 = 3

Suggest Corrections

thumbs-up

0

Similar questions

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. Consider a system with 29 resources. There are n processes whose demand for resources increases by 1 after every 5 seconds. All processes arrive at same time & starts with demand as 1, 2, 3 etc. For example,

P_{1}

puts demand as 1,

P_{2}

puts as 2, & so on. Processes releases the resources only at termination. How many maximum number of processes we can have to ensure no deadlock, if every process requires 2 2 seconds for execution is ____

Q. A single processor system has three resource types X, Y and Z, which are shared by three processes. There are 5 units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each process, and the column request denotes the number of units of each resource type requested by a process in order to complete execution. Which of these processes will finish LAST?

alloc request
P0 121 103
P1 201 012
P2 221 120

Q. Consider 3 concurrent processes X, Y & Z which request resources in the order given in options. There are total 5 resources

R_{1}

R_{5}

. If process do not get resource, it waits till it becomes available. Once process completes, it release all resources it has. Which of the following guarantees deadlock free operation?

Q. Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6 respectively. For what value of m deaklock with not occur?

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