Strong Semaphore, Weak Semaphore


#1

Queue is used to hold processes waiting on the semaphore. Which of the following is true?

(i) A semaphore whose definition includes FIFO policy is called a strong semaphore.
(ii) A semaphore that doesn’t specify order in which processes are removed from the queue is a weak semaphore.
(iii) Strong semaphore guarantees freedom from starvation.
(iv) Weak Semaphore does not guarantee freedom from starvation.

A. (i) & (ii)
B. (ii) & (iv)
C. (ii) & (iii)
D. (i), (ii), (iii), (iv)


#2

Option D is the correct answer.
All are facts.

Reference:
http://faculty.simpson.edu/lydia.sinapova/www/cmsc335/cmsc335-01/CH05-Conc.htm