Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Consider The Following5 x s://canvas.umd.umichedu/courses/497352/assignments/441

ID: 3907806 • Letter: C

Question

Consider The Following5 x s://canvas.umd.umichedu/courses/497352/assignments/4414883 Note1: Provide your answers in the space provides after each question. No handwriting is allowed. Note2: Make your answers as short as possible ns Q1 Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Burst Time Priority P1 P2 P3 P4 P5 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0 orn ery 10 ive 1. 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. 1. What is the turnaround time of each process for each of the scheduling algorithms in part a? 1. What is the waiting time of each process for each of the scheduling algorithms in part a? Answer: search 6

Explanation / Answer

1) Draw Gantt chart

FCFS

         p1(10)              p2(1)                 p3(2)                   p4(1)                    p5(5)

0                         10                       11                      13                         14                       19

SJF

      p2(1)                   p4(1)                      p3(2)                 p5(5)                p1(10)

0                        1                          2                          4                         9                       19

Non preemptive

        p4(1)                p1(10)                     p3(2)                p5(5)                  p2(1)

0                        1                         11                        13                       18                       19

RoudRobin

p1(10) p2(1) p3(2)p4(1)p5(5)

0       1        2      3       4       5       6       7       8       9        10     11     12     13     14     19

----------------------------------------------------------------------------------

Question 2:- Turn around time

FCFS

TurnAroundTime=FinishTime-arrivalTime=10+11+13+14+19=67

SJF

TurnAroundTime=FinishTime-arrivalTime=1+2+4+9+19=35

Non preemptive

TurnAroundTime=FinishTime-arrivalTime=1+11+13+18+19=62

RoundRobin

TurnAroundTime=FinishTime-arrivalTime=19+2+7+4+14=46

------------------------------------------------------------------------------

Question 3:- Waiting time

FCFS

wt=starting time-arrival time=0+10+11+13+14=48

SJF

wt=starting time-arrival time=0+1+2+4+9=16

Non preemptive

wt=starting time-arrival time=0+1+11+13+18=43

RoundRobin

wt=starting time-arrival time=9+1+5+3+9=27

p1 p2 p3 p4 p5
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote