Using the given information, calculate which jobs will have arrived ready for processing by the time the first job is finished or interrupted using each of the following scheduling algorithms.
a. FCFS
b. SJN
c. SRT
D. Round robin (using time quantum of 5, ignore context switching and natural waist)
|
JOB
|
ARRIVAL TIME
|
CPU CYCLE
|
|
A
|
0
|
15
|
|
B
|
2
|
2
|
|
C
|
3
|
14
|
|
D
|
6
|
10
|
|
E
|
9
|
1
|