超星 - Chapter 4 CPU Scheduling

单选题

With round robin scheduling algorithm in a time shared system ____________

A. using very large time slices converts it into First come First served scheduling algorithm
B. using very small time slices converts it into First come First served scheduling algorithm
C. using extremely small time slices increases performance
D. using very small time slices converts it into Shortest Job First algorithm

查看答案

单选题

Complex scheduling algorithms ____________

A. are very appropriate for very large computers
B. use minimal resources
C. use many resources
D. all of the mentioned

查看答案

单选题

The strategy of making processes that are logically runnable to be temporarily suspended is called ____________

A. Non preemptive scheduling
B. Preemptive scheduling
C. Shortest job first
D. First come First served

查看答案

单选题

What is Scheduling?

A. allowing a job to use the processor
B. making proper use of processor
C. all of the mentioned
D. none of the mentioned

查看答案

单选题

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

查看答案

单选题

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

查看答案

With round robin scheduling algorithm in a time shared system ____________

Complex scheduling algorithms ____________

The strategy of making processes that are logically runnable to be temporarily suspended is called ____________

What is Scheduling?

Orders are processed in the sequence they arrive if _______ rule sequences the jobs.

Which of the following algorithms tends to minimize the process flow time?

Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________

Which of the following statements are true?

Which is the most optimal scheduling algorithm?

Under multiprogramming, turnaround time for short jobs is usually and that for long jobs is slightly ___