Explain what happens in terms of the OS and the memory mangagement unit when a process accesses an address that is out of range (such as, the famous "segmentation fault"). Use as much detail as you can.
Consider the following page reference string:
5,2,3,7,6,3,2,5,2,3,2How many page faults would occur for an Second-Chance algorithm using 3 frames? Assume pure demand paging so your first unique pages will all cost one fault each.
Consider a demand-paging system with the following time-measured utilizations:
CPU utilization: 90% Paging disk: 10% Other I/O devices: 8%
Which (if any) of the following will (probably) decrease CPU utilization?
What is the locality of reference? How does demand paging take advantage of this in terms of a process' working set?
Consider a paging system with the page table stored in memory:
Explain what happens when a process executes an
exec() call in terms of the paging environment.
What is the maximum number of disk I/O operations required to add a block to the end of the file a file descriptor of type:
Explain the principles behind the "top half" of an interrupt handler and the "bottom half."
What is the role of the device independent layer of a device driver?