1 votes 1 votes Process P0:- Process P1 while(1) while(1) { { int[0]=True; int[1]=True; while(int[1]==True); while(int[0]=True); //CS// //CS// int[0]=False; int[1]=False; } } Initially, int[0]=int[1]=false; Will this algorithm satisfy progress and why? Operating System operating-system process-synchronization + – charul asked Jan 4, 2018 charul 329 views answer comment Share Follow See 1 comment See all 1 1 comment reply sourav. commented Jan 4, 2018 reply Follow Share here this code can have deadlock hence NO progress.! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Deadlock so no progress Prateek Raghuvanshi answered Apr 3, 2018 • edited Apr 3, 2018 by Prateek Raghuvanshi Prateek Raghuvanshi comment Share Follow See 1 comment See all 1 1 comment reply diksha46 commented Apr 29, 2018 reply Follow Share @Prateek Raghuvanshi @Arjun sir Can you comment on bounded waiting for the above code? 0 votes 0 votes Please log in or register to add a comment.