RR SJF PS FCFS

Which scheduling algorithm executes the process that arrives first in the ready queue?

• Shortest Job First

• First Come First Serve

• Round Robin

• Priority Scheduling

Which scheduling algorithm leads to the convoy effect?

• SJF

• FCFS

• Round Robin

• Priority Scheduling

In which scheduling algorithm does the CPU execute the process with the shortest burst time first?

• First Come First Serve

• Shortest Job First

• Round Robin

• Priority Scheduling

Which scheduling algorithm gives each process a fixed time to execute before switching to another process?

• FCFS

• SJF

• Round Robin

• Priority Scheduling

Which of the following scheduling algorithms may cause starvation?

• FCFS

• SJF

• Round Robin

• None of the above

If time quantum is too small in Round Robin, it leads to:

• Increased throughput

• High context switching overhead

• Reduced response time

• Decreased CPU utilization

Which scheduling algorithm is optimal in terms of minimizing average waiting time?

• FCFS

• SJF

• Round Robin

• Priority Scheduling

What is the major disadvantage of FCFS scheduling?

• Starvation

• High context switching

• Poor turnaround time for short processes

• Complexity in implementation

In Priority Scheduling, which process gets executed first?

• The one with the highest priority value

• The one with the lowest priority value

• The first process that arrives

• The process with the shortest burst time

Which of the following scheduling algorithms does NOT involve process preemption?

• Round Robin

• Non-preemptive Priority Scheduling

• Preemptive SJF

• Multilevel Queue Scheduling