TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The time complexity of Banker algorithms isWhere “n” is number of process
|
|
O(
|
|
|
O(
|
|
|
O(
|
|
|
O(log n)
|
Explanation:
Detailed explanation-1: -By using the Banker’s algorithm, the bank ensures that when customers request money the bank never leaves a safe state. If the customer’s request does not cause the bank to leave a safe state, the cash will be allocated, otherwise the customer must wait until some other customer deposits enough.
Detailed explanation-2: -Nedd[i][j] = Max[i][j]-Allocation[i][j]. Finish: It is the vector of the order m. It includes a Boolean value (true/false) indicating whether the process has been allocated to the requested resources, and all resources have been released after finishing its task.
There is 1 question to complete.