CPU Scheduling 1

The amount of time to execute a particular process is known as

• Throughput

• Turnaround Time

• Waiting Time

• Response Time

Which type of CPU Scheduling handles processes based on the arrival order?

• First-Come, First-Served

• Shortest-Job-First

• Round Robin

• Priority

Which of the following will happen when optimum Shortest-Job-First (SJF) scheduling is achieved for a given set of processes?

• Minimum throughput

• Maximum total waiting time

• Maximum turnaround time

• Minimum average waiting time

Which of the following CPU scheduling is same as priority scheduling where priority is the inverse of predicted next CPU burst time?

• First-Come, First-Served

• Shortest-Job-First

• Round Robin

• None of the options

Time Quantum, q, should be ___ compared to context switch time.

Which of following statement is not one of the scheduling algorithm optimization criteria?

• Minimize average response time.

• Minimize average turnaround time.

• Minimize average throughput.

• Minimize average waiting time.

Which is referred as total amount of time a process has been waiting in the ready queue?

• Throughput

• Turnaround time

• Response time

• Waiting time

Which is referred as the amount of time to execute a particular process?

• Waiting time

• Turnaround time

• Response time

• CPU utilization

Time at which the process arrives in the ready queue is referred as ___.

• Turnaround time

• Arrival time

• Completion time

• Waiting time

Which of the following is a criterion to evaluate a scheduling algorithm?

• CPU Utilization: Keep CPU utilization as high as possible

• Throughput: Number of processes completed per unit time

• Waiting Time: Amount of time spent ready to run but not running

• All of the above