Computer Science · Operating Systems
There are n jobs waiting in the ready queue and the CPU uses a non-preemptive Shortest Job First (SJF) scheduling algorithm. What is the time complexity of selecting and scheduling these jobs based on their burst times?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n)
- 2O(n log n)✓
- 3O(1)
- 4O(n2)
Correct answer
O(n log n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems