Process Synchronization - Barbershop Problem
Summary :Classical Dijkstra barbershop problem with waiting room capacity. Customers balk when full, barber sleeps when idle. Solution combines scoreboard and dual rendezvous patterns ensuring mutual exclusion during haircuts with proper wake-sleep coordination.