{"id":28896,"date":"2023-01-04T06:40:11","date_gmt":"2023-01-04T01:10:11","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/"},"modified":"2023-01-04T06:40:11","modified_gmt":"2023-01-04T01:10:11","slug":"solved-non-preemptive-priority-scheduling","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/","title":{"rendered":"[Solved] Non-Preemptive priority scheduling"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-65289297\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"65289297\" data-parentid=\"65183356\" data-score=\"0\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>The correct code is:<\/p>\n<pre><code>#include &lt;stdlib.h&gt;\n#include &lt;stdio.h&gt;\n\n\nvoid main()\n{\n\n    int pn = 0;                 \/\/Processes Number\n    int CPU = 0;            \/\/CPU Current time\n    int allTime = 0;        \/\/ Time neded to finish all processes\n    printf(\"Enrer Processes Count: \");\n    scanf(\"%d\",&amp;pn);\n    int AT[pn];\n    int ATt[pn];\n    int NoP = pn;\n    int PT[pn];             \/\/Processes Time\n    int PP[pn];             \/\/Processes piriorty\n    int PPt[pn];\n    int waittingTime[pn];\n    int turnaroundTime[pn];\n    int i=0;\n    \/\/Scanning Time and Piriorty\n    for(i=0 ;i&lt;pn ;i++){\n        printf(\"\\nProcessing time for P%d: \",i+1);\n        scanf(\"%d\",&amp;PT[i]);\n        printf(\"Piriorty for P%d: \",i+1);\n        scanf(\"%d\",&amp;PP[i]);\n        PPt[i] = PP[i];\n        printf(\"Arrival Time for P%d: \",i+1);\n        scanf(\"%d\",&amp;AT[i]);\n        ATt[i] = AT[i];\n    }\n\n\n\n\n    int LAT = 0;        \/\/LastArrivalTime\n    for(i = 0; i &lt; pn; i++)\n        if(AT[i] &gt; LAT)\n            LAT = AT[i];\n\n    int MAX_P = 0;        \/\/Max Piriorty\n    for(i = 0; i &lt; pn; i++)\n        if(PPt[i] &gt; MAX_P)\n            MAX_P = PPt[i];\n\n\n\n\n    int ATi = 0;        \/\/Pointing to Arrival Time indix\n    int P1 = PPt[0];     \/\/Pointing to 1st piriorty Value\n    int P2 = PPt[0];     \/\/Pointing to 2nd piriorty Value\n\n\n    \/\/findding the First Arrival Time and Highst piriorty Process\n    int j = -1;\n    while(NoP &gt; 0 &amp;&amp; CPU &lt;= 1000){\n        for(i = 0; i &lt; pn; i++){\n            if((ATt[i] &lt;= CPU) &amp;&amp; (ATt[i] != (LAT+10))){\n                if(PPt[i] != (MAX_P+1)){\n                    P2 = PPt[i];\n                    j= 1;\n\n                    if(P2 &lt; P1){\n                        j= 1;\n                        ATi = i;\n                        P1 = PPt[i];\n                        P2 = PPt[i];\n                    }\n                }\n            }\n        }\n\n        if(j == -1){\n            CPU = CPU+1;\n            continue;\n        }else{\n\n\n            waittingTime[ATi] = CPU - ATt[ATi];\n            CPU = CPU + PT[ATi];\n            turnaroundTime[ATi] = CPU - ATt[ATi];\n            ATt[ATi] = LAT +10;\n            j = -1;\n            PPt[ATi] = MAX_P + 1;\n            ATi = 0;        \/\/Pointing to Arrival Time indix\n            P1 = MAX_P+1;     \/\/Pointing to 1st piriorty Value\n            P2 = MAX_P+1;     \/\/Pointing to 2nd piriorty Value\n            NoP = NoP - 1;\n\n        }\n\n\n\n\n    }\n\n\n\n    printf(\"\\nPN\\tPT\\tPP\\tAT\\tWT\\tTT\\n\\n\");\n    for(i = 0; i &lt; pn; i++){\n       printf(\"P%d\\t%d\\t%d\\t%d\\t%d\\t%d\\n\",i+1,PT[i],PP[i],AT[i],waittingTime[i],turnaroundTime[i]);\n    }\n\n    int AvgWT = 0;\n    int AVGTaT = 0;\n    for(i = 0; i &lt; pn; i++){\n        AvgWT = waittingTime[i] + AvgWT;\n        AVGTaT = turnaroundTime[i] + AVGTaT;\n    }\n\n\n   printf(\"AvgWaittingTime = %d\\nAvgTurnaroundTime = %d\\n\",AvgWT\/pn,AVGTaT\/pn);\n\n}\n\n\n\n\/*\nTest Cases:\nPT: Processing Time\nPP: Process priority\nWT Waitting Time\nTaT: Turnaround Time\nArrival time for 1st 2 cases is 0\n\nPN      PT      PP      WT      TaT\n\nP1      10      3       6       16\nP2      1       1       0       1\nP3      2       4       16      18\nP4      1       5       18      19\nP5      5       2       1       6\n\n\nPN      PT      PP      WT      TaT\n\nP1      1       1       0       1\nP2      2       2       1       3\nP3      3       3       3       6\nP4      4       4       6       10\nP5      5       5       10      15\n\n\n\nPN      PT      PP      AT      WT      TT\n\nP1      3       2       0       0       3\nP2      5       6       2       11      16\nP3      4       3       1       2       6\nP4      2       5       4       7       9\nP5      9       7       6       12      21\nP6      4       4       5       2       6\nP7      10      10      7       20      30\n\n\n\nPN      PT      PP      AT      WT      TT\n\nP1      4       2       0       0       4\nP2      3       3       1       3       6\nP3      1       4       2       5       6\nP4      5       5       3       5       10\nP5      2       5       4       9       11\n\n*\/```\n<\/code><\/pre>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\"><\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved Non-Preemptive priority scheduling <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] The correct code is: #include &lt;stdlib.h&gt; #include &lt;stdio.h&gt; void main() { int pn = 0; \/\/Processes Number int CPU = 0; \/\/CPU Current time int allTime = 0; \/\/ Time neded to finish all processes printf(&#8220;Enrer Processes Count: &#8220;); scanf(&#8220;%d&#8221;,&amp;pn); int AT[pn]; int ATt[pn]; int NoP = pn; int PT[pn]; \/\/Processes Time int PP[pn]; &#8230; <a title=\"[Solved] Non-Preemptive priority scheduling\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\" aria-label=\"More on [Solved] Non-Preemptive priority scheduling\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[457,324,1384],"class_list":["post-28896","post","type-post","status-publish","format-standard","hentry","category-solved","tag-algorithm","tag-c","tag-cpu"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] Non-Preemptive priority scheduling - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Non-Preemptive priority scheduling - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] The correct code is: #include &lt;stdlib.h&gt; #include &lt;stdio.h&gt; void main() { int pn = 0; \/\/Processes Number int CPU = 0; \/\/CPU Current time int allTime = 0; \/\/ Time neded to finish all processes printf(&quot;Enrer Processes Count: &quot;); scanf(&quot;%d&quot;,&amp;pn); int AT[pn]; int ATt[pn]; int NoP = pn; int PT[pn]; \/\/Processes Time int PP[pn]; ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2023-01-04T01:10:11+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Non-Preemptive priority scheduling\",\"datePublished\":\"2023-01-04T01:10:11+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\"},\"wordCount\":14,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"algorithm\",\"c++\",\"cpu\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\",\"name\":\"[Solved] Non-Preemptive priority scheduling - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2023-01-04T01:10:11+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Non-Preemptive priority scheduling\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Non-Preemptive priority scheduling - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Non-Preemptive priority scheduling - JassWeb","og_description":"[ad_1] The correct code is: #include &lt;stdlib.h&gt; #include &lt;stdio.h&gt; void main() { int pn = 0; \/\/Processes Number int CPU = 0; \/\/CPU Current time int allTime = 0; \/\/ Time neded to finish all processes printf(\"Enrer Processes Count: \"); scanf(\"%d\",&amp;pn); int AT[pn]; int ATt[pn]; int NoP = pn; int PT[pn]; \/\/Processes Time int PP[pn]; ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/","og_site_name":"JassWeb","article_published_time":"2023-01-04T01:10:11+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Non-Preemptive priority scheduling","datePublished":"2023-01-04T01:10:11+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/"},"wordCount":14,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["algorithm","c++","cpu"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/","url":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/","name":"[Solved] Non-Preemptive priority scheduling - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2023-01-04T01:10:11+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-non-preemptive-priority-scheduling\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Non-Preemptive priority scheduling"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/28896","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=28896"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/28896\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=28896"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=28896"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=28896"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}