• edited by
26,468 views
25 25 votes

Which of the following process state transitions is/are NOT possible?

  1. Running to Ready
  2. Waiting to Running
  3. Ready to Waiting
  4. Running to Terminated

4 Answers

26 26 votes

Consider the following process state diagram:

 

From the above process state diagram, it is clear that:

  • A process can go from running to ready.
  • A process can go from running to exit/terminate.
  • A process can not go from waiting to running and ready to wait.

Option $(B,C)$ is correct.

Similar types of questions are asked in:

  1.  GATE CSE 2020 | Question: 12
  2.  GATE CSE 2009 | Question: 32
1 1 vote
correct me if Iam wrong,

ready state contain those processes who require cpu for further execution.and waiting state contains those processes which are having I/o requirement.as per option 3,if a process can go to ready to waitiong state,it means that process needs i/o.but it is in the ready Q FOR using cpu.which is useless case.
1 1 vote
It's a simple common-sense point — a process cannot move directly from the Ready state to the Waiting state. For a process to enter the Waiting state, it must first be in the Running state. If, while running on the CPU, it requests I/O or some other blocking operation, it will then transition from Running to Waiting. Once the I/O is complete, it moves from Waiting back to Ready. So, the transition from Waiting to Ready is possible, but not from Ready to Waiting directly.
Answer:
Position:
Show:

Related questions

52 52 votes
5 5 answers
27.2k
27.2k views
Arjun asked Feb 16, 2024
27,186 views
Which of the following statements about threads is/are TRUE?Threads can only be implemented in kernel spaceEach thread has its own file descriptor table for open filesAll...
58 58 votes
8 answers 8 answers
30.7k
30.7k views
Arjun asked Feb 16, 2024
30,650 views
Which of the following statements about a relation $\mathbf{R}$ in first normal form $\text{(1NF)}$ is/are TRUE?$\mathbf{R}$ can have a multi-attribute key$\mathbf{R}$ ca...
38 38 votes
7 7 answers
25.1k
25.1k views
Arjun asked Feb 16, 2024
25,094 views
​Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular.Which of the following statements is/are always TRUE?$L_1=L_2$ if and only if $L_1 \cap...
18 18 votes
3 3 answers
14.1k
14.1k views
Arjun asked Feb 16, 2024
14,127 views
Which of the following is/are Bottom-Up Parser(s)?Shift-reduce ParserPredictive ParserLL$(1)$ Parser LR Parser