Question: Consider the following 3 source codes: Source Code 1: program My_Pgm1 i = 1 for n = 1 to 10 x = i + n

Consider the following 3 source codes: Source Code 1: program My_Pgm1 i = 1 for n = 1 to 10 x = i + n next end Source Code 2: program My_Pgm2 i = 10 for n = 1 to 8 x = i + n next end Source Code 3: program My_Pgm3 i = 10 for n = 1 to 15 x = i + n next end Source Code 4: program My_Pgm3 i = 5 for n = 1 to 15 x = i + n next end Create 4 processes P1, P2, P3 and P4 from source codes 1, 2, 3 and 4 respectively with following properties. Fill up the following table: Scheduling Algorithm : FCFS Process Arrival Time Waiting time P1 0 P2 0 P3 0 P4 0 Average waiting time Scheduling Algorithm : Round Robin with time quantum 5 Process Arrival Time Waiting time P1 0 P2 0 P3 0 P4 0 Average waiting time Scheduling Algorithm : Round Robin with time quantum 10 Process Arrival Time Waiting time P1 0 P2 0 P3 0 P4 0 Average waiting time Out of three cases, which one is better and why?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!