Which of the following algorithms tends to minimize the process flow time?
A. First come First served
B. Shortest Job First
C. Earliest Deadline First
D. Longest Job First
查看答案
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
A. Lengthened; Shortened
B. Shortened; Lengthened
C. Shortened; Shortened
D. Shortened; Unchanged
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
微信支付 
支付宝支付