Demonstrate a Java client and server exchanging one text message in each direction.
Demonstrate a C client and server exchanging one text message in each direction.
Task 3 (0.5%)
Demonstrate your C client exchanging one message in each direction with your Java server, or vice
2. The following state transition table represents the 5-state model of process
management. The labels represent transitions between states. For example,
1 is the transition from RUN to READY, whereas 5 is the opposite transition
from READY to RUN.
Run Ready Blocked Ready/
Run -- 1 2 3 4
Ready 5 -- 6 7 8
Blocked 9 10 -- 11 12
Ready/Susp 13 14 15 -- 16
Blocked/Susp 17 18 19 20 --
a. For each of the twenty labelled transitions, state whether such a
transition is valid or not, and if valid, explain what type of event might
trigger such a transition.
b. Draw a diagram of the five states with arrows showing only the valid
transitions. Add two more states called “New” and “Exit”, with relevant
transitions. Label all transition arrows.