Question: 1. You must do this homework alone. 2. Please hand in ONE copy of the homework listing your full name and the university ID. 3.
1. You must do this homework alone. 2. Please hand in ONE copy of the homework listing your full name and the university ID. 3. The deadline to submit the answers is 11:59 pm on Feb 26, 2023 Consider the following set of processes, with the length of the CPU burst time given in milliseconds: The 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 the following scheduling algorithms: FCFS, priority queue, and RR (q=2). b. What is the waiting time of each process for each of these scheduling algorithms? c. Which of the algorithms results in the minimum average waiting time (over all processes)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
