3 votes 3 votes Please mention the algorithm(or reference link) as well. Operating System operating-system resource-allocation + – shikharV asked Nov 27, 2015 shikharV 1.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply Avdhesh Singh Rana commented Nov 27, 2015 reply Follow Share https://en.wikipedia.org/wiki/Banker%27s_algorith It is banker's algo having complexity O(mn^2) . 1 votes 1 votes Please log in or register to add a comment.
Best answer 8 votes 8 votes Time complexity of banker's Algorithm is O(m*n2). http://cis-linux1.temple.edu/~giorgio/old/cis307f95/readings/deadlock.html Digvijay Pandey answered Nov 27, 2015 • selected Nov 27, 2015 by shikharV Digvijay Pandey comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Time complexity will be O(mn^2) Link https://en.wikipedia.org/wiki/Banker%27s_algorith Paras Nath answered Sep 24, 2016 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.
