Given below is a program which when executed spawns two concurrent processes:…
GATE · 2005 · IT
Given below is a program which when executed spawns two concurrent processes:
semaphore X := 0;
/* Process now forks into concurrent processes P1 and P2 */
P1: repeat forever P2: repeat forever
V(X); P(X);
Compute; Compute;
P(X); V(X);Consider the following statements about processes P1 and P2:
It is possible for process P1 to starve.
It is possible for process P2 to starve.
Which of the following holds?
- A.
Both I and II are true
- B.
I is true but II is false
- C.
II is true but I is false
- D.
Both I and II are false
Attempted by 290 students.
Sign up free to check your answer
Sign up freeLoading lesson…