Synchronization Checkpoint

1. A semaphore P operation does what when count is zero?

Blocks Decrements to -1 and continues Crashes the OS Signals another thread

2. Deadlock corresponds to:

A cycle in the wait-for graph Any blocked thread A single semaphore CPU starvation

3. FIFO wakeup provides:

Fairness Maximum throughput Minimum context switches No waiting

4. True/False: Deadlock prevention is the same as deadlock detection.