<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>ITUCU &#187; C Programming</title>
	<atom:link href="http://churmura.com/tag/c-programming/feed/" rel="self" type="application/rss+xml" />
	<link>http://churmura.com</link>
	<description>Info That You Can Use</description>
	<lastBuildDate>Fri, 03 Feb 2012 04:38:17 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Merge Sort implementation in C</title>
		<link>http://churmura.com/general/merge-sort-implementation-in-c/9476/</link>
		<comments>http://churmura.com/general/merge-sort-implementation-in-c/9476/#comments</comments>
		<pubDate>Thu, 05 Jul 2007 12:05:00 +0000</pubDate>
		<dc:creator>aamer</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[C Programming]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=38</guid>
		<description><![CDATA[Merging is the process of combining two or more sorted arrays into a third sorted array. We can use this technique to sort an array of n elements as follows. Divide the array into ‘n’ sub arrays of size 1 and merge adjacent pairs of sub arrays. Then we can have approximately n/2 sorted sub [...]]]></description>
		<wfw:commentRss>http://churmura.com/general/merge-sort-implementation-in-c/9476/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Circular Queue Data Structure with implementation in C</title>
		<link>http://churmura.com/general/circular-queue-data-structure-with-implementation-in-c/9475/</link>
		<comments>http://churmura.com/general/circular-queue-data-structure-with-implementation-in-c/9475/#comments</comments>
		<pubDate>Thu, 05 Jul 2007 12:04:00 +0000</pubDate>
		<dc:creator>aamer</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[C Programming]]></category>
		<category><![CDATA[Circular Queue]]></category>
		<category><![CDATA[Data Structure]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=37</guid>
		<description><![CDATA[A circular queue is a Queue but a particular implementation of a queue. It is very efficient. It is also quite useful in low level code, because insertion and deletion are totally independant, which means that you don&#8217;t have to worry about an interrupt handler trying to do an insertion at the same time as [...]]]></description>
		<wfw:commentRss>http://churmura.com/general/circular-queue-data-structure-with-implementation-in-c/9475/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Stacks Data Structure with implementation in C</title>
		<link>http://churmura.com/general/stacks-data-structure-with-implementation-in-c/9473/</link>
		<comments>http://churmura.com/general/stacks-data-structure-with-implementation-in-c/9473/#comments</comments>
		<pubDate>Thu, 05 Jul 2007 10:46:00 +0000</pubDate>
		<dc:creator>aamer</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[C Programming]]></category>
		<category><![CDATA[Data Structure]]></category>
		<category><![CDATA[Stack]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=35</guid>
		<description><![CDATA[One way to think about this implementation is to think of functions as being stacked on top of each other; the last one added to the stack is the first one taken off. In this way, the data structure itself enforces the proper order of calls. Conceptually, a stack is simple: a data structure that [...]]]></description>
		<wfw:commentRss>http://churmura.com/general/stacks-data-structure-with-implementation-in-c/9473/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Using Files In C Programming</title>
		<link>http://churmura.com/general/using-files-in-c-programming/9472/</link>
		<comments>http://churmura.com/general/using-files-in-c-programming/9472/#comments</comments>
		<pubDate>Thu, 05 Jul 2007 10:44:00 +0000</pubDate>
		<dc:creator>aamer</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[C Programming]]></category>
		<category><![CDATA[Files]]></category>

		<guid isPermaLink="false">http://localhost/wordpress/?p=34</guid>
		<description><![CDATA[This is a C program on file Handling /************** File Handling *************/ void main() { FILE *file1; char c; int choice; char op; clrscr(); do { printf(&#8220;\t\tMenu\n\t1. Enter The Information\n\t2. Display The Information\n&#8221;); scanf(&#8220;%d&#8221;,&#038;choice); switch(choice) { case 1: printf(&#8220;\n Information \n&#8221;); file1=fopen(&#8220;Handlin.doc&#8221;,&#8221;w&#8221;); while((c=getchar())!=EOF) { putc(c,file1); } fclose(file1); break; case 2: printf(&#8220;Information\n&#8221;); printf(&#8220;Result :&#8221;); file1=fopen(&#8220;Malcolm .doc&#8221;,&#8221;r&#8221;); [...]]]></description>
		<wfw:commentRss>http://churmura.com/general/using-files-in-c-programming/9472/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

