CPU $$ Bound Processes, QueuesCompare the characteristics of a CPU$-$bound process versus an I$/$O$-$bound process.

Assume that the system has a multiple level queue with a variable time quantum per queue, and that the incoming job needs $80$ ms to run to completion. If the first queue has a time quantum of $5$ ms and each queue thereafter has a time quantum that is twice as large as the previous one, how many times will the job be interrupted and on which queue will it finish its execution? Calculate how much time in ms that it spends in each queue.

Using the same multiple level queue system from the previous exercise, if a job needs $175$ ms to run to completion, how many times will the job be interrupted, and on which queue will it finish its execution?

Deadlocks

Given the ice cream example from the beginning of chapter $5,$ identify the four necessary conditions for deadlock and explain whether each one is present, or is not present, in this case.

Consider the directed graph shown below and answer the following questions:$$

a$.$ Is this system deadlocked?$$

b$.$ Which, if any, processes are blocked?$$

c$.$ What is the resulting graph after reduction?