Q. 44 The enter_CS ( ) and leave_CS ( ) functions to implement critical section of a
process are realized using test and set instruction as follows :
void enter_CS(X)
{
while test-and-set(X) ;
}
void leave_CS(X)
{
X = 0;
}
In the above solution, X is a memory location associated with the CS and is
initialized to 0. Now consider the following statements
I The above solution to CS problem is deadlock-free II The solution is starvation free III The processes enter CS in FIFO order IV More than one process can enter CS at the same time Which of the above statements are TRUE
(A) I only
(B) I and II
(C) II and III
(D) IV only
Answer: (A)
Explanation:
