FCFS AND SJF

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

• FCFS

• Round Robin

• SJF

• Priority Scheduling

Which of the following scheduling algorithms is non-preemptive?

• Shortest Job First

• Round Robin

• Multilevel Queue

• Preemptive SJF

Which of the following is true about First Come, First Served (FCFS) scheduling?

• It may lead to the convoy effect

• It always minimizes waiting time

• It is a preemptive algorithm

• It prioritizes shorter jobs

Shortest Job First (SJF) scheduling is optimal in terms of:

• Turnaround Time

• Waiting Time

• Both A and B

• CPU Utilization

In which scheduling algorithm does the process that arrives first get executed first?

• SJF

• Priority Scheduling

• FCFS

• Round Robin

Which scheduling method is more likely to cause starvation for longer processes?

• FCFS

• SJF

• Round Robin

• Multilevel Queue

Which scheduling algorithm does not consider the burst time of a process?

• SJF

• FCFS

• Priority Scheduling

• Shortest Remaining Time First

Which of the following scheduling algorithms can lead to poor average waiting time when longer jobs arrive first?

• FCFS

• SJF

• Round Robin

• Priority Scheduling

Which scheduling algorithm ensures that processes are executed based on their order of arrival?

• SJF

• FCFS

• Priority Scheduling

• Shortest Remaining Time First

What is the main disadvantage of FCFS scheduling?

• Starvation of shorter processes

• Complexity in implementation

• Overhead in maintaining queues

• High turnaround time