There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
A. tQ = 15ms
B. tQ = 40ms
C. tQ = 45ms
D. tQ = 50ms
Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
A. earliest due date
B. slack time remaining
C. first come, first served
D. critical ratio
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