2 2 votes The sequence $\_\_\_\_$ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for $\_\_\_\_$ unit(s) of time.\[\begin{array}{c|c|c}\text{Job} & \text{Arrival Time} & \text{Burst Time} \\\hline1 & 0.0 & 4 \\2 & 1.5 & 8 \\3 & 2.0 & 2\end{array}\]$\{1,3,2\}, 0$ $\{1,2,3\}, 0$ $\{3,1,2\}, 2$ $\{1,3,2\}, 1.5$ Operating System goclasses operating-system goclasses-cs-dpp goclasses-cs-dpp-day-168 goclasses-os-practice-questions + – GO Classes 564 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Ash24 commented Dec 31, 2025 reply Follow flag optimal wrt to Waiting Time. 0 0 replyShare amanbadone0 commented Dec 31, 2025 reply Follow flag The smaller process is given more priority. 0 0 replyShare Please log in or register to add a comment.
1 1 vote Correct Answer : A GO Classes answered Dec 31, 2025 GO Classes comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Option A JAY_THAKAR answered Jan 9 JAY_THAKAR comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Answer is A,B because FCFS AND SJF both are non premitive sheduling algorithms then using FCFS=B , SJF=A both are optimal in terms of unit of time right if it a msq we really don't know it is msq or mcq not mentioned @GOClasses @GO Classes SupportA,B correct me if i am wrong One_Last_Hope answered Apr 3 One_Last_Hope comment Share Follow See all 2 Comments 2 2 Comments reply ahthneeuhl commented Jun 20 reply Follow flag Yes, both should be answer! 0 0 replyShare Mr-TAGORE commented Aug 15 reply Follow flag @One_Last_Hope Bro can you check is option B is correct. As for Option A avg.waiting time is 2.16For option B avg.waiting time is 4.16Then how option B is correct. 0 0 replyShare Please log in or register to add a comment.
