1 1 vote Consider the following three processes with the arrival time and CPU burst time given in miliseconds:ProcessArrival TimeBurst Time$P_1$07$P_2$14$P_3$28The Gantt Chart for preemptive SJF scheduling algorithm is _______ Operating System ugcnetcse-july2018-paper2 operating-system scheduling process-scheduling + – Pooja Khatri 3.4k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Jeewanjot Kaur commented Apr 6, 2019 reply Follow flag B is the right answer. 0 0 replyShare jacknroll commented Dec 15, 2025 reply Follow flag c is for non preemtive 0 0 replyShare Please log in or register to add a comment.
0 0 votes Only (2) and (4) are preemptive. While only (2) is correct. In (4) P2 started execution before its arrival! shahidhope answered Jul 14, 2018 shahidhope comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes 1) Not pre-emptive. P1 continues execution without being pre-empted. 2) Pre-emptive SJF . P1 executes for 1 second followed by execution of P2 for 4 secs. Then P1 finishes execution followed by P3. 3) Not pre-emptive as each of the processes carries on execution without being pre-empted. 4)Pre-emptive but P2 starts execution even before it has arrived which can't happen in reality. Hence Option 2 is correct . Sayan Bose answered Jul 15, 2018 Sayan Bose comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes option B is correct answer anjli answered Jan 14, 2021 anjli comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Option (C) is the right answer. Optioin (B) is for SRTF. Pallab_Pal answered Mar 27 Pallab_Pal comment Share Follow 0 reply Please log in or register to add a comment.