There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order:
The final value of semaphore will be:
initial value of semaphores S=1
Initially the value of semaphore S is 1.
After (a) S=0
(c) S= -2
(d) S= -1
(e) S= 0
ans is A
The answer to the first probability question ...