1. describe, in step-by-step form, the procedure that the operating system would use to switch from one user to another in a multiuser time sharing system.
2. Discuss the steps that take place when a process is moved a) from ready state to running state; b) from running state to blocked state; c) from running state to ready state, and d) from blocked state to ready state.
3. Explain deadlocking.
4. The CPU scheduling algorithm (in UNIX) is a simple priority algorithm. The priority for a process is computed as the ratio of the CPU time actually used by the process to the real time that has passed. The lower the figure, the higher the priority. Priorities are recalculated every 10^th of a second.

1. What kind of jobs are favoured by this type of algorithm?
2. If there is no I/O being performed, this algorithm reduces to a round-robin algorithm. Explain.
3. Discuss this algorithm in terms of the scheduling objectives give in the reference text.

5. Explain the bootstrap procedure for a diskless workstation.