Which of the following statements are true?
A. I only
B. I and III only
C. II and III only
D. I, II and III
查看答案
Which is the most optimal scheduling algorithm?
A. FCFS – First come First served
B. SJF – Shortest Job First
C. RR – Round Robin
D. None of the mentione
The real difficulty with SJF in short term scheduling is ____________
A. it is too good an algorithm
B. knowing the length of the next CPU request
C. it is too complex to understand
D. none of the mentioned
The FCFS algorithm is particularly troublesome for ____________
A. time sharing systems
B. multiprogramming systems
C. multiprocessor systems
D. operating systems
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
微信支付 
支付宝支付