{"id":3232,"date":"2025-06-07T08:47:21","date_gmt":"2025-06-07T08:47:21","guid":{"rendered":"https:\/\/diznr.com\/?p=3232"},"modified":"2025-06-07T08:47:21","modified_gmt":"2025-06-07T08:47:21","slug":"preemptive-scheduling-gate-2020-toc-previous-year-solved-paper-question","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/preemptive-scheduling-gate-2020-toc-previous-year-solved-paper-question\/","title":{"rendered":"Preemptive scheduling – Gate 2025 – TOC previous year solved question Paper."},"content":{"rendered":"

Preemptive scheduling – Gate 2025 – TOC previous year solved question Paper.<\/p>\n

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

\ud83d\udcd8 Preemptive Scheduling \u2013 GATE 2025 | TOC Previous Year Solved Question<\/strong><\/h3>\n
\n

\u2705 Topic:<\/strong> Operating System (OS) \u2013 Preemptive CPU Scheduling<\/em>
\ud83c\udfaf Exam Focus:<\/strong> GATE CSE \/ IT 2025
\ud83d\udcc2 Category:<\/strong> Theory of Computation (TOC often refers to OS in GATE context when dealing with scheduling topics)<\/p>\n<\/blockquote>\n

\n

\u2699\ufe0f \u0915\u094d\u092f\u093e \u0939\u094b\u0924\u093e \u0939\u0948 Preemptive Scheduling?<\/strong><\/h2>\n

Preemptive Scheduling<\/strong> \u090f\u0915 CPU scheduling \u0924\u0915\u0928\u0940\u0915 \u0939\u0948 \u091c\u093f\u0938\u092e\u0947\u0902 running process \u0915\u094b \u092c\u0940\u091a \u092e\u0947\u0902 \u0930\u094b\u0915\u0915\u0930<\/strong> \u0915\u093f\u0938\u0940 \u0926\u0942\u0938\u0930\u0947 higher priority<\/strong> \u092f\u093e ready process<\/strong> \u0915\u094b CPU \u0926\u093f\u092f\u093e \u091c\u093e\u0924\u093e \u0939\u0948\u0964<\/p>\n

\n

\ud83d\udd11 Key Features:<\/strong><\/h3>\n
\n
\n\n\n\n\n\n\n\n\n
Feature<\/th>\nDescription<\/th>\n<\/tr>\n<\/thead>\n
Preemption<\/td>\n\u0939\u093e\u0901 (Yes) \u2013 Process \u0915\u094b \u092c\u0940\u091a \u092e\u0947\u0902 interrupt \u0915\u093f\u092f\u093e \u091c\u093e \u0938\u0915\u0924\u093e \u0939\u0948<\/td>\n<\/tr>\n
Control<\/td>\nOS \u0915\u0947 \u092a\u093e\u0938 \u0939\u094b\u0924\u093e \u0939\u0948<\/td>\n<\/tr>\n
Response Time<\/td>\n\u092c\u0947\u0939\u0924\u0930<\/td>\n<\/tr>\n
Context Switching<\/td>\n\u091c\u093c\u094d\u092f\u093e\u0926\u093e \u0939\u094b\u0924\u093e \u0939\u0948 (CPU overhead \u092c\u0922\u093c\u0924\u093e \u0939\u0948)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n
<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

\ud83d\udccc Common Preemptive Algorithms:<\/strong><\/h2>\n
    \n
  1. \n

    Round Robin (RR)<\/strong><\/p>\n<\/li>\n

  2. \n

    Shortest Remaining Time First (SRTF)<\/strong><\/p>\n<\/li>\n

  3. \n

    Preemptive Priority Scheduling<\/strong><\/p>\n<\/li>\n<\/ol>\n

    \n

    \ud83d\udcdd GATE Previous Year Solved Question (Example)<\/strong><\/h2>\n

    GATE CSE Question (Simplified):<\/strong><\/h3>\n

    \ud83d\udcc5 GATE Year:<\/strong> 2017
    \ud83e\uddee Question Type:<\/strong> Numerical
    \ud83d\udd27 Topic:<\/strong> Preemptive Scheduling \u2013 SRTF<\/p>\n

    Q:<\/strong><\/h3>\n

    Consider the following set of processes with arrival time and burst time:<\/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>\n7 ms<\/td>\n<\/tr>\n
    P2<\/td>\n2 ms<\/td>\n4 ms<\/td>\n<\/tr>\n
    P3<\/td>\n4 ms<\/td>\n1 ms<\/td>\n<\/tr>\n
    P4<\/td>\n5 ms<\/td>\n4 ms<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
    \n
    <\/div>\n<\/div>\n<\/div>\n<\/div>\n

    Use Shortest Remaining Time First (Preemptive)<\/strong> scheduling.
    \ud83d\udd0d What is the average waiting time<\/strong>?<\/p>\n

    \n

    \u2705 Solution Step-by-Step:<\/strong><\/h3>\n

    \ud83d\udcca Step 1: Gantt Chart<\/h4>\n
    \n
    \n\n\n\n\n\n\n\n\n\n\n\n\n\n
    Time<\/th>\nRunning Process<\/th>\n<\/tr>\n<\/thead>\n
    0-2<\/td>\nP1 (7\u21925)<\/td>\n<\/tr>\n
    2-4<\/td>\nP2 (4\u21922)<\/td>\n<\/tr>\n
    4-5<\/td>\nP3 (1)<\/td>\n<\/tr>\n
    5-6<\/td>\nP2 (2\u21921)<\/td>\n<\/tr>\n
    6-7<\/td>\nP2 (1\u21920)<\/td>\n<\/tr>\n
    7-11<\/td>\nP4 (4)<\/td>\n<\/tr>\n
    11-13<\/td>\nP1 (5\u21923)<\/td>\n<\/tr>\n
    13-15<\/td>\nP1 (3\u21921)<\/td>\n<\/tr>\n
    15-17<\/td>\nP1 (1\u21920)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
    \n
    <\/div>\n<\/div>\n<\/div>\n<\/div>\n

    \u23f1\ufe0f Completion Time (CT)<\/h4>\n
    \n
    \n\n\n\n\n\n\n\n\n
    Process<\/th>\nCT<\/th>\nTAT (CT – AT)<\/th>\nWT (TAT – BT)<\/th>\n<\/tr>\n<\/thead>\n
    P1<\/td>\n17<\/td>\n17 – 0 = 17<\/td>\n17 – 7 = 10<\/td>\n<\/tr>\n
    P2<\/td>\n7<\/td>\n7 – 2 = 5<\/td>\n5 – 4 = 1<\/td>\n<\/tr>\n
    P3<\/td>\n5<\/td>\n5 – 4 = 1<\/td>\n1 – 1 = 0<\/td>\n<\/tr>\n
    P4<\/td>\n11<\/td>\n11 – 5 = 6<\/td>\n6 – 4 = 2<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
    \n
    <\/div>\n<\/div>\n<\/div>\n<\/div>\n

    \ud83e\uddee Average Waiting Time:<\/h4>\n

    = (10 + 1 + 0 + 2) \/ 4
    = 13 \/ 4 = 3.25 ms<\/strong><\/p>\n

    \n

    \ud83c\udf93 Concept Check:<\/strong><\/h2>\n

    \u2705 Preemptive = Process \u0915\u094b interrupt \u0915\u093f\u092f\u093e \u091c\u093e \u0938\u0915\u0924\u093e \u0939\u0948
    \u2705 Waiting Time = Turnaround Time – Burst Time
    \u2705 SRTF always selects the process with minimum remaining time<\/strong><\/p>\n

    \n

    \ud83d\udce6 Summary:<\/h2>\n
      \n
    • \n

      GATE Relevance:<\/strong> Highly important topic<\/p>\n<\/li>\n

    • \n

      Common Question Format:<\/strong> Gantt chart-based, waiting time, turnaround time<\/p>\n<\/li>\n

    • \n

      Pro Tip:<\/strong> Practice SRTF with multiple process arrivals<\/p>\n<\/li>\n<\/ul>\n

      \n

      \ud83d\udce5 Want a PDF version with solved examples + practice questions?<\/h3>\n

      Just ask, and I\u2019ll generate a downloadable file or quiz for practice.<\/p>\n","protected":false},"excerpt":{"rendered":"

      Preemptive scheduling – Gate 2025 – TOC previous year solved question Paper. [fvplayer id=”310″] \ud83d\udcd8 Preemptive Scheduling \u2013 GATE 2025 | TOC Previous Year Solved Question \u2705 Topic: Operating System (OS) \u2013 Preemptive CPU Scheduling\ud83c\udfaf Exam Focus: GATE CSE \/ IT 2025\ud83d\udcc2 Category: Theory of Computation (TOC often refers to OS in GATE context when […]<\/p>\n","protected":false},"author":66,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[78],"tags":[],"class_list":["post-3232","post","type-post","status-publish","format-standard","hentry","category-operating-system"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3232","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/comments?post=3232"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3232\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3232"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3232"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3232"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}