The Dining Philosopher’s Problem: The dinning philosopher problem describe the group of philosopher sitting on a round table doing one of two thing either eating or thinking we assume that there is five philosopher as an example. So there are five philosophers and they have five food plates. There are 5 philosophers are present in that room and they think more and more even when they feel hungry then they think much more. And each have the fork on both side of the plates and when a philosopher pick a fork from both side then the other philosopher is waiting condition when that philosopher is free and its turn come. From above example if philosophers took up their forks on the right side of him and wait for the left one it ma y cause deadlock. The lake of solution must be gave the idea that any …show more content…
The buffer is empty producer not push data and consumer have no data to delete from the buffer. The Sleeping Barber’s Problem: Another problem in IPC is sleeping barber problem. The barber shop has one barber and n number of waiting customer’s chairs. If there is no customer present in shop the barber fall asleep. When customer arrive he has to work up the sleeping barber. If additional customer arrive and barber is busy in cutting hairs he has to wait for the barber on sitting chair or he have to leave the shop if all the chairs present in the shop are full. The problem is to deal the customers without any race condition. We can solve this problem by three ways if the barber gave the priority to the customers and gave equal time to the customers. Secondly customers should wait for his turn until its turn is arrived and, thirdly waiting all customers should be in wait condition. We use the algorithm first in first out algorithm in this