<?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 Circular QUEUE Operations – using Array	</title>
	<atom:link href="https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/feed/" rel="self" type="application/rss+xml" />
	<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/</link>
	<description>Microcontroller projects, Circuit Diagrams, Project Ideas</description>
	<lastBuildDate>Wed, 01 Apr 2015 03:21:07 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.1.7</generator>
	<item>
		<title>
		By: rajarshi sen		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-93814</link>

		<dc:creator><![CDATA[rajarshi sen]]></dc:creator>
		<pubDate>Wed, 01 Apr 2015 03:21:07 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3306#comment-93814</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-93558&quot;&gt;rajarshi sen&lt;/a&gt;.

solved::
printf(&quot;\nYour Que is: front-&#062;&quot;);
    for(i=front; ; i=(i+1)%max){
        printf(&quot; %d&quot;, que[i]);
        if(i==rear)break;
    }
    printf(&quot; &#060;-rear\n&#034;);]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-93558">rajarshi sen</a>.</p>
<p>solved::<br />
printf(&#8220;\nYour Que is: front-&gt;&#8221;);<br />
    for(i=front; ; i=(i+1)%max){<br />
        printf(&#8221; %d&#8221;, que[i]);<br />
        if(i==rear)break;<br />
    }<br />
    printf(&#8221; &lt;-rear\n&quot;);</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: rajarshi sen		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-93558</link>

		<dc:creator><![CDATA[rajarshi sen]]></dc:creator>
		<pubDate>Tue, 31 Mar 2015 03:59:31 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3306#comment-93558</guid>

					<description><![CDATA[i got a problem with the display function:
1. when there is only one element in the Queue, as in(f==r)..the loop wont run since(i=f; i!=r....)
2. this loop wont print the last element anyway, because the loop is meant to stop at i=r..hence not printing the last element (full or not)!
Pls help(:facing the same problem here:)
Thank You!]]></description>
			<content:encoded><![CDATA[<p>i got a problem with the display function:<br />
1. when there is only one element in the Queue, as in(f==r)..the loop wont run since(i=f; i!=r&#8230;.)<br />
2. this loop wont print the last element anyway, because the loop is meant to stop at i=r..hence not printing the last element (full or not)!<br />
Pls help(:facing the same problem here:)<br />
Thank You!</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Suramrit Singh		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-70226</link>

		<dc:creator><![CDATA[Suramrit Singh]]></dc:creator>
		<pubDate>Mon, 12 Jan 2015 13:17:49 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3306#comment-70226</guid>

					<description><![CDATA[The only correct working example from many so called &#039;programming&#039; websites.. ThanQ]]></description>
			<content:encoded><![CDATA[<p>The only correct working example from many so called &#8216;programming&#8217; websites.. ThanQ</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: asdf		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-10080</link>

		<dc:creator><![CDATA[asdf]]></dc:creator>
		<pubDate>Mon, 09 Sep 2013 06:13:16 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3306#comment-10080</guid>

					<description><![CDATA[prfect]]></description>
			<content:encoded><![CDATA[<p>prfect</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Rakesh R		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-for-circular-queue-operations-using-array/comment-page-1/#comment-8962</link>

		<dc:creator><![CDATA[Rakesh R]]></dc:creator>
		<pubDate>Tue, 25 Sep 2012 17:19:22 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3306#comment-8962</guid>

					<description><![CDATA[Thank u very much !!!!!!!!!!!! its working perfectly!!!!!!!!!!!!!]]></description>
			<content:encoded><![CDATA[<p>Thank u very much !!!!!!!!!!!! its working perfectly!!!!!!!!!!!!!</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
