The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
121 views
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 :

(1) O(mn)

(2) O(m2 n 2 )

(3) O(m2 n)

(4) O(mn2 )
asked in Others by (459 points) | 121 views

2 Answers

0 votes
For n processes and m resources, time complexity of Banker's Algorithm is O(n*n*m).

D is correct.
answered by Boss (11.9k points)
0 votes

it is question of  bankers algorithm .

its complexity is O(n2m)

u can c calculation here:

https://stackoverflow.com/questions/1298308/bankers-algorithm-calculated-time-complexity

 

answered by Active (3.1k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

35,458 questions
42,705 answers
121,331 comments
42,105 users