<?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 STACK operations using Linked Lists	</title>
	<atom:link href="https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/feed/" rel="self" type="application/rss+xml" />
	<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/</link>
	<description>Microcontroller projects, Circuit Diagrams, Project Ideas</description>
	<lastBuildDate>Tue, 06 May 2014 16:50:44 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.1.7</generator>
	<item>
		<title>
		By: jagrithi		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/comment-page-1/#comment-10533</link>

		<dc:creator><![CDATA[jagrithi]]></dc:creator>
		<pubDate>Tue, 06 May 2014 16:50:44 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3311#comment-10533</guid>

					<description><![CDATA[stacks using single linked list  is clear   but it  would  be  more  better if  stacks using single  linked list to display the  give  integers in  reverse &#038; same order ,if  mentioned .]]></description>
			<content:encoded><![CDATA[<p>stacks using single linked list  is clear   but it  would  be  more  better if  stacks using single  linked list to display the  give  integers in  reverse &amp; same order ,if  mentioned .</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-stack-operations-using-linked-lists/comment-page-1/#comment-10073</link>

		<dc:creator><![CDATA[praveen]]></dc:creator>
		<pubDate>Sat, 07 Sep 2013 08:31:52 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3311#comment-10073</guid>

					<description><![CDATA[is there a overflow condition in stack , when it is implemented using linked list ? 
becoz while implementing stack using linked list , &quot;n&quot; no of nodes can b created ?]]></description>
			<content:encoded><![CDATA[<p>is there a overflow condition in stack , when it is implemented using linked list ?<br />
becoz while implementing stack using linked list , &#8220;n&#8221; no of nodes can b created ?</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Rocker		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/comment-page-1/#comment-9544</link>

		<dc:creator><![CDATA[Rocker]]></dc:creator>
		<pubDate>Tue, 26 Feb 2013 17:02:26 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3311#comment-9544</guid>

					<description><![CDATA[very good solution of stack using linked list it really helps me...thanku...]]></description>
			<content:encoded><![CDATA[<p>very good solution of stack using linked list it really helps me&#8230;thanku&#8230;</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Shan		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/comment-page-1/#comment-9180</link>

		<dc:creator><![CDATA[Shan]]></dc:creator>
		<pubDate>Sun, 11 Nov 2012 04:54:08 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3311#comment-9180</guid>

					<description><![CDATA[@vidhi: The implementation of Stack is given very clearly. It is like a single linked list with addition and deletion of nodes happening at the head. 
In case of QUEUE, the addition happens at the Tail and the insertion happens at the head.

STACK:

head
[]----&#062;[]----&#062;[]----&#062;[]


QUEUE:

head                     tail
[]----&#062;[]----&#062;[]----&#062;[]]]></description>
			<content:encoded><![CDATA[<p>@vidhi: The implementation of Stack is given very clearly. It is like a single linked list with addition and deletion of nodes happening at the head.<br />
In case of QUEUE, the addition happens at the Tail and the insertion happens at the head.</p>
<p>STACK:</p>
<p>head<br />
[]&#8212;-&gt;[]&#8212;-&gt;[]&#8212;-&gt;[]</p>
<p>QUEUE:</p>
<p>head                     tail<br />
[]&#8212;-&gt;[]&#8212;-&gt;[]&#8212;-&gt;[]</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: vidhi		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/comment-page-1/#comment-8917</link>

		<dc:creator><![CDATA[vidhi]]></dc:creator>
		<pubDate>Tue, 18 Sep 2012 09:33:16 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3311#comment-8917</guid>

					<description><![CDATA[1umae puriyala i am pavam from india]]></description>
			<content:encoded><![CDATA[<p>1umae puriyala i am pavam from india</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: vidhi		</title>
		<link>https://studentprojects.in/software-development/c-tutorials/c/data-structures-c/c-program-to-implement-stack-operations-using-linked-lists/comment-page-1/#comment-8916</link>

		<dc:creator><![CDATA[vidhi]]></dc:creator>
		<pubDate>Tue, 18 Sep 2012 09:22:33 +0000</pubDate>
		<guid isPermaLink="false">http://studentprojects.in/?p=3311#comment-8916</guid>

					<description><![CDATA[No cmnts ..]]></description>
			<content:encoded><![CDATA[<p>No cmnts ..</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
