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(m2n2)
(C) O(m2n)
(D) O(mn2)
Answer: (D)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
Last Updated :
12 Apr, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...