Q34

MCQ2 marks, −0.67

Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$ , respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ and not used in CODE SECTION P. $\begin{array}{|c|} \hline \textbf{CODE SECTION P} \\ \hline \end{array}$ wait(a); count=count+1; if (count==n) signal (b); signal (a); wait (b) ; signal (b); $\begin{array}{|c|} \hline \textbf{CODE SECTION Q} \\ \hline \end{array}$ What does the code achieve?

(A)

It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.

(B)

It ensures that atmost two processes are in CODE SECTION Q at any time.

(C)

It ensures that all processes execute CODE SECTION P mutually exclusively.

(D)

It ensures that at most $n-1$ processes are in CODE SECTION P at any time.

Loading…