edited by
563 views

1 Answer

0 votes
0 votes

Bounded waiting is satisfied because they have used counting semaphores so everytime a request is made to enter into CS and if there is some other process in CS  then the process will get added into a waiting queue.

so according to bounded waiting.

There exists a bound, or limit, on the number of times other processes are allowed to enter their critical sections after a process has made request to enter its critical section and before that request is granted.

As the  processes are in a queue they will enter the CS in that order.Hence this condition will be satisfied.

Related questions

6 votes
6 votes
1 answer
1
Shamim Ahmed asked Jan 13, 2019
1,424 views
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 ?