UGC-NET | UGC NET CS 2016 Aug – III | Question 50

Consider a system which have ‘n’ number of processes and ‘m’ number of resource types. The time complexity of the safety algorithm, which checks whether a system is in safe state or not, is of the order of:
(A) O(mn)
(B) O(m²n²)
(C) O(m²n)
(D) O(mn²)

Answer: (D)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post