Scribd
Upload
7 views

Sorting

Uploaded by

numarklaurel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Sorting

Uploaded by

numarklaurel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Laurel, Numark Miguel V.

CS-3B

To be submitted on March 31, 2021

Assignment:

Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process Burst Time Priority


P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.

a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-
preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1)
scheduling.

b. What is the turnaround time of each process for each of the scheduling algorithms in part a?

c. What is the waiting time of each process for each of the scheduling algorithms in part a? d.
Which of the schedules in part a results in the minimal average waiting time (over all
processes)?

You might also like