Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET

Previous Year Question (PYQs)



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).



Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

loading...