Optimal and near-optimal process scheduling and page replacementalgorithms.
a) What is the theoretically best process schedulingalgorithm?
b) Do shortest job first and shortest remaining time firstamount to the same thing or not?
c) Can they be directly implemented?
d) What do you consider the next best scheduling option, and howdoes it use the recent past to approximate the ideal case?
e) Consider the analogous case in page replacement. What is thebest possible choice of page to replace?
f) Can this be known? If not, what is the best approximation ofthe ideal case, and how does it use knowledge of the recent past toimplement it?
g) What is the overhead involved in keeping track of the recentpast in the case of page replacement?
