Aspire Faculty ID #12069 · Topic: CUET 2025 · Just now
CUET 2025

Which CPU scheduling algorithm prefers the process with the shortest burst time?

Solution

  • FCFS (First Come First Serve): Executes in the order processes arrive, no burst-time consideration.

  • SJF (Shortest Job First): Picks the process with the least CPU burst time → minimizes average waiting time.

  • Round Robin: Allocates equal time slices (quantum) cyclically, ignoring burst length.

  • Priority Scheduling: Selects based on priority value, not burst time (though burst time can be used as a priority heuristic).

Previous 10 Questions — CUET 2025

Nearest first

Next 10 Questions — CUET 2025

Ascending by ID
Ask Your Question or Put Your Review.

loading...