test series

Question

A:                                                                 B:

while true do                                                  while true do

{                                                                       {  

wait(p);                                                               wait(p);

wait(q);                                                               wait(q);

x=x+1;                                                                y=y+1;

y=y-1;                                                                 x=x-1;

signal(p);                                                            signal (q);

signal(q);                                                            signal(p);

}                                                                          }

Two processes A and B, Is bounded guaranteed , if yes then how ?

Comments

Is it necessary that after A will hit signal(p) and B wakes up, he will execute wait(p) and will make p=1 so that A again cant enter?

---

Is it necessary that after A will hit signal(p) and B wakes up

yes.

 

when A hit signal(p), it means if any blocked process in the queue of semaphore p , then should be take one of them in FIFO(by default) order.

---

Got your point shaik masthan thankyou