What is the CPU Burst time for P2?Answer 1 Question 14What is the turnaround time for P3?Answer 2 Question 14What is the CPU Burst time for P1?Answer 3 Question 14What is the waiting time for P3?Answer 4 Question 14What is the waiting time for P1?Answer 5 Question 14What is the waiting time for P4?Answer 6 Question 14What is the turnaround time for P2?Answer 7 Question 14

You are given the Gantt chart for the Shortest Job First (SJF) scheduling algorithm. Assume all processes arrive at the same time at t=0 What is the CPU Burst time for P2?Answer 1 Question 14What is the turnaround time for P3?Answer 2 Question 14What is the CPU Burst time for P1?Answer 3 Question 14What is the waiting time for P3?Answer 4 Question 14What is the waiting time for P1?Answer 5 Question 14What is the waiting time for P4?Answer 6 Question 14What is the turnaround time for P2?Answer 7 Question 14

Consider Five Processes P1 to P5 arrived at same time. They have stimated runningtime 10,2,6,8 and 4 seconds, respectively. Their Priorities are 3,2,5,4 and 1,respectively with 5 being highest Priority. Find the average turnaround time andaverage waiting time for Round- Robin(q=3) and Priority Schedulingalgorithm.

Q5. Consider the set of 6 processes whose arrival time and burst time are given below-Arrival time Burst timeP1 0 6P2 1 7P3 2 8P4 3 10P5 4 3P6 5 4If the CPU scheduling policy is Round Robin with time quantum = 3, calculate the average waiting time andaverage turnaround time. For the given scheduling Algorithm (a) FCFS (b) SJF (c) SRTF

Consider three processes P1, P2, and P3 with the following CPU burst times: Burst times for P1: 14, 12, 17, Burst times for P2: 2, 2, 2, 3, 2, 2, 2, 3, Burst times for P3: 6, 3, 8, 2, 1, 3, 4, 1, 9, 7. All three arrive at time 0, in order P1, P2, P3. Each CPU burst is followed by an I/O operation taking 6 time units, except for the last burst after which the process terminates. Assume that overhead time for process switching and scheduling functions are negligible (assumed to be 0). Multi-level feedback queuing using three queues with the following parameters: Queue 0 quantum of 2 time units (after which process is moved to Queue 1). Queue 1 quantum of 4 time units (after which process is moved to Queue 2). Queue 2 FCFS. All process that becomes ready is added to Queue 0. A process that arrives in Queue 0 preempts any executing process that belongs to either Queue 1 or Queue 2. Processes in Queue 1 are allocated to the CPU only when Queue 0 is empty. Processes in Queue 2 are allocated to the CPU only with both Queue 0 and Queue 1 are empty. What is the average turnaround time. Write the answer in up to integer; round off and don t write any additional character. Examples of incorrect answers are 3.2, 3 ms, 12 sec, etc."10:17 a.m.

Consider the following set of processes, with the length of the CPU burstgiven in milliseconds:Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3The processes are assumed to have arrived in the order P1, P2, P3, P4, P5,all at time 0.a. Draw four Gantt charts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the schedulingalgorithms in part a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?