Register

madeeasy booklet

630 views
0 0 votes
while(1)

{

flag[i]=true;

while(flag[j]);

<cs>

flag[i]=false;

}

someone please tell bounded wait is satisfying or not???

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Computer NetworkNext → · Made Easy Test
← Previous in category · Synchronization mech...Next in category → · OS Scheduling
Position:
Show:

Related questions

0 0 votes
1 1 answer
763
763 views
Markzuck asked Dec 18, 2018
763 views
MadeEasy Subject Test 2019: Databases - B Tree
By default take ROOT at level 1 or 0?and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?
0 0 votes
0 0 answers
1.5k
1.5k views
jatin khachane 1 asked Nov 25, 2018
1,509 views
MadeEasy Test Series: Databases - B Tree
The Following key values are inserted into B+ tree in which order of internal node is 4, and that of leaf node is 3, in the sequence given below.The Order of internal nod...
1 1 vote
1 1 answer
789
789 views
sardendu asked Oct 22, 2018
789 views
MadeEasy Test Series: Databases - B Tree
The following key values are inserted into B+tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of inter...
1 1 vote
1 1 answer
4.7k
4.7k views
Na462 asked Jun 14, 2018
4,690 views
MadeEasy Test Series: Databases - B Tree
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of inte...