GATE 2009 CS – Question 32
The diagram shows process states in a uniprocessor system. Assume there are always ready processes. Which statements are TRUE?
I. A process making transition D immediately causes another process to make transition A.
II. A blocked process P2 can make transition E while P1 is running.
III. The OS uses preemptive scheduling.
IV. The OS uses non-preemptive scheduling.

Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) II and III
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort