<?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 to implement Circular Queue operations	</title>
	<atom:link href="https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/feed/" rel="self" type="application/rss+xml" />
	<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/</link>
	<description>Microcontroller projects, Circuit Diagrams, Project Ideas</description>
	<lastBuildDate>Tue, 03 Nov 2015 06:50:51 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.1.7</generator>
	<item>
		<title>
		By: sudha		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-139743</link>

		<dc:creator><![CDATA[sudha]]></dc:creator>
		<pubDate>Tue, 03 Nov 2015 06:50:51 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-139743</guid>

					<description><![CDATA[this program works for all the cases]]></description>
			<content:encoded><![CDATA[<p>this program works for all the cases</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: sudha		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-139742</link>

		<dc:creator><![CDATA[sudha]]></dc:creator>
		<pubDate>Tue, 03 Nov 2015 06:48:49 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-139742</guid>

					<description><![CDATA[#include
#include
#include
# define max 3

int front=0,rear=-1;
int cq[max],count=0;

void cqinsert()
{
int ele;

if(count==max)
{
printf(&quot;cq is full\n&quot;);
return;
}
printf(&quot;enter the element\n&quot;);
scanf(&quot;%d&quot;,&#038;ele);
rear=(rear+1)%max;
cq[rear]=ele;
count++;
}
void cqdelete()
{
if(count==0)
{
printf(&quot;cq is empty\n&quot;);
return;
}
printf(&quot;element deleted is %d&quot;,cq[front]);
front =(front+1)%max;
count--;
}
void cqdisplay()
{
int j=front,i;
if(count==0)
{
printf(&quot;cq is empty\n&quot;);
return;
}
for(i=1;i&#060;=count;i++)
{
printf(&#034;%d\t&#034;,cq[j]);
j=(j+1)%max;
}
}
void main()
{
int ch;
clrscr();
printf(&#034;1:insert 2:delete 3:display default :exit\n&#034;);
do

{
printf(&#034;enter choice\n&#034;);
scanf(&#034;%d&#034;,&#038;ch);
switch(ch)
{
case 1: cqinsert();
	 break;
case 2: cqdelete();
	 break;
case 3: cqdisplay();
	break;
case 4: exit(0);
}
}while(ch&#060;=4) ;
getch();
}]]></description>
			<content:encoded><![CDATA[<p>#include<br />
#include<br />
#include<br />
# define max 3</p>
<p>int front=0,rear=-1;<br />
int cq[max],count=0;</p>
<p>void cqinsert()<br />
{<br />
int ele;</p>
<p>if(count==max)<br />
{<br />
printf(&#8220;cq is full\n&#8221;);<br />
return;<br />
}<br />
printf(&#8220;enter the element\n&#8221;);<br />
scanf(&#8220;%d&#8221;,&amp;ele);<br />
rear=(rear+1)%max;<br />
cq[rear]=ele;<br />
count++;<br />
}<br />
void cqdelete()<br />
{<br />
if(count==0)<br />
{<br />
printf(&#8220;cq is empty\n&#8221;);<br />
return;<br />
}<br />
printf(&#8220;element deleted is %d&#8221;,cq[front]);<br />
front =(front+1)%max;<br />
count&#8211;;<br />
}<br />
void cqdisplay()<br />
{<br />
int j=front,i;<br />
if(count==0)<br />
{<br />
printf(&#8220;cq is empty\n&#8221;);<br />
return;<br />
}<br />
for(i=1;i&lt;=count;i++)<br />
{<br />
printf(&quot;%d\t&quot;,cq[j]);<br />
j=(j+1)%max;<br />
}<br />
}<br />
void main()<br />
{<br />
int ch;<br />
clrscr();<br />
printf(&quot;1:insert 2:delete 3:display default :exit\n&quot;);<br />
do</p>
<p>{<br />
printf(&quot;enter choice\n&quot;);<br />
scanf(&quot;%d&quot;,&amp;ch);<br />
switch(ch)<br />
{<br />
case 1: cqinsert();<br />
	 break;<br />
case 2: cqdelete();<br />
	 break;<br />
case 3: cqdisplay();<br />
	break;<br />
case 4: exit(0);<br />
}<br />
}while(ch&lt;=4) ;<br />
getch();<br />
}</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: anik		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-136478</link>

		<dc:creator><![CDATA[anik]]></dc:creator>
		<pubDate>Mon, 12 Oct 2015 15:15:35 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-136478</guid>

					<description><![CDATA[r u sure about &quot;getch();&quot;]]></description>
			<content:encoded><![CDATA[<p>r u sure about &#8220;getch();&#8221;</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Arkadeep Chatterjee		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-129362</link>

		<dc:creator><![CDATA[Arkadeep Chatterjee]]></dc:creator>
		<pubDate>Tue, 08 Sep 2015 05:34:23 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-129362</guid>

					<description><![CDATA[Nice program.]]></description>
			<content:encoded><![CDATA[<p>Nice program.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Monika gupta		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-128525</link>

		<dc:creator><![CDATA[Monika gupta]]></dc:creator>
		<pubDate>Fri, 04 Sep 2015 08:04:45 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-128525</guid>

					<description><![CDATA[Good and easy one..]]></description>
			<content:encoded><![CDATA[<p>Good and easy one..</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: elena		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-127958</link>

		<dc:creator><![CDATA[elena]]></dc:creator>
		<pubDate>Tue, 01 Sep 2015 16:12:47 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-127958</guid>

					<description><![CDATA[thank you so much...u are doing such a nice work helping needy student...love ur site :)]]></description>
			<content:encoded><![CDATA[<p>thank you so much&#8230;u are doing such a nice work helping needy student&#8230;love ur site 🙂</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: praveen		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-126452</link>

		<dc:creator><![CDATA[praveen]]></dc:creator>
		<pubDate>Tue, 25 Aug 2015 15:51:48 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-126452</guid>

					<description><![CDATA[I want pseudo code for the problem in data structure.... Circular queue implementation...]]></description>
			<content:encoded><![CDATA[<p>I want pseudo code for the problem in data structure&#8230;. Circular queue implementation&#8230;</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: niladri		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-118194</link>

		<dc:creator><![CDATA[niladri]]></dc:creator>
		<pubDate>Tue, 14 Jul 2015 18:49:17 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-118194</guid>

					<description><![CDATA[good implementation.. and also good logic 
thank you..]]></description>
			<content:encoded><![CDATA[<p>good implementation.. and also good logic<br />
thank you..</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: prince sharma		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-80154</link>

		<dc:creator><![CDATA[prince sharma]]></dc:creator>
		<pubDate>Sun, 08 Feb 2015 05:24:03 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-80154</guid>

					<description><![CDATA[display func will not work when u add one element in queue and thn u delete it....only one element]]></description>
			<content:encoded><![CDATA[<p>display func will not work when u add one element in queue and thn u delete it&#8230;.only one element</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jeyamaran		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-circular-queue-operations/comment-page-1/#comment-70501</link>

		<dc:creator><![CDATA[Jeyamaran]]></dc:creator>
		<pubDate>Tue, 13 Jan 2015 06:54:23 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3139#comment-70501</guid>

					<description><![CDATA[This program is very easy to understand the concepts thanks.]]></description>
			<content:encoded><![CDATA[<p>This program is very easy to understand the concepts thanks.</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
