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.

1. FCFS

1. SJN

1. SRT

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

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