Scheduling Algorithms Quiz

Which scheduling algorithm executes processes in the order they arrive?

• SJF

• FCFS

• Round Robin

• Priority Scheduling

In FCFS scheduling, the process that arrives first:

• Gets the lowest priority

• Gets executed last

• Gets executed first

• Is preempted by new processes

Which of the following can cause the “convoy effect”?

• SJF

• FCFS

• Priority Scheduling

• Round Robin

FCFS scheduling is best suited for:

• Time-sharing systems

• Interactive systems

• Batch systems

• Real-time systems

A major disadvantage of FCFS scheduling is:

• Starvation

• High context switching

• Complex implementation

• Lack of fairness

Which scheduling algorithm selects the process with the shortest burst time?

• FCFS

• SJF

• Priority Scheduling

• Round Robin

SJF minimizes which of the following?

• Turnaround time

• Arrival time

• Response time

• Context switches

In non-preemptive SJF, once a process starts execution:

• It can be interrupted by shorter jobs

• It must run to completion

• It waits for other processes to complete

• It switches between tasks frequently

A disadvantage of non-preemptive SJF is:

• Complex queue management

• High waiting time for short jobs

• Starvation of long processes

• Lack of fairness

Which type of scheduling requires prior knowledge of burst times?

• FCFS

• SJF

• Priority Scheduling

• Round Robin