Sleeping Barber Problem

Sleeping Barber Problem The sleeping barber problem is a classic concurrency problem introduced by Edsger Dijkstra in 1965. It illustrates the challenges of coordinating multiple processes sharing limited resources. The Scenario A barbershop has: 1 barber with 1 barber chair A waiting room with N chairs Customers arriving at random intervals The rules: If no customers are present, the barber sleeps in their chair When a customer arrives and the barber is asleep, they wake the barber up If the ba