Which CPU scheduling algorithm allocates CPU to the process with the shortest burst time first? 

The Shortest Job First (SJF) scheduling algorithm selects the process that has the shortest burst (execution) time next. This minimizes the average waiting time compared to other scheduling algorithms. SJF can be either preemptive (Shortest Remaining Time First) or non-preemptive. In the non-preemptive version, the currently running process is allowed to finish before the next shortest job is selected, while in the preemptive version, the running process may be interrupted if a shorter process arrives. Why other options are wrong: a) FCFS : First-Come, First-Served schedules processes in the order they arrive, regardless of their burst time. b) RR : Round Robin gives each process a fixed time slice before switching to the next one, without regard to burst time. d) Priority Scheduling : Priority Scheduling allocates CPU based on the priority of the processes, not their burst time. e) Multilevel Queue : This scheduling divides processes into multiple queues based on different characteristics, not necessarily on burst time.