Dining Philosophers Problem
Classic synchronization problem with five philosophers sharing forks. Demonstrates deadlock scenarios, starvation concerns, and multiple solution approaches including resource limiting, asymmetric solutions, and Tanenbaum’s algorithm with state tracking.