edited by
1,356 views
1 votes
1 votes

https://gateoverflow.in/109195/made-easy-mock-test

https://gateoverflow.in/108500/made-easy-test-series

https://gateoverflow.in/112717/synchronisation

https://gateoverflow.in/107206/made-easy-mock-test-1

https://gateoverflow.in/102011/made-easy

All these have same question 

In this it satisfies both mutual exclusion and progress but what about bounded waiting

I dont think it is satisfied

Please can someone answer this with explanation 

my doubt is 

if P1(waits for s2) P2(waits for s3) P3(executes CS)

then after P3 exiting CS P2 enters into CS

Now if P3 again wants to enter then P3 (acquires S2 before P1 acquires)

Then bounded wait may not satisfied 

please explain will this happen or not

edited by

1 Answer

0 votes
0 votes

plz let me know if i m wrong...

Related questions

0 votes
0 votes
2 answers
1
shivajikobardan asked Jul 22, 2023
819 views
Sorry if this is a stupid question. But it really intrigued me. Same resources at different algorithms are telling different ways to test these stuffs.Here's an algorith...
3 votes
3 votes
0 answers
3
rahul sharma 5 asked Jan 28, 2018
341 views
Can some one give example where bounded waiting satisfies but starvation freedom is not there?I have read Bounded Wait = Starvation freedom is a false implicationPlease s...
1 votes
1 votes
3 answers
4
hacker16 asked Nov 9, 2017
1,130 views
how this solution does not satisfy bounded waiting?// initially turn = 0 while (turn != 0); turn = 1 CS turn = 0