In the Producer-Consumer problem with a bounded buffer of size N, which semaphores are used for synchronization?
The bounded buffer problem uses 3 semaphores: 'mutex' initialized to 1 (for mutual exclusion on buffer access), 'full' initialized to 0 (counts filled slots), and 'empty' initialized to N (counts free slots).
In the Readers-Writers problem, which of the following accesses is allowed concurrently?
Multiple reader processes can safely read shared data concurrently without causing data inconsistency. However, writers require exclusive access (no other reader or writer).
In the Dining Philosophers problem with 5 philosophers and 5 chopsticks, what situation arises if every philosopher simultaneously picks up their left chopstick?
If all 5 philosophers pick up their left chopstick simultaneously, all 5 chopsticks are held and every philosopher waits indefinitely for their right chopstick, creating a circular wait (Deadlock).
What high-level synchronization construct combines data variables, private procedure functions, and automatic mutual exclusion into a single programming language module?
A Monitor is a high-level language synchronization construct that encapsulates private data variables and procedures. The compiler guarantees that only one process can be active inside the monitor at any time.
Inside a Monitor, what mechanism is used to allow a process to wait for a condition to become true?
Monitors provide Condition Variables (e.g., condition x;). A process calls x.wait() to suspend itself until another process calls x.signal() to resume a waiting process.