1. A process running on CTSS needs 30 quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?
2. Can you think of a way to save the CTSS priority system from being fooled by random carriage returns?
3. The aging algorithm with a = III is being used to predict run times. The previous four runs, from oldest to most recent, are 40, 20, 40, and 15 msec. What is the prediction of the next time?