Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Question no 02: Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst Priority P1 32 4
Question no 02:
Consider the following set of processes, with the length of the CPU burst given in seconds:
Process | Burst | Priority |
P1 | 32 | 4 |
P2 | 24 | 1 |
P3 | 4 | 2 |
P4 | 36 | 2 |
P5 | 12 | 3 |
NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
- Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8).
- What is the turnaround time of each process for each of the scheduling algorithms in part a?
- What is the waiting time of each process for each of these scheduling algorithms?
- Which of the algorithms results in the minimum average waiting time (over all processes)?
- Which of the algorithms results in the minimum average turnaround time (over all processes)?
NOTE: Write the code of all parts
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started