GATE Computer Science (CS) 2014 Shift 2 Solved Paper

Question : 41 of 65

Marks: +1, -0

Consider the procedure below for the Producer-Consumer problem which uses semaphores:

semaphore n = 0;
semaphore s = 1;

void producer()
{
while(true)
{
produce();
semWait(s);
addToBuffer();
semSignal(s);
semSignal(n);
}
}

void consumer()
{
           while(true)
           {
            semWait(s);
            semWait(n);
            removeFromBuffer();
            semSignal(s);
             consume();
             }
}

Which one of the following is TRUE?

The producer will be able to add an item to the buffer, but the consumer can never consume it.
The consumer will remove no more than one item from the buffer.
Deadlock occurs if the consumer succeeds in acquiring semaphore s when the buffer is empty.
The starting value for the semaphore n must be 1 and not 0 for deadlock-free operation.

Validate

Go to Question:

Prev Question

Next Question