{"id":3234,"date":"2025-06-07T08:49:13","date_gmt":"2025-06-07T08:49:13","guid":{"rendered":"https:\/\/diznr.com\/?p=3234"},"modified":"2025-06-07T08:49:13","modified_gmt":"2025-06-07T08:49:13","slug":"non-preemptive-scheduling-solved-gate-papers-question","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/non-preemptive-scheduling-solved-gate-papers-question\/","title":{"rendered":"Non preemptive scheduling – Solved Gate%20 Question Papers"},"content":{"rendered":"

Non preemptive scheduling – Solved Gate%20 Question Papers<\/p>\n

[fvplayer id=”311″]<\/p>\n

Absolutely! Here’s a complete breakdown of Non-Preemptive Scheduling<\/strong> with a solved GATE-style question<\/strong>, including explanation, table, and Gantt chart \u2014 tailored for GATE CSE\/IT aspirants.<\/p>\n

\n

\ud83c\udfaf Topic: Non-Preemptive Scheduling<\/strong><\/h2>\n

Subject:<\/strong> Operating System
GATE Relevance:<\/strong> High
Type:<\/strong> Numerical-based Questions (Process Scheduling)<\/p>\n

\n

\ud83d\udcd8 What is Non-Preemptive Scheduling?<\/strong><\/h2>\n

In Non-Preemptive Scheduling<\/strong>, once a process starts executing on the CPU, it cannot be stopped<\/strong> until it completes.
\u2705 The CPU is assigned only after the current process finishes<\/strong>.
This contrasts with Preemptive scheduling<\/strong>, where the CPU can be taken away by a higher-priority task.<\/p>\n

\n

\u2705 Common Non-Preemptive Scheduling Algorithms:<\/h3>\n
\n
\n\n\n\n\n\n\n\n
Algorithm<\/th>\nDescription<\/th>\n<\/tr>\n<\/thead>\n
FCFS (First Come First Serve)<\/strong><\/td>\nProcessed in order of arrival<\/td>\n<\/tr>\n
SJF (Shortest Job First)<\/strong><\/td>\nProcess with shortest burst time first<\/td>\n<\/tr>\n
Priority Scheduling (Non-preemptive)<\/strong><\/td>\nHighest priority (lowest number) runs first<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n
<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

\ud83d\udcdd Solved GATE-Style Question: SJF (Non-Preemptive)<\/strong><\/h2>\n

\ud83d\udccc Question:<\/strong>
Consider the following processes:<\/p>\n

\n
\n\n\n\n\n\n\n\n\n
Process<\/th>\nArrival Time<\/th>\nBurst Time<\/th>\n<\/tr>\n<\/thead>\n
P1<\/td>\n0 ms<\/td>\n8 ms<\/td>\n<\/tr>\n
P2<\/td>\n1 ms<\/td>\n4 ms<\/td>\n<\/tr>\n
P3<\/td>\n2 ms<\/td>\n9 ms<\/td>\n<\/tr>\n
P4<\/td>\n3 ms<\/td>\n5 ms<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n
<\/div>\n<\/div>\n<\/div>\n<\/div>\n

Use Non-Preemptive SJF Scheduling<\/strong>.
Find the Average Waiting Time<\/strong> and Average Turnaround Time<\/strong>.<\/p>\n

\n

\ud83e\uddee Step 1: Gantt Chart (SJF – Shortest Job First)<\/h3>\n

Initial time = 0<\/strong>, only P1<\/strong> has arrived \u21d2 Execute P1
At time 8, P2, P3, P4 have arrived
Shortest burst time among them = P2 (4ms)<\/strong>
Next = P4 (5ms)<\/strong>
Then = P3 (9ms)<\/strong><\/p>\n

\ud83d\udcca Gantt Chart:<\/h3>\n
\n
<\/div>\n
\n
\n