Give two convincing arguments why your choice is better. For each scheduling algorithm listed below, indicate whether starvation is possible. Round Robin c. Consider an operating system where resource allocation is being done in accordance with the Banker's Algorithm. Suppose that an operating system uses the Banker's Algorithm for resource allocation.
People make accurate worst-case estimates of resource use.
But the worst case is rarely the typical case. That is, if we actually have 20000 disk blocks and 10 magnetic tape drives, we would pretend to have 22000 disk blocks and 11 magnetic tape drives, etc. Presumably, if we re-measure the performance of the operating system, it will no longer be leaving resources unused. Memory Management 1. Explain, in terms of hardware and MMUs, what a segmentation fault is.