Register

Semaphore
closed

• closed by
1,773 views
0 votes
0 votes
closed with the note: duplicate
Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. The number of blocked processes at the end are _________.

                                                            4 P, 6 V, 9 P, 13 V, 14 P
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.5k
views
1 answers
0 votes
roopkathaaa asked Aug 25, 2023
1,525 views
NPTEL : Synchronisation (semaphore)
In a certain application, the initial value of a counting semaphore s is 10. The following operations were completed on the semaphore in the given order 5P, 20P, 2V, 18P, 5V, 10P, 1V. The new value of counting semaphore is _____________ ?
User Avatar
696
views
0 answers
0 votes
Arbaz__Malik asked Dec 25, 2021
696 views
self-doubt operating-system semaphore
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectivelyI know this implementation is deadlock free just want to ask if it will follow bounded waiting and progress and how both of them are different?
User Avatar
1.5k
views
1 answers
6 votes
Shamim Ahmed asked Jan 13, 2019
1,543 views
MadeEasy Full Length Test 2019: Operating System - Semaphore
Let S be a binary semaphore variable, S=0What will be the value of S when following operations are performed:-2P, 4V, 5P, 2P, 8V, 3P, 2V ?
User Avatar
5.1k
views
2 answers
0 votes
syncronizing asked Jan 6, 2019
5,072 views
the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 ... S3);V(S2);V(S1);Does it satisfy mutual exclusion, progress and bounded waiting?
User Avatar
Link Copied!