Answer the following problems:
problem 1) A process running on CTSS requires 30 quanta to finish. How many times should it be swapped in, including the very first time (before it has run at all)?
problem 2) Could you think of a way to save the CTSS priority system from being fooled by random carriage returns
problem 3) A real-time system requires to handle two voice calls that each run every 5 msec and consume 1 msec of CPU time per burst, in addition one video at 25 frames/sec with each frame requiring 20msec of CPU time. IS this system schedulable?
problem 4) Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Suggest a means of achieving this goal.