Part A:

Part B:

Requests are not usually uniformly distributed. For example, we can expect a cylinder containing the file-system metadata to be accessed more frequently than a cylinder containing only files. Suppose you know that 50 percent of the requests are for a small, fixed number of cylinders. Would any of the scheduling algorithms discussed in this chapter be particularly good for this case? Explain