<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2enclosuresfull.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/" xmlns:georss="http://www.georss.org/georss" xmlns:media="http://search.yahoo.com/mrss/" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" version="2.0"><channel><atom:id>tag:blogger.com,1999:blog-7092135066960371093</atom:id><lastBuildDate>Mon, 09 Nov 2009 15:52:41 +0000</lastBuildDate><title>C Tutor...</title><description>Biggest Collection of C &amp;amp; C++ Programs, Assignments and projects.
From Basic C Programs like if,for, while &amp;amp; arrays  to pointers, Link List,Data structure, Classes &amp;amp; Objects, File Management, inheritance,polymorphism &amp;amp; Many More Every Program will you find hear..</description><link>http://lernc.blogspot.com/</link><managingEditor>infocomputers108@gmail.com (Pankaj A.Hingade)</managingEditor><generator>Blogger</generator><openSearch:totalResults>503</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><media:copyright>© Info Groups..</media:copyright><media:category scheme="http://www.itunes.com/dtds/podcast-1.0.dtd">Education/Language Courses</media:category><itunes:owner><itunes:email>infocomputers108@gmail.com</itunes:email><itunes:name>pankaj a.h.</itunes:name></itunes:owner><itunes:author>pankaj a.h.</itunes:author><itunes:explicit>no</itunes:explicit><itunes:subtitle>Life is Good</itunes:subtitle><itunes:summary>Biggest Collection of C &amp;amp; C++ Programs, Assignments and projects. From Basic C Programs like if,for, while &amp;amp; arrays to pointers, Link List,Data structure, Classes &amp;amp; Objects, File Management, inheritance,polymorphism &amp;amp; Many More Every Program will you find hear..</itunes:summary><itunes:category text="Education"><itunes:category text="Language Courses" /></itunes:category><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" href="http://feeds.feedburner.com/blogspot/EpVq" type="application/rss+xml" /><feedburner:emailServiceId>blogspot/EpVq</feedburner:emailServiceId><feedburner:feedburnerHostname>http://feedburner.google.com</feedburner:feedburnerHostname><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com" /><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-2143378704245789921</guid><pubDate>Fri, 06 Nov 2009 14:53:00 +0000</pubDate><atom:updated>2009-11-06T06:55:59.206-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to determine the given input is a capital letter, small letter, digit or special symbol.</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana;"&gt;&lt;span style="font-size:180%;"&gt;Program to determine the given input is a capital letter, small letter, digit or special symbol.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; char ch;&lt;br /&gt;&lt;br /&gt; printf( "\nEnter a character : " );&lt;br /&gt; scanf("%c", &amp;amp;ch);&lt;br /&gt;&lt;br /&gt;&lt;br /&gt; if(ch &gt;= 'A' &amp;amp;&amp;amp; ch &lt;= 'Z')      /* Capital Letter */  &lt;br /&gt;{   &lt;br /&gt;printf( "\nCapital Letter" );  &lt;br /&gt;}  &lt;br /&gt;else if(ch &gt;= 'a' &amp;amp;&amp;amp; ch &lt;= 'z') /* Small Letter */  &lt;br /&gt;{   &lt;br /&gt;printf( "\nSmall Letter" );  &lt;br /&gt;}  &lt;br /&gt;else if(ch &gt;= '0' &amp;amp;&amp;amp; ch &lt;= '9')  /* Digit */  &lt;br /&gt;{   &lt;br /&gt;printf( "\nDigit" );  &lt;br /&gt;}  &lt;br /&gt;else  &lt;br /&gt;{   &lt;br /&gt;printf( "\nSpecial Symbol" );  &lt;br /&gt;}    &lt;br /&gt;return 0;&lt;br /&gt;}      &lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-2143378704245789921?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/FuQsVdg4MwY" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/FuQsVdg4MwY/program-to-determine-given-input-is.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-determine-given-input-is.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-5576981696103413672</guid><pubDate>Fri, 06 Nov 2009 14:49:00 +0000</pubDate><atom:updated>2009-11-06T06:51:47.129-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>A program to implement the binary search algorithm</title><description>&lt;div style="text-align: center; font-family: verdana; font-weight: bold;"&gt;&lt;span style="font-size:180%;"&gt;A program to implement the binary search algorithm.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;void binary_search(const int *, const int, const int);&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;  int arr[1000], i, v, cnt;&lt;br /&gt;&lt;br /&gt;  /* Store the values in the array */&lt;br /&gt;  for( i = 0; i &lt; found =" 0;" fi="first" mi="milldle,li=" n =" 0;" fi =" 0;" li =" sz"&gt; p[li])&lt;br /&gt;  {&lt;br /&gt;      printf( "\n%d not found in the array", val);&lt;br /&gt;      printf( "\nNo of attempts = 1" );&lt;br /&gt;  }&lt;br /&gt;  else&lt;br /&gt;  {&lt;br /&gt;      printf( "\nAttempts\tFirst index\tLast index\tMiddle index\tarr[mi]" );&lt;br /&gt;      while(1)&lt;br /&gt;      {&lt;br /&gt;          n++;&lt;br /&gt;          /* Calculate middle index */&lt;br /&gt;          mi = (fi + li) / 2;&lt;br /&gt;&lt;br /&gt;          if( mi == fi || mi == li )&lt;br /&gt;              break; /* Processing complete */&lt;br /&gt;&lt;br /&gt;          printf( "\n\t%d\t%d\t\t%d\t\t%d\t\t%d", n, fi, li, mi, p[mi] );&lt;br /&gt;          if(val == p[mi] )&lt;br /&gt;          {&lt;br /&gt;              found = 1;&lt;br /&gt;              break;&lt;br /&gt;          }&lt;br /&gt;&lt;br /&gt;          if(val &lt; li =" mi;"&gt; p[mi])&lt;br /&gt;          {&lt;br /&gt;              fi = mi;&lt;br /&gt;              continue;&lt;br /&gt;          }&lt;br /&gt;      }  /*End of while loop */&lt;br /&gt;      if(found)&lt;br /&gt;      {&lt;br /&gt;          printf( "\n%d found in the array", val);&lt;br /&gt;          printf( "\nNo of attempts = %d", n );&lt;br /&gt;      }&lt;br /&gt;      else&lt;br /&gt;      {&lt;br /&gt;          printf( "\n%d NOT found in the array", val);&lt;br /&gt;          printf( "\nNo of attempts = %d", n );&lt;br /&gt;      }&lt;br /&gt;  } /*End of else */&lt;br /&gt;}&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-5576981696103413672?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/j-YKasl3eTE" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/j-YKasl3eTE/program-to-implement-binary-search.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-implement-binary-search.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-4368787906440983447</guid><pubDate>Fri, 06 Nov 2009 14:45:00 +0000</pubDate><atom:updated>2009-11-06T06:49:27.153-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Understanding the concept of code blocks</title><description>&lt;div style="text-align: center;"&gt;&lt;span style="font-size:180%;"&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;Understanding the concept of code blocks.&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;/pre&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;  int num = 100;&lt;br /&gt;&lt;br /&gt;  {                        // beginning of a code block&lt;br /&gt;      int var = 200;      // local variable of this block&lt;br /&gt;&lt;br /&gt;      /* inner block or nested block can access variable&lt;br /&gt;      declared in the    outer block */&lt;br /&gt;      printf("\nInner block 1: num = %d var = %d", num, var);&lt;br /&gt;&lt;br /&gt;      // char ch;            // error! In C variable declarations should&lt;br /&gt;                          // appear at the top of the block&lt;br /&gt;  }                        // end of a code block&lt;br /&gt;&lt;br /&gt;   // var = 300;                // error! var is not accessible here&lt;br /&gt;&lt;br /&gt;  {&lt;br /&gt;      /* variable declared in an inner block can have the same&lt;br /&gt;      name as that declared in an outer block */&lt;br /&gt;&lt;br /&gt;      int num = 500;&lt;br /&gt;&lt;br /&gt;      printf("\nInner block 2: num = %d", num);&lt;br /&gt;  }&lt;br /&gt;&lt;br /&gt;  printf("\nOuter block : num = %d", num);&lt;br /&gt;&lt;br /&gt;  return 0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-4368787906440983447?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/o8a9jeesgj8" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/o8a9jeesgj8/understanding-concept-of-code-blocks.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/understanding-concept-of-code-blocks.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-2436286017523763906</guid><pubDate>Fri, 06 Nov 2009 14:43:00 +0000</pubDate><atom:updated>2009-11-06T06:45:01.551-08:00</atom:updated><title>Program to show Study of bitwise operators.</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana;"&gt;&lt;span style="font-size:180%;"&gt;Program to show Study of bitwise operators.&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;   unsigned int n = 2;&lt;br /&gt;&lt;br /&gt;   printf( "\nn      = %u", n );&lt;br /&gt;   printf( "\nn &lt;&lt; 2 = %u", n &lt;&lt; 2 );    &lt;br /&gt;printf( "\nn &gt;&gt; 2 = %u", n &gt;&gt; 2 );&lt;br /&gt;   printf( "\nn &amp;amp; 3  = %u", n &amp;amp; 3 );&lt;br /&gt;   printf( "\nn | 3  = %u", n | 3 );&lt;br /&gt;   printf( "\nn ^ 3  = %u", n ^ 3 );&lt;br /&gt;   printf( "\n~n     = %u", ~n );&lt;br /&gt;&lt;br /&gt;   return 0;&lt;br /&gt;}&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-2436286017523763906?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/ZHvo663S4Y0" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/ZHvo663S4Y0/program-to-show-study-of-bitwise.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-show-study-of-bitwise.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-7728253465486266465</guid><pubDate>Fri, 06 Nov 2009 14:35:00 +0000</pubDate><atom:updated>2009-11-06T06:37:32.722-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to Find the length of a given string.</title><description>&lt;div style="text-align: center; font-family: verdana; font-weight: bold;"&gt;&lt;span style="font-size:180%;"&gt;Program to Find the length of a given string.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;   char str[80];&lt;br /&gt;   int len;&lt;br /&gt;&lt;br /&gt;   printf("\nEnter a string : ");&lt;br /&gt;   gets(str);&lt;br /&gt;&lt;br /&gt;   for(len = 0 ; str[len] != '\0' ; len++)&lt;br /&gt;&lt;br /&gt;   printf("\nLength of the string is %d", len);&lt;br /&gt;&lt;br /&gt;   return 0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-7728253465486266465?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/47YldhhRZm8" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/47YldhhRZm8/program-to-find-length-of-given-string.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-find-length-of-given-string.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-826340585047027094</guid><pubDate>Fri, 06 Nov 2009 14:32:00 +0000</pubDate><atom:updated>2009-11-06T06:35:02.744-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to find a ASCII value of the given char.</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana;"&gt;&lt;span style="font-size:180%;"&gt;Program to find a ASCII value of the given char&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;   char ch;&lt;br /&gt;&lt;br /&gt;   printf("\nEnter a character : ");&lt;br /&gt;   scanf("%c", &amp;amp;ch);&lt;br /&gt;&lt;br /&gt;   printf("\nCharacter = %c  ASCII Value = %d", ch, ch);&lt;br /&gt;&lt;br /&gt;   return 0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-826340585047027094?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/sUYM2qwjxBo" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/sUYM2qwjxBo/program-to-find-ascii-value-of-given.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-find-ascii-value-of-given.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-8532628788146178741</guid><pubDate>Fri, 06 Nov 2009 14:30:00 +0000</pubDate><atom:updated>2009-11-06T06:32:11.443-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to store a list by using 2D arrays</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana; color: rgb(0, 0, 153);"&gt;&lt;span style="font-size:180%;"&gt;Program to store a list by using 2D arrays&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; /* names can store 3 names i.e. 1 name per row */&lt;br /&gt; char names[3][20] = { "Ajay", "Vijay", "Sanjay" };&lt;br /&gt; int i;&lt;br /&gt;&lt;br /&gt; printf( "\nDisplaying names : " );&lt;br /&gt; for(i = 0 ; i &lt; 3 ; i++)   &lt;br /&gt;printf("\n%s", names[i]);   &lt;br /&gt;return 0;&lt;br /&gt;&lt;br /&gt;}     &lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-8532628788146178741?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/hfLv89IyXrU" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/hfLv89IyXrU/program-to-store-list-by-using-2d.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-store-list-by-using-2d.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-7461758314696692467</guid><pubDate>Fri, 06 Nov 2009 14:29:00 +0000</pubDate><atom:updated>2009-11-06T06:30:44.640-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to show 3D array Demo.</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana;"&gt;&lt;span style="font-size:180%;"&gt;Program to show 3D array Demo.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;   int arr[2][3][4], i, j, k;&lt;br /&gt;&lt;br /&gt;   for(i = 0 ; i &lt; 2 ; i++)        &lt;br /&gt;for(j = 0 ; j &lt; 3 ; j++)             &lt;br /&gt;for(k = 0 ; k &lt; 4 ; k++)                &lt;br /&gt;arr[i][j][k] = i + j + k;     &lt;br /&gt;printf("\nDisplaying 3D array :");    &lt;br /&gt;for(i = 0 ; i &lt; 2 ; i++)   &lt;br /&gt;{        &lt;br /&gt;printf("\nRow %d", i + 1);       &lt;br /&gt;for(j = 0 ; j &lt; 3 ; j++)        &lt;br /&gt;{            &lt;br /&gt;printf("\tColumn %d\n\t\tCells: ", j + 1);                &lt;br /&gt;for(k = 0 ; k &lt; 4 ; k++)                    &lt;br /&gt;(" %d ", arr[i][j][k]);            &lt;br /&gt;printf("\n");        &lt;br /&gt;}    &lt;br /&gt;}    &lt;br /&gt;return 0;&lt;br /&gt;}    &lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-7461758314696692467?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/JcMfXYqUh-U" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/JcMfXYqUh-U/program-to-show-3d-array-demo.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-show-3d-array-demo.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-6908721589699404402</guid><pubDate>Fri, 06 Nov 2009 14:27:00 +0000</pubDate><atom:updated>2009-11-06T06:28:57.783-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to show Study of 2D Array Demo.</title><description>&lt;div style="text-align: center; font-family: verdana; font-weight: bold;"&gt;&lt;span style="font-size:180%;"&gt;Program to show Study of 2D Array Demo.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; int arr[3][2]; /* Array representing a matrix of 3 rows and 2 cols */&lt;br /&gt; int i, j;&lt;br /&gt;&lt;br /&gt; /* Assigning values to array elements */&lt;br /&gt; arr[0][0] = 10; arr[0][1] = 20;&lt;br /&gt; arr[1][0] = 30; arr[1][1] = 40;&lt;br /&gt; arr[2][0] = 50; arr[2][1] = 60;&lt;br /&gt;&lt;br /&gt; printf( "\nDisplaying array elements : " );&lt;br /&gt; for(i = 0 ; i &lt; 3 ; i++)  &lt;br /&gt;{   &lt;br /&gt;printf("\n");   &lt;br /&gt;for(j = 0 ; j &lt; 2 ; j++)    &lt;br /&gt;printf("%d\t", arr[i][j]);  &lt;br /&gt;}   &lt;br /&gt;return 0;&lt;br /&gt;}    &lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-6908721589699404402?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/t2v1rEPsGFk" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/t2v1rEPsGFk/program-to-show-study-of-2d-array-demo.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-show-study-of-2d-array-demo.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-4522935738815518645</guid><pubDate>Fri, 06 Nov 2009 14:26:00 +0000</pubDate><atom:updated>2009-11-06T06:27:36.574-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to show array of pointers</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana;"&gt;&lt;span style="font-size:180%;"&gt;Program to show array of pointers&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; float *ap[5], n1, n2, n3, n4, n5;&lt;br /&gt; int x;&lt;br /&gt;&lt;br /&gt; ap[0] = &amp;n1;&lt;br /&gt; ap[1] = &amp;n2;&lt;br /&gt; ap[2] = &amp;n3;&lt;br /&gt; ap[3] = &amp;n4;&lt;br /&gt; ap[4] = &amp;n5;&lt;br /&gt;&lt;br /&gt; for(x = 0 ; x &lt; 5 ; x++)  &lt;br /&gt;{   &lt;br /&gt;*ap[x] = (x + 1) / 10.0;  &lt;br /&gt;}   &lt;br /&gt;printf("\n%f\t%f\t%f\t%f\t%f", n1, n2, n3, n4, n5);   &lt;br /&gt;return 0;&lt;br /&gt;}       &lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-4522935738815518645?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/t8AOgTR21I0" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/t8AOgTR21I0/program-to-show-array-of-pointers.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-show-array-of-pointers.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-7418180559593445488</guid><pubDate>Fri, 06 Nov 2009 14:22:00 +0000</pubDate><atom:updated>2009-11-06T06:24:17.145-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Menu based program which allows users to calculate the area of Shapes</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: webdings;"&gt;&lt;span style="font-size:180%;"&gt;&lt;span style="font-family: verdana;"&gt;Menu based program which allows users to calculate the area of Shapes.&lt;/span&gt;&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; char choice;&lt;br /&gt;&lt;br /&gt; do&lt;br /&gt; {&lt;br /&gt;  &lt;br /&gt;printf("\n\'C\'ircle\n\'T\'riangle\n\'R\'ectangle\n\'S\'quare\n\'E\'xit\nChoice :");&lt;br /&gt;  fflush(stdin);&lt;br /&gt;  scanf("%c", &amp;amp;choice);&lt;br /&gt;&lt;br /&gt;  switch(choice)&lt;br /&gt;  {&lt;br /&gt;   case 'c':&lt;br /&gt;   case 'C':&lt;br /&gt;   {&lt;br /&gt;    float radius;&lt;br /&gt;    printf("Enter the radius :");&lt;br /&gt;    scanf("%f", &amp;amp;radius);&lt;br /&gt;    printf("\nArea of circle is %f", 3.14 * radius * radius);&lt;br /&gt;    printf("\nPerimeter of circle is %f", 2 * 3.14 * radius);&lt;br /&gt;    break;&lt;br /&gt;   }&lt;br /&gt;   case 't':&lt;br /&gt;   case 'T':&lt;br /&gt;   {&lt;br /&gt;    float base, ht;&lt;br /&gt;    printf("Enter the base and height :");&lt;br /&gt;    scanf("%f%f", &amp;amp;base, &amp;amp;ht);&lt;br /&gt;    printf("\nArea of triangle is %f", 0.5 * base * ht);&lt;br /&gt;    break;&lt;br /&gt;   }&lt;br /&gt;   case 'r':&lt;br /&gt;   case 'R':&lt;br /&gt;   {&lt;br /&gt;    float length, breadth;&lt;br /&gt;    printf("Enter the length and breadth :");&lt;br /&gt;    scanf("%f%f", &amp;amp;length, &amp;amp;breadth);&lt;br /&gt;    printf("\nArea of rectangle is %f", length * breadth);&lt;br /&gt;    printf("\nPerimeter of rectangle is %f", 2 * (length + breadth));&lt;br /&gt;    break;&lt;br /&gt;   }&lt;br /&gt;   case 's':&lt;br /&gt;   case 'S':&lt;br /&gt;   {&lt;br /&gt;    float side;&lt;br /&gt;    printf("Enter the side :");&lt;br /&gt;    scanf("%f", &amp;amp;side);&lt;br /&gt;    printf("\nArea of square is %f", side * side);&lt;br /&gt;    printf("\nPerimeter of square is %f", 4 * side);&lt;br /&gt;    break;&lt;br /&gt;   }&lt;br /&gt;   default :&lt;br /&gt;    printf("\nInvalid choice");&lt;br /&gt;  }&lt;br /&gt; }while(choice != 'E' &amp;amp;&amp;amp; choice != 'e');&lt;br /&gt;&lt;br /&gt; return 0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-7418180559593445488?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/2qz0n_HkxTE" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/2qz0n_HkxTE/menu-based-program-which-allows-users.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/menu-based-program-which-allows-users.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-3103336240829198767</guid><pubDate>Fri, 06 Nov 2009 14:06:00 +0000</pubDate><atom:updated>2009-11-06T06:07:40.971-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Create a 10 element array of integers and count the number of odd and even values in it.</title><description>&lt;div style="text-align: center; font-family: verdana; font-weight: bold;"&gt;&lt;span style="font-size:180%;"&gt;Create a 10 element array of integers and count the number of odd and even values in it.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; int arr[10], i, odd, even;&lt;br /&gt;&lt;br /&gt; printf("\nEnter ten integer values : ");&lt;br /&gt; for(i = 0 ; i &lt; 10; i++)   &lt;br /&gt;scanf("%d", &amp;amp;arr[i]);   for(odd = even = i = 0; i &lt; 10; i++)  &lt;br /&gt;{   &lt;br /&gt;if(arr[i] % 2 == 0)&lt;br /&gt;even++;   &lt;br /&gt;else odd++;  &lt;br /&gt;}   &lt;br /&gt;printf("\nTotal even values is %d\nTotal odd values is %d", even, odd);   &lt;br /&gt;return 0;&lt;br /&gt;}       &lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-3103336240829198767?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/k7m4s4F4OKM" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/k7m4s4F4OKM/create-10-element-array-of-integers-and.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/create-10-element-array-of-integers-and.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-2316162384816884989</guid><pubDate>Fri, 06 Nov 2009 14:01:00 +0000</pubDate><atom:updated>2009-11-06T06:06:17.027-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to show implementation of singly linkedlist</title><description>&lt;div style="text-align: center; font-weight: bold;"&gt;Program to show implementation of singly linked list&lt;br /&gt;&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;/* linklist.c */&lt;br /&gt;/* implementation of singly linkedlist */&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;#include&lt;alloc.h&gt;&lt;br /&gt;#include "linklist.h"&lt;br /&gt;&lt;br /&gt;void release(linkedlist *lp)&lt;br /&gt;{&lt;br /&gt; while(lp -&gt; count &gt; 0)&lt;br /&gt; del(lp, lp -&gt; count);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;node **goto_node(linkedlist *lp, int pos)&lt;br /&gt;{&lt;br /&gt; node *n = lp -&gt; base, **curr = &amp;amp;(lp -&gt; base);&lt;br /&gt; if(pos &lt;&gt; lp -&gt; count)&lt;br /&gt; return NULL;&lt;br /&gt;&lt;br /&gt; while(pos &gt; 0)&lt;br /&gt; {&lt;br /&gt;  curr = &amp;amp;(n -&gt; next);&lt;br /&gt;  n = n -&gt; next;&lt;br /&gt;  pos--;&lt;br /&gt; }&lt;br /&gt; return curr;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int append(linkedlist *lp, char *data)&lt;br /&gt;{&lt;br /&gt; node **curr = goto_node(lp, lp -&gt; count);&lt;br /&gt; *curr = (node *) malloc(sizeof(node));&lt;br /&gt; if(*curr == NULL)&lt;br /&gt; return FALSE;&lt;br /&gt;&lt;br /&gt; strcpy((*curr) -&gt; name, data);&lt;br /&gt; (*curr) -&gt; next = NULL;&lt;br /&gt; lp -&gt; count++;&lt;br /&gt; return TRUE;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int insert(linkedlist *lp, int pos, char *data)&lt;br /&gt;{&lt;br /&gt; node **curr = goto_node(lp, pos - 1), *tmp;&lt;br /&gt; if(curr == NULL)&lt;br /&gt;  return FALSE;&lt;br /&gt; tmp = *curr;&lt;br /&gt; *curr = (node *) malloc(sizeof(node));&lt;br /&gt; if(*curr == NULL)&lt;br /&gt; return FALSE;&lt;br /&gt;&lt;br /&gt; strcpy((*curr) -&gt; name, data);&lt;br /&gt; (*curr) -&gt; next = tmp;&lt;br /&gt; lp -&gt; count++;&lt;br /&gt; return TRUE;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int del(linkedlist *lp, int pos)&lt;br /&gt;{&lt;br /&gt; node **curr = goto_node(lp, pos - 1), *tmp;&lt;br /&gt; if(curr == NULL)&lt;br /&gt;  return FALSE;&lt;br /&gt; tmp = *curr;&lt;br /&gt; free(*curr);&lt;br /&gt; *curr = tmp -&gt; next;&lt;br /&gt; lp -&gt; count--;&lt;br /&gt; return TRUE;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;void show(linkedlist *lp)&lt;br /&gt;{&lt;br /&gt; node *n = lp -&gt; base;&lt;br /&gt; while(n != NULL)&lt;br /&gt; {&lt;br /&gt;  printf("\n%s", n -&gt; name);&lt;br /&gt;  n = n -&gt; next;&lt;br /&gt; }&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; int choice, pos;&lt;br /&gt; char value[80];&lt;br /&gt; linkedlist l = { NULL, 0 };&lt;br /&gt; do&lt;br /&gt; {&lt;br /&gt;  printf("\n ** SINGLE LINKED LIST **");&lt;br /&gt;  printf("\n1. Add\n2. Insert\n3. Remove\n4. Show\n5. Exit\nOption [1 - 5] ? ");&lt;br /&gt;  scanf("%d",&amp;amp;choice);&lt;br /&gt;  switch(choice)&lt;br /&gt;  {&lt;br /&gt;   case 1:&lt;br /&gt;    printf("\nName :");&lt;br /&gt;    fflush(stdin);&lt;br /&gt;    gets(value);&lt;br /&gt;    if(!append(&amp;amp;l, value))&lt;br /&gt;     printf( "\nNode creation failed" );&lt;br /&gt;    else&lt;br /&gt;     printf( "\nNew node created successfully" );&lt;br /&gt;    break;&lt;br /&gt;   case 2:&lt;br /&gt;    printf("\nInsert position ? " );&lt;br /&gt;    scanf( "%d", &amp;amp;pos );&lt;br /&gt;    printf("\nEnter value :");&lt;br /&gt;    fflush(stdin);&lt;br /&gt;    gets(value);&lt;br /&gt;    if(!insert(&amp;amp;l, pos, value))&lt;br /&gt;     printf( "\nNode insertion failed" );&lt;br /&gt;    else&lt;br /&gt;     printf( "\nNode inserted successfully" );&lt;br /&gt;    break;&lt;br /&gt;   case 3:&lt;br /&gt;    printf("\nDelete position ? " );&lt;br /&gt;    scanf( "%d", &amp;amp;pos );&lt;br /&gt;    if(!del( &amp;amp;l, pos ))&lt;br /&gt;     printf( "\nNode removal failed" );&lt;br /&gt;    else&lt;br /&gt;     printf("\nNode removed successfully");&lt;br /&gt;    break;&lt;br /&gt;   case 4:&lt;br /&gt;    show(&amp;amp;l);&lt;br /&gt;    break;&lt;br /&gt;   case 5:&lt;br /&gt;    release(&amp;amp;l);&lt;br /&gt;    break;&lt;br /&gt;  }&lt;br /&gt; }while(choice != 5);&lt;br /&gt;&lt;br /&gt; return SUCCESS;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/alloc.h&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-2316162384816884989?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/ECwimHncg-U" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/ECwimHncg-U/program-to-show-implementation-of_06.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-show-implementation-of_06.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-4962278051336618031</guid><pubDate>Wed, 04 Nov 2009 07:45:00 +0000</pubDate><atom:updated>2009-11-03T23:46:06.217-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>program to create a 10 element array of integers and search for a value in it.</title><description>program to create a 10 element array of integers and search for a value in it.&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; int arr[10], i, val, n;&lt;br /&gt;&lt;br /&gt; printf("\nEnter ten integer values : ");&lt;br /&gt; for(i = 0 ; i &lt; 10 ; i++ )&lt;br /&gt;  scanf("%d", &amp;arr[i]);&lt;br /&gt;&lt;br /&gt; printf("\nEnter value to search : ");&lt;br /&gt; scanf("%d", &amp;val);&lt;br /&gt;&lt;br /&gt; /* Search the value in the array */&lt;br /&gt; n = 0;&lt;br /&gt; for(i = 0 ; i &lt; 10 ; i++)&lt;br /&gt; {&lt;br /&gt;  n++;&lt;br /&gt;  if(arr[i] == val)&lt;br /&gt;   break;&lt;br /&gt; }&lt;br /&gt; if(i == 10)&lt;br /&gt; {&lt;br /&gt;  printf("\n%d not found in the array", val);&lt;br /&gt;  printf("\nNo of attempts = %d", n);&lt;br /&gt; }&lt;br /&gt; else&lt;br /&gt; {&lt;br /&gt;  printf("\n%d found in the array", val);&lt;br /&gt;  printf("\nNo of attempts = %d", n);&lt;br /&gt; }&lt;br /&gt;&lt;br /&gt; return 0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-4962278051336618031?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/EEswS0QSfTY" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/EEswS0QSfTY/program-to-create-10-element-array-of.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-create-10-element-array-of.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-917298259363111217</guid><pubDate>Wed, 04 Nov 2009 07:43:00 +0000</pubDate><atom:updated>2009-11-03T23:44:50.160-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to count the number of capital letters, small letters, digits and special symbols in given String</title><description>&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;/* Take input into a string and count the number of capital letters,&lt;br /&gt;small letters, digits and special symbols in it. */&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt; char str[80];&lt;br /&gt; int x, cap, small, dig, sym;&lt;br /&gt;&lt;br /&gt; printf("\nEnter a string : ");&lt;br /&gt; gets(str);&lt;br /&gt;&lt;br /&gt; x = cap = small = dig = sym = 0;&lt;br /&gt;&lt;br /&gt; for( ; str[x] != '\0' ; x++)&lt;br /&gt; {&lt;br /&gt;  if(str[x] &gt;= 'A' &amp;&amp; str[x] &lt;= 'Z') cap++;&lt;br /&gt;  else if(str[x] &gt;= 'a' &amp;&amp; str[x] &lt;= 'z') small++;&lt;br /&gt;  else if(str[x] &gt;= '0' &amp;&amp; str[x] &lt;= '9')  dig++;&lt;br /&gt;  else sym++;&lt;br /&gt;&lt;br /&gt; }&lt;br /&gt;&lt;br /&gt; printf("\nCapital letters %d\nSmall letters %d", cap, small);&lt;br /&gt; printf("\nDigits %d\nSpecial symbols %d", dig, sym);&lt;br /&gt;&lt;br /&gt; return 0;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-917298259363111217?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/w7A_xICKi8Y" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/w7A_xICKi8Y/program-to-count-number-of-capital.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-count-number-of-capital.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-3714083345355271751</guid><pubDate>Wed, 04 Nov 2009 07:40:00 +0000</pubDate><atom:updated>2009-11-03T23:42:59.870-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to Find the absolute value of an integer taken as input.</title><description>&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;/* absolute.c */&lt;br /&gt;/* Find the absolute value of an integer taken as input.  */&lt;br /&gt;&lt;br /&gt;#include &lt;stdio.h&gt;&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;int num;&lt;br /&gt;&lt;br /&gt;printf("\nEnter a number : ");&lt;br /&gt;scanf("%d" ,&amp;amp;num);&lt;br /&gt;&lt;br /&gt;if(num &lt;&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-3714083345355271751?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/GCIHJV1DWOM" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/GCIHJV1DWOM/absolute.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/absolute.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-9072180891147585942</guid><pubDate>Wed, 04 Nov 2009 07:36:00 +0000</pubDate><atom:updated>2009-11-03T23:39:40.538-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to Show implementation of singly linkedlist</title><description>&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;/* linklist.c */&lt;br /&gt;/* implementation of singly linkedlist */&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;#include&lt;alloc.h&gt;&lt;br /&gt;#include "linklist.h"&lt;br /&gt;&lt;br /&gt;void release(linkedlist *lp)&lt;br /&gt;{&lt;br /&gt;    while(lp -&gt; count &gt; 0)&lt;br /&gt;    del(lp, lp -&gt; count);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;node **goto_node(linkedlist *lp, int pos)&lt;br /&gt;{&lt;br /&gt;    node *n = lp -&gt; base, **curr = &amp;amp;(lp -&gt; base);&lt;br /&gt;    if(pos &lt;&gt; lp -&gt; count)&lt;br /&gt;    return NULL;&lt;br /&gt;&lt;br /&gt;    while(pos &gt; 0)&lt;br /&gt;    {&lt;br /&gt;        curr = &amp;amp;(n -&gt; next);&lt;br /&gt;        n = n -&gt; next;&lt;br /&gt;        pos--;&lt;br /&gt;    }&lt;br /&gt;    return curr;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int append(linkedlist *lp, char *data)&lt;br /&gt;{&lt;br /&gt;    node **curr = goto_node(lp, lp -&gt; count);&lt;br /&gt;    *curr = (node *) malloc(sizeof(node));&lt;br /&gt;    if(*curr == NULL)&lt;br /&gt;    return FALSE;&lt;br /&gt;&lt;br /&gt;    strcpy((*curr) -&gt; name, data);&lt;br /&gt;    (*curr) -&gt; next = NULL;&lt;br /&gt;    lp -&gt; count++;&lt;br /&gt;    return TRUE;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int insert(linkedlist *lp, int pos, char *data)&lt;br /&gt;{&lt;br /&gt;    node **curr = goto_node(lp, pos - 1), *tmp;&lt;br /&gt;    if(curr == NULL)&lt;br /&gt;        return FALSE;&lt;br /&gt;    tmp = *curr;&lt;br /&gt;    *curr = (node *) malloc(sizeof(node));&lt;br /&gt;    if(*curr == NULL)&lt;br /&gt;    return FALSE;&lt;br /&gt;&lt;br /&gt;    strcpy((*curr) -&gt; name, data);&lt;br /&gt;    (*curr) -&gt; next = tmp;&lt;br /&gt;    lp -&gt; count++;&lt;br /&gt;    return TRUE;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int del(linkedlist *lp, int pos)&lt;br /&gt;{&lt;br /&gt;    node **curr = goto_node(lp, pos - 1), *tmp;&lt;br /&gt;    if(curr == NULL)&lt;br /&gt;    return FALSE;&lt;br /&gt;    tmp = *curr;&lt;br /&gt;    free(*curr);&lt;br /&gt;    *curr = tmp -&gt; next;&lt;br /&gt;    lp -&gt; count--;&lt;br /&gt;    return TRUE;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;void show(linkedlist *lp)&lt;br /&gt;{&lt;br /&gt;    node *n = lp -&gt; base;&lt;br /&gt;    while(n != NULL)&lt;br /&gt;    {&lt;br /&gt;        printf("\n%s", n -&gt; name);&lt;br /&gt;        n = n -&gt; next;&lt;br /&gt;    }&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;int main(void)&lt;br /&gt;{&lt;br /&gt;    int choice, pos;&lt;br /&gt;    char value[80];&lt;br /&gt;    linkedlist l = { NULL, 0 };&lt;br /&gt;    do&lt;br /&gt;    {&lt;br /&gt;    printf("\n ** SINGLE LINKED LIST **");&lt;br /&gt;    printf("\n1. Add\n2. Insert\n3. Remove\n4. Show\n5. Exit\nOption [1 - 5]&lt;br /&gt;&lt;br /&gt;? ");&lt;br /&gt;        scanf("%d",&amp;amp;choice);&lt;br /&gt;        switch(choice)&lt;br /&gt;        {&lt;br /&gt;            case 1:&lt;br /&gt;                printf("\nName :");&lt;br /&gt;                fflush(stdin);&lt;br /&gt;                gets(value);&lt;br /&gt;                if(!append(&amp;amp;l, value))&lt;br /&gt;                    printf( "\nNode creation failed" );&lt;br /&gt;                else&lt;br /&gt;                    printf( "\nNew node created successfully" );&lt;br /&gt;                break;&lt;br /&gt;            case 2:&lt;br /&gt;                printf("\nInsert position ? " );&lt;br /&gt;                scanf( "%d", &amp;amp;pos );&lt;br /&gt;                printf("\nEnter value :");&lt;br /&gt;                fflush(stdin);&lt;br /&gt;                gets(value);&lt;br /&gt;                if(!insert(&amp;amp;l, pos, value))&lt;br /&gt;                    printf( "\nNode insertion failed" );&lt;br /&gt;                else&lt;br /&gt;                    printf( "\nNode inserted successfully" );&lt;br /&gt;                break;&lt;br /&gt;            case 3:&lt;br /&gt;                printf("\nDelete position ? " );&lt;br /&gt;                scanf( "%d", &amp;amp;pos );&lt;br /&gt;                if(!del( &amp;amp;l, pos ))&lt;br /&gt;                    printf( "\nNode removal failed" );&lt;br /&gt;                else&lt;br /&gt;                    printf("\nNode removed successfully");&lt;br /&gt;                break;&lt;br /&gt;            case 4:&lt;br /&gt;                show(&amp;amp;l);&lt;br /&gt;                break;&lt;br /&gt;            case 5:&lt;br /&gt;                release(&amp;amp;l);&lt;br /&gt;                break;&lt;br /&gt;        }&lt;br /&gt;    }while(choice != 5);&lt;br /&gt;&lt;br /&gt;    return SUCCESS;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-9072180891147585942?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/ZUu18tRazt0" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/ZUu18tRazt0/program-to-show-implementation-of.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-show-implementation-of.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-9219580933634065612</guid><pubDate>Mon, 02 Nov 2009 06:36:00 +0000</pubDate><atom:updated>2009-11-01T22:38:37.060-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to Find Quality of Steel and give Grades</title><description>&lt;span style="font-family: verdana;"&gt;A certain grade of steel is graded according to the following conditions:&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;1)Hardness must be greater than 50&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;2)Carbon content must be less than 0.7&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;3)Tensile strength must be greater than 5600&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;The grades are as follows:&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Grade is 10 if all three conditions are met&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Grade is 9 if (1) and (2) are met&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Grade is 8 if (2) and (3) are met&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Grade is 7 if (1) and (3) are met&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Grade is 6 if only one condition is met&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Grade is 5 if none of the conditions is met&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;Write a program which will require the user to give the values of hardness,&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;carbon content and tensile strength of the steel under consideration and output&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family: verdana;"&gt;the grade of the steel.&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int hardness, ts, grade;&lt;br /&gt;&lt;br /&gt;float carbon;&lt;br /&gt;&lt;br /&gt;printf("Enter the values of hardness, tensile strength and carbon content in the steel:");&lt;br /&gt;scanf("%d %d %f", &amp;amp;hardness, &amp;amp;ts, &amp;amp;carbon);&lt;br /&gt;&lt;br /&gt;if ((hardness&gt;50) &amp;amp;&amp;amp; (carbon&lt;0.7)&gt;5600))&lt;br /&gt;&lt;br /&gt;printf("Grade 10");&lt;br /&gt;else if ((hardness&gt;50) &amp;amp;&amp;amp; (carbon&lt;0.7))&lt;br /&gt;printf("Grade 9"); else if ((carbon&lt;0.7)&gt;5600))&lt;br /&gt;&lt;br /&gt;printf("Grade 8");&lt;br /&gt;else if ((hardness&gt;50) &amp;amp;&amp;amp; (ts&gt;5600))&lt;br /&gt;&lt;br /&gt;printf("Grade 7");&lt;br /&gt;else if ((hardness&gt;50) || (carbon&lt;0.7)&gt;5600))&lt;br /&gt;&lt;br /&gt;printf("Grade 6");&lt;br /&gt;else&lt;br /&gt;printf("Grade 5");&lt;br /&gt;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-9219580933634065612?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/4Fzp9g1S5pI" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/4Fzp9g1S5pI/program-to-find-quality-of-steel-and.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-find-quality-of-steel-and.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-8153491069284687537</guid><pubDate>Mon, 02 Nov 2009 06:33:00 +0000</pubDate><atom:updated>2009-11-01T22:36:20.093-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program To Calculate Insurance using Logical Operators.</title><description>&lt;div style="text-align: center; font-family: verdana; font-weight: bold;"&gt;&lt;span style="font-size:180%;"&gt;Program To Calculate Insurance using Logical Operators.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;int age,premium, max_amount;&lt;br /&gt;&lt;br /&gt;char health, location, sex;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;printf("Enter Health - g for good / b for bad\nEnter Location - c for city / v for village");&lt;br /&gt;&lt;br /&gt;printf("\nEnter sex - m for male / f for female");&lt;br /&gt;&lt;br /&gt;printf("\nEnter the health, age, location and sex of the person:");&lt;br /&gt;&lt;br /&gt;scanf ("%c %d %c %c", &amp;amp;health, &amp;amp;age, &amp;amp;location, &amp;amp;sex);&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;if ((health=='g') &amp;amp;&amp;amp; ((age&gt;=25)&amp;amp;&amp;amp;(age&lt;=35)) &amp;amp;&amp;amp; (location=='c') &amp;amp;&amp;amp; (sex=='m')) &lt;br /&gt;{&lt;br /&gt;premium=4; max_amount=2;&lt;br /&gt;printf("This person is insured.\nThe payable premium is Rs. %d per thousand\n and the max policy amount is Rs. %d Lakhs", premium, max_amount); &lt;br /&gt;} &lt;br /&gt;else&lt;br /&gt;if ((health=='g') &amp;amp;&amp;amp; ((age&gt;=25)&amp;amp;&amp;amp;(age&lt;=35)) &amp;amp;&amp;amp; (location=='c') &amp;amp;&amp;amp; (sex=='f')) &lt;br /&gt;{&lt;br /&gt;premium=3;&lt;br /&gt;max_amount=1;&lt;br /&gt;printf("This person is insured.\nThe payable premium is Rs. %d per thousand\nand the max policy amount is Rs. %d Lakhs", premium, max_amount); &lt;br /&gt;} &lt;br /&gt;else&lt;br /&gt;if((health=='b') &amp;amp;&amp;amp; ((age&gt;=25)&amp;amp;&amp;amp;(age&lt;=35)) &amp;amp;&amp;amp; (location=='v') &amp;amp;&amp;amp; (sex=='m')) &lt;br /&gt;{&lt;br /&gt;premium=6;&lt;br /&gt;max_amount=10000;&lt;br /&gt;printf("This person is insured.\nThe payable premium is Rs. %d per thousand \nand the max policy amount is Rs. %d ", premium, max_amount); &lt;br /&gt;} &lt;br /&gt;else&lt;br /&gt;{&lt;br /&gt;printf("This person is not insured.");&lt;br /&gt;} &lt;br /&gt;}&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-8153491069284687537?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/zu8vRgQ_Z2I" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/zu8vRgQ_Z2I/program-to-calculate-insurance-using.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-calculate-insurance-using.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-4808272211964916114</guid><pubDate>Mon, 02 Nov 2009 06:30:00 +0000</pubDate><atom:updated>2009-11-01T22:32:33.000-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to Find Character Group using ASCII And Conditional Operator.</title><description>&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;char charac;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;printf("Enter the character to be Find:");&lt;br /&gt;scanf("%c", &amp;charac);&lt;br /&gt;&lt;br /&gt;((charac&gt;=97) &amp;&amp; (charac&lt;=122))?(printf("\nLower Case")):(printf("\nNot a Lower Case character"));&lt;br /&gt;&lt;br /&gt;/*For detection of Special Symbols*/&lt;br /&gt;&lt;br /&gt;(((charac&gt;=0) &amp;&amp; (charac&lt;=47)) || ((charac&gt;=58) &amp;&amp; (charac&lt;=64))|| ((charac&gt;=91) &amp;&amp; (charac&lt;=96))|| ((charac&gt;=123) &amp;&amp; (charac&lt;=127)))? (printf("\nSpecial Symbol")):(printf("\nNot a Special Symbol"));&lt;br /&gt;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-4808272211964916114?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/a5dmJJ_Iq_4" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/a5dmJJ_Iq_4/program-to-find-character-group-using.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-find-character-group-using.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-2925950827473111336</guid><pubDate>Mon, 02 Nov 2009 06:24:00 +0000</pubDate><atom:updated>2009-11-01T22:30:33.525-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to Reverse the number and check for Equality.</title><description>&lt;div style="text-align: center; font-weight: bold; font-family: verdana;"&gt;&lt;span style="font-size:180%;"&gt;Program to Reverse the number and check for Equality.&lt;br /&gt;&lt;/span&gt;&lt;/div&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;&lt;br /&gt;int last_digit, number, next_digit, rev_num;&lt;br /&gt;&lt;br /&gt;printf ("Enter the five-digit number that has to be reversed and checked for equality:");&lt;br /&gt;&lt;br /&gt;scanf("%d", &amp;amp;number);&lt;br /&gt;&lt;br /&gt;last_digit = number - ((number / 10) * 10); /*units place*/&lt;br /&gt;&lt;br /&gt;rev_num = last_digit; /* 5 */&lt;br /&gt;&lt;br /&gt;next_digit = (number / 10) - ((number / 100) * 10); /*tenth's place*/&lt;br /&gt;&lt;br /&gt;rev_num = (rev_num * 10) + next_digit; /*54*/&lt;br /&gt;&lt;br /&gt;next_digit = (number / 100) - ((number / 1000) * 10); /*hundred's place*/&lt;br /&gt;&lt;br /&gt;rev_num = (rev_num * 10) + next_digit; /*543*/&lt;br /&gt;&lt;br /&gt;next_digit = (number / 1000) - ((number / 10000) * 10); /*thousand's place*/&lt;br /&gt;&lt;br /&gt;rev_num = (rev_num * 10) + next_digit; /*5432*/&lt;br /&gt;&lt;br /&gt;next_digit = (number / 10000) - ((number / 100000) * 10); /*ten thousand's place*/&lt;br /&gt;&lt;br /&gt;rev_num = (rev_num * 10) + next_digit; /*54321*/&lt;br /&gt;&lt;br /&gt;printf ("The Reversed Number is: %d",rev_num);&lt;br /&gt;&lt;br /&gt;if (rev_num==number)&lt;br /&gt;&lt;br /&gt;{&lt;br /&gt;printf("\nEntered number and reversed number are equal\n");&lt;br /&gt;}&lt;br /&gt;else&lt;br /&gt;&lt;br /&gt;{&lt;br /&gt;printf("\nEntered number and reversed number are not equal\n");&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-2925950827473111336?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/zW0azI_dCag" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/zW0azI_dCag/program-to-reverse-number-and-check-for.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-reverse-number-and-check-for.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-4855459713896936918</guid><pubDate>Mon, 02 Nov 2009 06:22:00 +0000</pubDate><atom:updated>2009-11-01T22:23:32.425-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program to calculate Gross Salary using if-else statement</title><description>In a company if an employee is paid as under:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;If his basic salary is less than Rs. 1500, then HRA=10% of basic salary and DA=90% of basic salary.&lt;/li&gt;&lt;li&gt;If his salary is either equal to or above Rs. 1500, then HRA = Rs. 500 and DA = 98% of basic salary.&lt;/li&gt;&lt;li&gt;If the employee's salary is input through the keyboard write a program to find his gross salary.&lt;/li&gt;&lt;/ul&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;&lt;br /&gt;float bs, gs, da, hra;&lt;br /&gt;&lt;br /&gt;printf ("Enter basic salary:");&lt;br /&gt;&lt;br /&gt;scanf ("%f", &amp;bs);&lt;br /&gt;&lt;br /&gt;if (bs&lt;1500)&lt;br /&gt;&lt;br /&gt;{&lt;br /&gt;hra=bs*10/100;&lt;br /&gt;da=bs*90/100;&lt;br /&gt;&lt;br /&gt;}&lt;br /&gt;else&lt;br /&gt;{&lt;br /&gt;hra=500;&lt;br /&gt;da=bs*98/100;&lt;br /&gt;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;gs=bs + hra + da;&lt;br /&gt;&lt;br /&gt;printf ("gross salary = Rs. %f", gs);&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-4855459713896936918?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/yMVEYKl5Yo4" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/yMVEYKl5Yo4/program-to-calculate-gross-salary-using.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-calculate-gross-salary-using.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-56117914589645536</guid><pubDate>Mon, 02 Nov 2009 06:20:00 +0000</pubDate><atom:updated>2009-11-01T22:21:58.232-08:00</atom:updated><title>Program To Calculate Discount using 'if' statement.</title><description>&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;&lt;br /&gt;{&lt;br /&gt;int qty,dis=0; /*initializing is required as if tot&lt;1000, then discount is 0*/&lt;br /&gt;float rate, tot;&lt;br /&gt;&lt;br /&gt;printf ("Enter quantity and rate: ");&lt;br /&gt;scanf ("%d %f", &amp;qty, &amp;rate);&lt;br /&gt;&lt;br /&gt;if (qty&gt;1000)&lt;br /&gt;dis=10;&lt;br /&gt;&lt;br /&gt;tot=(qty*rate) - (qty*rate*dis/100);&lt;br /&gt;&lt;br /&gt;printf("Total expenses = Rs. %f", tot);&lt;br /&gt;&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-56117914589645536?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/_4nVpdHD7J8" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/_4nVpdHD7J8/program-to-calculate-discount-using-if.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-calculate-discount-using-if.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-6093948430950377594</guid><pubDate>Mon, 02 Nov 2009 06:18:00 +0000</pubDate><atom:updated>2009-11-01T22:19:51.233-08:00</atom:updated><title>Program To Calculate Driver insurance using if-else statement</title><description>&lt;div style="text-align: justify;"&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;A company insures its drivers in the following cases: &lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;- If the driver is married.&lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;- If the driver is unmarried, male and above 30 years of age.&lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;- If the driver is unmarried, female and above 25 years of age. &lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;  In all the other cases, the driver is not insured. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;font-family:verdana;" &gt;  If the marital status, sex and age of the driver are the inputs,&lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;"&gt;&lt;span style="font-family:verdana;"&gt;  write a program to determine whether the driver is insured or not.&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;&lt;span style="font-weight: bold;"&gt;&lt;/span&gt;&lt;/div&gt;&lt;span style="font-weight: bold;"&gt;&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main()&lt;br /&gt;{&lt;br /&gt;&lt;br /&gt;char sex,ms;&lt;br /&gt;int age;&lt;br /&gt;&lt;br /&gt;printf ("Enter age, sex, marital status:");&lt;br /&gt;&lt;br /&gt;scanf ("%d %c %c", &amp;amp;age, &amp;amp;sex, &amp;amp;ms);&lt;br /&gt;&lt;br /&gt;if (ms=='M')&lt;br /&gt;&lt;br /&gt;printf ("The driver is insured");&lt;br /&gt;else&lt;br /&gt;{&lt;br /&gt;if (sex=='M')&lt;br /&gt;&lt;br /&gt;{&lt;br /&gt;if (age&gt;30)&lt;br /&gt;printf ("Driver is insured");&lt;br /&gt;&lt;br /&gt;else&lt;br /&gt;printf ("Driver is not insured");&lt;br /&gt;}&lt;br /&gt;else&lt;br /&gt;{&lt;br /&gt;&lt;br /&gt;if (age&gt;25)&lt;br /&gt;printf ("Driver is insured");&lt;br /&gt;else&lt;br /&gt;printf ("Driver is not insured");&lt;br /&gt;&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-6093948430950377594?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/nuCay9l1ZUk" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/nuCay9l1ZUk/program-to-calculate-driver-insurance.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-calculate-driver-insurance.html</feedburner:origLink></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-7092135066960371093.post-1346388858647146258</guid><pubDate>Mon, 02 Nov 2009 06:16:00 +0000</pubDate><atom:updated>2009-11-01T22:18:18.472-08:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">C Assignments</category><title>Program To Calculate Employees Bonus In C</title><description>&lt;pre name="code" class="Cpp"&gt;&lt;br /&gt;&lt;br /&gt;#include&lt;stdio.h&gt;&lt;br /&gt;main ()&lt;br /&gt;{&lt;br /&gt;&lt;br /&gt;int bonus, cy, yoj, yr_of_ser;&lt;br /&gt;&lt;br /&gt;printf ("Enter current year and year of joining: ");&lt;br /&gt;&lt;br /&gt;scanf ("%d %d", &amp;amp;cy, &amp;amp;yoj);&lt;br /&gt;&lt;br /&gt;yr_of_ser = cy - yoj;&lt;br /&gt;&lt;br /&gt;if (yr_of_ser&gt;3)&lt;br /&gt;{&lt;br /&gt;bonus = 2500;&lt;br /&gt;&lt;br /&gt;printf ("Bonus = Rs. %d", bonus);&lt;br /&gt;}&lt;br /&gt;}&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/stdio.h&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/7092135066960371093-1346388858647146258?l=lernc.blogspot.com'/&gt;&lt;/div&gt;&lt;img src="http://feeds.feedburner.com/~r/blogspot/EpVq/~4/_PnYOy-Q6BU" height="1" width="1"/&gt;</description><link>http://feedproxy.google.com/~r/blogspot/EpVq/~3/_PnYOy-Q6BU/program-to-calculate-employees-bonus-in.html</link><author>infocomputers108@gmail.com (pankaj a.h.)</author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><feedburner:origLink>http://lernc.blogspot.com/2009/11/program-to-calculate-employees-bonus-in.html</feedburner:origLink></item><language>en-us</language><copyright>© Info Groups..</copyright><media:credit role="author">pankaj a.h.</media:credit><media:rating>nonadult</media:rating><media:description type="plain">Life is Good</media:description></channel></rss>
