<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: C program for Priority Scheduling</title>
	<atom:link href="http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/feed/" rel="self" type="application/rss+xml" />
	<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/</link>
	<description>...bringing innovative minds together</description>
	<lastBuildDate>Mon, 21 May 2012 08:19:10 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Raaghavee</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-7316</link>
		<dc:creator>Raaghavee</dc:creator>
		<pubDate>Sat, 21 Apr 2012 04:16:53 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-7316</guid>
		<description>Hi...
I want the code for preemptive priority scheduling algorithm using linked list(i.e., using structure) which includes arrival time for each process.. 
can anyone please post it if u have ASAP?</description>
		<content:encoded><![CDATA[<p>Hi&#8230;<br />
I want the code for preemptive priority scheduling algorithm using linked list(i.e., using structure) which includes arrival time for each process..<br />
can anyone please post it if u have ASAP?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sara</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-7221</link>
		<dc:creator>sara</dc:creator>
		<pubDate>Tue, 03 Apr 2012 04:25:32 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-7221</guid>
		<description>Hello!!

Thank you for your help. I actually am building a simulator that takes processes which has 2 CPU&#039;s and swaps them out after regular intervals. It uses fcfs and round robin algorithms, please can you help me with that.</description>
		<content:encoded><![CDATA[<p>Hello!!</p>
<p>Thank you for your help. I actually am building a simulator that takes processes which has 2 CPU&#8217;s and swaps them out after regular intervals. It uses fcfs and round robin algorithms, please can you help me with that.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: suneel</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-7095</link>
		<dc:creator>suneel</dc:creator>
		<pubDate>Wed, 14 Mar 2012 09:38:42 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-7095</guid>
		<description>plz post preemptive code in c language</description>
		<content:encoded><![CDATA[<p>plz post preemptive code in c language</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sweety Shinde</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-7013</link>
		<dc:creator>Sweety Shinde</dc:creator>
		<pubDate>Tue, 28 Feb 2012 09:04:25 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-7013</guid>
		<description>plz post preemptive code(not non preemptive) for all type of scheduling.....
hurry up..............plzzzz........:)</description>
		<content:encoded><![CDATA[<p>plz post preemptive code(not non preemptive) for all type of scheduling&#8230;..<br />
hurry up&#8230;&#8230;&#8230;&#8230;..plzzzz&#8230;&#8230;..:)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sweety</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-7012</link>
		<dc:creator>Sweety</dc:creator>
		<pubDate>Tue, 28 Feb 2012 09:01:48 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-7012</guid>
		<description>can any body give the source code of preemptive sjf (not non preemptive) as soon as possible… . . . 
plzzzzzzzz....................</description>
		<content:encoded><![CDATA[<p>can any body give the source code of preemptive sjf (not non preemptive) as soon as possible… . . .<br />
plzzzzzzzz&#8230;&#8230;&#8230;&#8230;&#8230;&#8230;..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: rani</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-6771</link>
		<dc:creator>rani</dc:creator>
		<pubDate>Tue, 31 Jan 2012 09:46:54 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-6771</guid>
		<description>// non preemitive algorithm


#include
#include
	void main()
	{
		int n,p[10],b[10],i,j,temp,temp1,pr[10],q[10];
		float c,s=0.0;
		clrscr();
		printf(“Enter the no. of process\n”);
		scanf(“%d”,&amp;n);
		printf(“Enter processes\n”);
		for(i=0;i&lt;n;i++)
		{
			scanf(&quot;%d&quot;,&amp;p[i]);
		}
		printf(&quot;Enter brust time\n&quot;);
		for(i=0;i&lt;n;i++)
		{
			scanf(&quot;%d&quot;,&amp;b[i]);
		}
		printf(&quot;Enter the priority\n&quot;);
		for(i=0;i&lt;n;i++)
		{
			scanf(&quot;%d&quot;,&amp;pr[i]);
		}
		for(i=0;i&lt;n;i++)
		{
			for(j=1;j&lt;n;j++)
			{
				temp=pr[i];
				temp1=p[i];
				pr[i]=pr[j];
				p[i]=p[j];
				pr[j]=temp;
				p[j]=temp1;
			}
		}
		for(i=0;i&lt;n;i++)
		{
			printf(&quot;process is %d and it&#039;s Priority is %d\n&quot;,p[i],pr[i]);
		}
		p[0]=0;
		for(i=0;i&lt;n;i++)
		{
			p[i+1]=p[i]+b[i];
			printf(&quot;Waiting time=%d\n&quot;,p[i]);
		}
		for(i=0;i&lt;n;i++)
		{
			s=s+p[i];
		}
		c=s/n;
		printf(&quot;Average waiting time=%f&quot;,c);
		getch();
	}</description>
		<content:encoded><![CDATA[<p>// non preemitive algorithm</p>
<p>#include<br />
#include<br />
	void main()<br />
	{<br />
		int n,p[10],b[10],i,j,temp,temp1,pr[10],q[10];<br />
		float c,s=0.0;<br />
		clrscr();<br />
		printf(“Enter the no. of process\n”);<br />
		scanf(“%d”,&amp;n);<br />
		printf(“Enter processes\n”);<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			scanf(&quot;%d&quot;,&amp;p[i]);<br />
		}<br />
		printf(&quot;Enter brust time\n&quot;);<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			scanf(&quot;%d&quot;,&amp;b[i]);<br />
		}<br />
		printf(&quot;Enter the priority\n&quot;);<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			scanf(&quot;%d&quot;,&amp;pr[i]);<br />
		}<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			for(j=1;j&lt;n;j++)<br />
			{<br />
				temp=pr[i];<br />
				temp1=p[i];<br />
				pr[i]=pr[j];<br />
				p[i]=p[j];<br />
				pr[j]=temp;<br />
				p[j]=temp1;<br />
			}<br />
		}<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			printf(&quot;process is %d and it&#039;s Priority is %d\n&quot;,p[i],pr[i]);<br />
		}<br />
		p[0]=0;<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			p[i+1]=p[i]+b[i];<br />
			printf(&quot;Waiting time=%d\n&quot;,p[i]);<br />
		}<br />
		for(i=0;i&lt;n;i++)<br />
		{<br />
			s=s+p[i];<br />
		}<br />
		c=s/n;<br />
		printf(&quot;Average waiting time=%f&quot;,c);<br />
		getch();<br />
	}</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jaya pandey</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-6716</link>
		<dc:creator>jaya pandey</dc:creator>
		<pubDate>Wed, 25 Jan 2012 09:24:29 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-6716</guid>
		<description>kal mera birthday hai........</description>
		<content:encoded><![CDATA[<p>kal mera birthday hai&#8230;&#8230;..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anish kamadana</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-6604</link>
		<dc:creator>anish kamadana</dc:creator>
		<pubDate>Mon, 09 Jan 2012 10:09:47 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-6604</guid>
		<description>chaaaaaaaa</description>
		<content:encoded><![CDATA[<p>chaaaaaaaa</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: honey</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-6459</link>
		<dc:creator>honey</dc:creator>
		<pubDate>Wed, 21 Dec 2011 17:26:41 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-6459</guid>
		<description>i want simple code for sjf preemptive</description>
		<content:encoded><![CDATA[<p>i want simple code for sjf preemptive</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Randhir Singh</title>
		<link>http://electrofriends.com/source-codes/software-programs/c/c-advanced-programs/c-program-for-priority-scheduling/comment-page-1/#comment-6296</link>
		<dc:creator>Randhir Singh</dc:creator>
		<pubDate>Wed, 30 Nov 2011 18:55:55 +0000</pubDate>
		<guid isPermaLink="false">http://electrofriends.com/?p=1122#comment-6296</guid>
		<description>#include
#include
void main()
{
int n,p[10],b[10],i,j,temp,temp1,pr[10],q[10];
float c,s=0.0;
clrscr();
printf(&quot;Enter the no. of process\n&quot;);
scanf(&quot;%d&quot;,&amp;n);
printf(&quot;Enter processes\n&quot;);
for(i=0;i&lt;n;i++)
{
scanf(&quot;%d&quot;,&amp;p[i]);
}
printf(&quot;Enter brust time\n&quot;);
for(i=0;i&lt;n;i++)
{
scanf(&quot;%d&quot;,&amp;b[i]);
}
printf(&quot;Enter the priority\n&quot;);
for(i=0;i&lt;n;i++)
{
scanf(&quot;%d&quot;,&amp;pr[i]);
}
for(i=0;i&lt;n;i++)
{
for(j=1;j&lt;n;j++)
{
temp=pr[i];
temp1=p[i];
pr[i]=pr[j];
p[i]=p[j];
pr[j]=temp;
p[j]=temp1;
}
}
for(i=0;i&lt;n;i++)
{
printf(&quot;process is %d and it&#039;s Priority is %d\n&quot;,p[i],pr[i]);
}
p[0]=0;
for(i=0;i&lt;n;i++)
{
p[i+1]=p[i]+b[i];
printf(&quot;Waiting time=%d\n&quot;,p[i]);
}
for(i=0;i&lt;n;i++)
{
s=s+p[i];
}
c=s/n;
printf(&quot;Average waiting time=%f&quot;,c);
getch();</description>
		<content:encoded><![CDATA[<p>#include<br />
#include<br />
void main()<br />
{<br />
int n,p[10],b[10],i,j,temp,temp1,pr[10],q[10];<br />
float c,s=0.0;<br />
clrscr();<br />
printf(&#8220;Enter the no. of process\n&#8221;);<br />
scanf(&#8220;%d&#8221;,&amp;n);<br />
printf(&#8220;Enter processes\n&#8221;);<br />
for(i=0;i&lt;n;i++)<br />
{<br />
scanf(&quot;%d&quot;,&amp;p[i]);<br />
}<br />
printf(&quot;Enter brust time\n&quot;);<br />
for(i=0;i&lt;n;i++)<br />
{<br />
scanf(&quot;%d&quot;,&amp;b[i]);<br />
}<br />
printf(&quot;Enter the priority\n&quot;);<br />
for(i=0;i&lt;n;i++)<br />
{<br />
scanf(&quot;%d&quot;,&amp;pr[i]);<br />
}<br />
for(i=0;i&lt;n;i++)<br />
{<br />
for(j=1;j&lt;n;j++)<br />
{<br />
temp=pr[i];<br />
temp1=p[i];<br />
pr[i]=pr[j];<br />
p[i]=p[j];<br />
pr[j]=temp;<br />
p[j]=temp1;<br />
}<br />
}<br />
for(i=0;i&lt;n;i++)<br />
{<br />
printf(&quot;process is %d and it&#039;s Priority is %d\n&quot;,p[i],pr[i]);<br />
}<br />
p[0]=0;<br />
for(i=0;i&lt;n;i++)<br />
{<br />
p[i+1]=p[i]+b[i];<br />
printf(&quot;Waiting time=%d\n&quot;,p[i]);<br />
}<br />
for(i=0;i&lt;n;i++)<br />
{<br />
s=s+p[i];<br />
}<br />
c=s/n;<br />
printf(&quot;Average waiting time=%f&quot;,c);<br />
getch();</p>
]]></content:encoded>
	</item>
</channel>
</rss>

