Three processes P1, P2, and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent the first 20% of their execution time doing 1/0 and the rest 80% in CPU processing. What is the AVERAGE WAITING TIME of the CPU using the FCFS, SJF, and RR scheduling algorithms? Process Execution time 1/0 time CPU time P1 10 8 P2 20 4. 16 P3 30 6. 24 2.

In a computer system five processes are attempting to proceed with three resource types. The total units of system resources are: (8,9,7). The maximum demands for every process are: P1(3,1,1), P2(3,3,2), P3(5,3,2), P4(5,1,2), P5(8,4,3). The current allocation is: P1 (0,1,1), P2 (2,1,1), P3 (3,1,2), P4 (1,1,1), and P5 (2,3,2). Is this state a safe state? Explain your answer. Please explain in great detail so i can understand .

Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process P1 P2 P3 P4 P5 Arrival Time 0 2 4 6 8 Burst Time 12 4 8 2 6 What is the average waiting time for these processes with the Shortest-Job-First scheduling algorithm?