Consider the following set of processes, the length of the CPU burst time given in milliseconds.Assuming the above process being scheduled with the SJF scheduling algorithm.
A. The waiting time for process P1 is 3ms
B. The waiting time for process P1 is 0ms
C. The waiting time for process P1 is 16ms
D. The waiting time for process P1 is 9ms
查看答案
Preemptive Shortest Job First scheduling is sometimes called ____________
A. Fast SJF scheduling
B. EDF scheduling – Earliest Deadline First
C. HRRN scheduling – Highest Response Ratio Next
D. SRTN scheduling – Shortest Remaining Time Next
An SJF algorithm is simply a priority algorithm where the priority is ____________
A. the predicted next CPU burst
B. the inverse of the predicted next CPU burst
C. the current CPU burst
D. anything the user wants
Choose one of the disadvantages of the priority scheduling algorithm?
A. it schedules in a very complex manner
B. its scheduling takes up a lot of time
C. it can lead to some low priority process waiting indefinitely for the CPU
D. none of the mentioned
What is ‘Aging’?
A. keeping track of cache contents
B. keeping track of what pages are currently residing in memory
C. keeping track of how many times a given page is referenced
D. increasing the priority of jobs to ensure termination in a finite time
微信支付 
支付宝支付