Which of the following scheduling algorithm has the highest CPU overhead?First come, first servedRound-robinShortest job firstNone of these

To determine which scheduling algorithm has the highest CPU overhead, we need to compare the characteristics of each algorithm.

1. First come, first served (FCFS): This algorithm schedules processes in the order they arrive. It has a simple implementation but can lead to high CPU overhead if long-running processes arrive first, causing other processes to wait for a significant amount of time.

2. Round-robin (RR): This algorithm allocates a fixed time slice to each process in a cyclic manner. It ensures fairness by giving each process an equal opportunity to execute. However, if the time slice is too small, there can be a high overhead due to frequent context switches.

3. Shortest job first (SJF): This algorithm schedules processes based on their burst time, with the shortest job being executed first. It aims to minimize the waiting time and maximize CPU utilization. However, it requires knowledge of the burst time in advance, which may not always be available.

Based on these characteristics, the scheduling algorithm with the highest CPU overhead would be the first come, first served (FCFS) algorithm. This is because it does not prioritize shorter jobs or consider the available CPU time, potentially leading to longer waiting times and inefficient CPU utilization.

Therefore, the correct answer is: First come, first served (FCFS).