A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the tables below, where P0, P1, P2 are processes and R0, R1, R2 are resource types.
(a) Show that the system can be in this state.
(b) What will the system do on a request by process P0 for one unit of resource type R1?

The process state transition diagram in Figure is representative of

Which of the following is an example of spooled device?

Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their burst $$CPU$$ time requirements are $$4, 1, 8, 1$$ time units respectively. The completion time of A under round robin scheduling with time slice of one time units.