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
A solution to the problem of indefinite blockage of low – priority processes is ____________
A. Starvation
B. Wait queue
C. Ready queue
D. Aging
微信支付 
支付宝支付