1 Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively Job A 3 ms, Job B 11 ms, Job C 13 ms, Job D 7 ms, and Job E 2 ms a Using FCFS, in what order would they be processed What is the total time required to process all five jobs What is the average turnaround time for each of these five jobs b Using SJN, and assuming that all jobs are present when the algorithm begins, in what order would they be processed Job A, Job E, Job D, Job B, and Job C What is the total time required to process all five jobs What is the average turnaround time for all five jobs 2 Assume that the system has a multiple level queue with a variable time quantum per queue, and that the incoming job needs 175 ms to run to completion If the first queue has a time quantum of 10 ms and each queue thereafter has a time quantum that is twice as large as the previous one, how many times will the job be interrupted and on which queue will it finish its execution Calculate how much time in ms that it spends in each queue 3 Given the following information Job Arrival Time CPU Cycle A 0 12 B 2 2 C 3 10 D 6 7 E 10 3 Calculate which jobs will have arrived ready for processing by the time the first job is finished or is first interrupted Do your calculation using each of the following scheduling algorithms FCFS SJN SRT Round Robin (use a time quantum of 5, but ignore the time required for context switching and natural wait) 4 Using the same information from the previous exercise, calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms a FCFS b SJN c SRT d Round robin (using a time quantum of 5, but ignore the time required for context switching and natural wait) Complete these tables with the answers Job Arrival Time CPU Cycle Start Time FCFS Finish Time FCFS A 0 12 B 2 2 C 3 10 D 6 7 E 10 3 Job Arrival Time CPU Cycle Start Time SJN Finish Time SJN A 0 12 B 2 2 C 3 10 D 6 7 E 10 3 Job Arrival Time CPU Cycle Start Time SRT Finish Time SRT A 0 12 B 2 2 C 3 10 D 6 7 E 10 3 Job Arrival Time CPU Cycle Start Time Round Robin Finish Time Round Robin A 0 12 B 2 2 C 3 10 D 6 7 E 10 3

The Answer is in the image, click to view ...

Question: 1. Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 3 ms, Job B = 11 ms,

1. Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 3 ms, Job B = 11 ms, Job C = 13 ms, Job D = 7 ms, and Job E = 2 ms.

a. Using FCFS, in what order would they be processed?

What is the total time required to process all five jobs?

What is the average turnaround time for each of these five jobs?

b. Using SJN, and assuming that all jobs are present when the algorithm begins, in what order would they be processed? Job A, Job E, Job D, Job B, and Job C

What is the total time required to process all five jobs?

What is the average turnaround time for all five jobs?

2. Assume that the system has a multiple level queue with a variable time quantum per queue, and that the incoming job needs 175 ms to run to completion. If the first queue has a time quantum of 10 ms and each queue thereafter has a time quantum that is twice as large as the previous one, how many times will the job be interrupted and on which queue will it finish its execution? Calculate how much time in ms that it spends in each queue.

3.. Given the following information:

Job	Arrival Time	CPU Cycle
A	0	12
B	2	2
C	3	10
D	6	7
E	10	3

Calculate which jobs will have arrived ready for processing by the time the first job is finished or is first interrupted. Do your calculation using each of the following scheduling algorithms.

FCFS

Round Robin (use a time quantum of 5, but ignore the time required for context switching and natural wait)

4. Using the same information from the previous exercise, calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms.

a. FCFS

b. SJN

c. SRT

d. Round robin (using a time quantum of 5, but ignore the time required for context switching and natural wait) Complete these tables with the answers.

Job	Arrival Time	CPU Cycle	Start Time FCFS	Finish Time FCFS
A	0	12
B	2	2
C	3	10
D	6	7
E	10	3

Job	Arrival Time	CPU Cycle	Start Time SJN	Finish Time SJN
A	0	12
B	2	2
C	3	10
D	6	7
E	10	3

Job	Arrival Time	CPU Cycle	Start Time SRT	Finish Time SRT
A	0	12
B	2	2
C	3	10
D	6	7
E	10	3

Job	Arrival Time	CPU Cycle	Start Time Round Robin	Finish Time Round Robin
A	0	12
B	2	2
C	3	10
D	6	7
E	10	3

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!

Chapter 4: 1. Compare the characteristics of a CPU-bound process versus an I/O-bound process. 2. Name three examples of I/O devices that cannot be shared. 3. Five jobs arrive nearly simultaneously...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 3 ms , Job B = 1 1 ms , Job C = 1 3 ms , Job D = 7 ms , and Job E = 2 ms . Using SJN ,...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 3 ms , Job B = 1 1 ms , Job C = 1 3 ms , Job D = 7 ms , and Job E = 2 ms . Show all...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 12 ms, Job B = 24 ms, Job C = 30 ms, Job D = 18 ms, and Job E = 16 ms. a. Using...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 2 ms, Job B = 12 ms, Job C = 15 ms, Job D = 7 ms, and Job E = 3 ms. a. Using FCFS, in...

2) Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 2 ms, Job B = 12 ms, Job C = 15 ms, Job D = 7 ms, and Job E = 3 ms. a. Using FCFS,...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 2 ms, Job B = 12 ms, Job C = 15 ms, Job D = 7 ms, and Job E = 3 ms. a) Using FCFS, i....

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A 52 ms, Job B 512 ms, Job C 515 ms, Job D 57ms, and Job E 53 ms. a. Using FCFS i.In what...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 12, Job B = 2, Job C = 15, Job D = 7, and Job E = 3 ms. a. Using FCFS, and assuming the...

Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A52 m s , Job B512 m s , Job C515 m s , Job D57 m s , and Job E53 ms. Using SJN, and...

Go to the Connect site for this book, Chapter 23, and find there a spreadsheet containing monthly values of the S& P 500 index. Suppose that in each month you had written an out- of- the- money put...

Draw the structure of chemical compound 1) Thionyl chloride II) sulfuryl chloride IH) Phosphoryl chloride

Yasmeen purchases stock on January 3 0 , 2 0 2 3 . If she wishes to achieve a long - term holding period, what is the first date that she can sell the stock as a long - term gain? a . January 3 1 , 2...

The following transactions occurred during December 31, 2021, for the Microchip Company. 1. On October 1, 2021, Microchip lent $97,000 to another company. A note was signed with principal and 8%...