Which of the following is NOT a mandatory requirement for solving the Critical Section Problem in operating systems?
Option B is correct. The 3 essential requirements for solving the critical section problem are: 1. Mutual Exclusion, 2. Progress, and 3. Bounded Waiting. Strict turn alternation violates Progress.
What does the 'Bounded Waiting' requirement in the Critical Section problem guarantee?
Option C is correct. Bounded Waiting ensures no process waits indefinitely (starves) to enter its critical section after making a request.
Peterson's Solution is a classical software-based algorithm designed for mutual exclusion between how many concurrent processes?
Option C is correct. Peterson's Algorithm provides mutual exclusion for exactly two processes using two variables: int turn and bool flag[2].
What atomic hardware instruction sets a boolean variable to true and returns its old value in a single uninterruptible memory cycle?
Option B is correct. TestAndSet(&lock) is an atomic hardware instruction that reads the current value of lock and sets it to true atomically.
A semaphore whose integer value can range over an unrestricted domain of positive and negative integers is called a:
Option A is correct. A Counting Semaphore has an integer value over an unrestricted domain, used to manage resource access for a finite number of instances.