Computer Sciences > GATE 2024 SET-1 > Process State Transitions

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

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

A

Running to Ready

B

Waiting to Running

C

Ready to Waiting

D

Running to Terminated

Check Answer

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science