Question: Introduction to Operating system please help thank you Problem #1 Figure 3.9b from our textbook contains seven states. In principle, one could draw a transition


Introduction to Operating system please help thank you
Problem #1 Figure 3.9b from our textbook contains seven states. In principle, one could draw a transition between any two states, for a total of 42 different transitions (do you see why this is true?). Questions 1. List all of the possible transitions, e.g. all of the transitions that could be allowed and would be possible. Give an example of what could cause each transition. 2. List all of the impossible transitions, e.g. all of the transitions that can not occur. Explain why you believe each transition is impossible. Dispatch Admit Release New Ready Running Exit Time-out Event occurs Activate Event wait Suspend Suspend Blocked (a) With one suspend state New Admit Admit Suspend Activate Dispatch Release Ready suspend Ready Running Exit Suspend Time-out Event occurs Event occurs Event wait Activate Blocked suspend Blocked Suspend (b) With two suspend states Figure 3.9 Process State Transition Diagram with Suspend States
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
