Question 13057 – Operating-Systems
March 25, 2024Question 4384 – Environment
March 25, 2024Question 13046 – Operating-Systems
If p is the number of active processes, and r is the number of resource types; the time complexity of the Banker’s algorithm used for deadlock avoidance is denoted as
Correct Answer: C
Question 929 Explanation:
The time complexity of banker’s algorithm is r* (p*p) where p is the number of active processes and r is the number of resources. … Banker’s algorithm is a resource allocation and deadlock avoidance algorithm. Banker’s algorithm is generally used to find if a safe sequence exist or not.
O(p2)
O(r2)
O(p2r)
O(pr2)