GATE PYQ
Q. The sequence ........ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for........ unit(s) of time.
|
Job |
Arrival Time |
Burst Time |
|
1 |
0.0 |
9 |
|
2 |
0.6 |
5 |
|
3 |
1.0 |
1 |
(a) {3, 2, 1} 1
(b) {2, 1, 3}, 0
(c) {3, 2, 1}, 0
(d) {1, 2, 3}, 5
Post a Comment
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.