0 votes 0 votes I think bounded waiting is satisfied ?? abhishekmehta4u asked Aug 8, 2018 abhishekmehta4u 511 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments srestha commented Aug 8, 2018 i edited by srestha Aug 8, 2018 reply Follow Share process can go CS , only when flag[j] is false where are u getting P0 ===> i=0 and j=1 is i and j really dependable?? 0 votes 0 votes Shaik Masthan commented Aug 8, 2018 reply Follow Share where are u getting in the question, at last they mention Assume that i refers current process Pi and j refers other process Pj. is i and j really dependable?? the code is copied for each process, therefore each and every process have it's own copy of code we should have to refer the variable as P0.i and P0.j P1.i and P1.j 0 votes 0 votes Shubhgupta commented Aug 8, 2018 reply Follow Share Yes in this question bounded waiting is satisfied because in one time only one process can enter in critical section and other can get chance after one can leave. Moreover there is deadlock but Deadlock means no progress and progress not related to Bounded Wait. So Deadlock not related to BW. 1 votes 1 votes Please log in or register to add a comment.
