<?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>EmbLogic &#187; Nishant Khanna</title>
	<atom:link href="https://www.emblogic.com/blog/author/21nishantkhanna/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.emblogic.com/blog</link>
	<description>Embedded System and ARM Training</description>
	<lastBuildDate>Tue, 03 Mar 2020 13:00:06 +0000</lastBuildDate>
	<language>en-US</language>
		<sy:updatePeriod>hourly</sy:updatePeriod>
		<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.9.1</generator>
	<item>
		<title>Largest Element Using Function and Array</title>
		<link>https://www.emblogic.com/blog/03/largest-element-using-function-and-array/</link>
		<comments>https://www.emblogic.com/blog/03/largest-element-using-function-and-array/#comments</comments>
		<pubDate>Mon, 09 Mar 2015 06:29:31 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12415</guid>
		<description><![CDATA[#include &#60;stdio.h&#62; int largest(int []); int largest(int arr[5]) { int l,i; l = arr[0]; for(i=1;i&#60;5;i++) { if (arr[i] &#62; l) { l = arr[i]; } else ; //printf(&#8220;%d&#8221;,l); } return l; } int main() { int i, max; int arr[5]; &#8230; <a href="https://www.emblogic.com/blog/03/largest-element-using-function-and-array/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>#include &lt;stdio.h&gt;<br />
int largest(int []);<br />
int largest(int arr[5])<br />
{<br />
int l,i;<br />
l = arr[0];<br />
for(i=1;i&lt;5;i++)<br />
{<br />
if (arr[i] &gt; l)<br />
{<br />
l = arr[i];<br />
}<br />
else ;</p>
<p>//printf(&#8220;%d&#8221;,l);<br />
}</p>
<p>return l;<br />
}</p>
<p>int main()<br />
{<br />
int i, max;<br />
int arr[5];<br />
printf(&#8220;Enter Elements of array:\n&#8221;);<br />
for(i=0;i&lt;5;i++)<br />
{<br />
scanf(&#8220;%d&#8221;, &amp;arr[i]);<br />
}<br />
for(i=0;i&lt;5;i++)<br />
{<br />
printf(&#8220;Array-&gt;%d of %d\n:&#8221;,i,arr[i]);</p>
<p>}<br />
max = largest(arr);<br />
printf(&#8220;largest element is %d\n:&#8221;, max);<br />
}</p>
<p>&#8220;largest_func.c&#8221; 38L, 476C                                                                             33,3-17       44%</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/03/largest-element-using-function-and-array/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Addition Using PASS BY VALUE</title>
		<link>https://www.emblogic.com/blog/03/addition-using-pass-by-value/</link>
		<comments>https://www.emblogic.com/blog/03/addition-using-pass-by-value/#comments</comments>
		<pubDate>Mon, 09 Mar 2015 05:08:27 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12413</guid>
		<description><![CDATA[#include &#60;stdio.h&#62; int add_num(int, int, int);                                              //function declaration int add_num(int num1, int num2, int num3)               //function definition { int num4; num4 = num1 + num2 + num3;                        //function body return num4; } int main() { int i,x,y,z; printf(&#8220;Enter three numbers:\n&#8221;); &#8230; <a href="https://www.emblogic.com/blog/03/addition-using-pass-by-value/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>#include &lt;stdio.h&gt;<br />
int add_num(int, int, int);                                              //function declaration<br />
int add_num(int num1, int num2, int num3)               //function definition<br />
{<br />
int num4;<br />
num4 = num1 + num2 + num3;                        //function body<br />
return num4;<br />
}<br />
int main()<br />
{<br />
int i,x,y,z;<br />
printf(&#8220;Enter three numbers:\n&#8221;);<br />
scanf(&#8220;%d%d%d&#8221;,&amp;x,&amp;y,&amp;z );<br />
i = add_num(x,y,z);<br />
printf(&#8220;sum of %d , %d and %d is %d:\n&#8221;,x,y,z,i<br />
);<br />
}</p>
<p>~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
6,49-56       All</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/03/addition-using-pass-by-value/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Enter Elements in Array</title>
		<link>https://www.emblogic.com/blog/03/enter-elements-in-array/</link>
		<comments>https://www.emblogic.com/blog/03/enter-elements-in-array/#comments</comments>
		<pubDate>Wed, 04 Mar 2015 08:48:46 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12402</guid>
		<description><![CDATA[#include &#60;stdio.h&#62; int main() { int i,j; int r=2,c=3; int arr[3][4]; printf(&#8220;Enter Elements:\n&#8221;); for(i=0;i&#60;3;i++) { for(j=0;j&#60;4;j++) { scanf(&#8220;%d&#8221;, &#38;arr[i][j]); } } printf(&#8220;Elements of Array:\n&#8221;); for(i=0;i&#60;3;i++) { for(j=0;j&#60;4;j++) { printf(&#8220;%d \t&#8221;, arr[i][j]); } printf(&#8220;\n&#8221;); } return 0; } ~ &#8220;2d_array.c&#8221; 28L, &#8230; <a href="https://www.emblogic.com/blog/03/enter-elements-in-array/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>#include &lt;stdio.h&gt;<br />
int main()<br />
{<br />
int i,j;<br />
int r=2,c=3;<br />
int arr[3][4];</p>
<p>printf(&#8220;Enter Elements:\n&#8221;);<br />
for(i=0;i&lt;3;i++)<br />
{<br />
for(j=0;j&lt;4;j++)<br />
{<br />
scanf(&#8220;%d&#8221;, &amp;arr[i][j]);<br />
}<br />
}</p>
<p>printf(&#8220;Elements of Array:\n&#8221;);<br />
for(i=0;i&lt;3;i++)<br />
{<br />
for(j=0;j&lt;4;j++)<br />
{<br />
printf(&#8220;%d \t&#8221;, arr[i][j]);<br />
}<br />
printf(&#8220;\n&#8221;);<br />
}<br />
return 0;<br />
}</p>
<p>~<br />
&#8220;2d_array.c&#8221; 28L, 357C                                                                                 6,2-9         All</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/03/enter-elements-in-array/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Linear Search</title>
		<link>https://www.emblogic.com/blog/02/linear-search/</link>
		<comments>https://www.emblogic.com/blog/02/linear-search/#comments</comments>
		<pubDate>Sat, 28 Feb 2015 04:50:36 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12359</guid>
		<description><![CDATA[1 #include &#60;stdio.h&#62; 2 int flag=1; 3 int main() 4 { 5         int arr[5]; 6         int i, key; 7         printf(&#8220;Enter Array:\n&#8221;); 8         for(i=0;i&#60;5;i++) 9         { 10                 scanf(&#8220;%d&#8221;, &#38;arr[i]); 11         } 12         printf(&#8220;Elements of array:\n&#8221;); 13         for(i=0;i&#60;5;i++) 14         { 15                 printf(&#8220;Araray &#8230; <a href="https://www.emblogic.com/blog/02/linear-search/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1 #include &lt;stdio.h&gt;<br />
2 int flag=1;<br />
3 int main()<br />
4 {<br />
5         int arr[5];<br />
6         int i, key;<br />
7         printf(&#8220;Enter Array:\n&#8221;);<br />
8         for(i=0;i&lt;5;i++)<br />
9         {<br />
10                 scanf(&#8220;%d&#8221;, &amp;arr[i]);<br />
11         }<br />
12         printf(&#8220;Elements of array:\n&#8221;);<br />
13         for(i=0;i&lt;5;i++)<br />
14         {<br />
15                 printf(&#8220;Araray -&gt;%d:%d\n&#8221;,i, arr[i]);<br />
16         }<br />
17         printf(&#8220;Enter Key element:\n&#8221;);<br />
18         scanf(&#8220;%d&#8221;, &amp;key);<br />
19         for(i=0;i&lt;5;i++)<br />
20                 if (arr[i] == key)<br />
21                 {<br />
22                         printf(&#8220;key found\n&#8221;);<br />
23                         flag=0;<br />
24                 }<br />
25<br />
26                 if(flag)<br />
27                 {<br />
28                         printf(&#8220;key not found\n&#8221;);<br />
29                 }<br />
30<br />
31 return 0;<br />
16,1-8        Top</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/linear-search/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Decimal to binary conversion</title>
		<link>https://www.emblogic.com/blog/02/decimal-to-binary-conversion/</link>
		<comments>https://www.emblogic.com/blog/02/decimal-to-binary-conversion/#comments</comments>
		<pubDate>Sun, 22 Feb 2015 06:27:07 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12257</guid>
		<description><![CDATA[1 #include &#60;stdio.h&#62; 2 int main() 3 { 4         int i,a,b; 5         printf(&#8220;enter a decimal number\n&#8221;); 6         scanf(&#8220;%d&#8221;, &#38;a); 7         for(i=0;i&#60;=32;i++) 8         { 9                 b=a%2; 10                 printf(&#8220;binary number is %d\n&#8221;, b); 11                 a=a/2; 12         } 13         return 0; 14 } &#8230; <a href="https://www.emblogic.com/blog/02/decimal-to-binary-conversion/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1 #include &lt;stdio.h&gt;<br />
2 int main()<br />
3 {<br />
4         int i,a,b;<br />
5         printf(&#8220;enter a decimal number\n&#8221;);<br />
6         scanf(&#8220;%d&#8221;, &amp;a);<br />
7         for(i=0;i&lt;=32;i++)<br />
8         {<br />
9                 b=a%2;<br />
10                 printf(&#8220;binary number is %d\n&#8221;, b);<br />
11                 a=a/2;<br />
12         }<br />
13         return 0;<br />
14 }<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
&#8220;bin.c&#8221; 14L, 194C                                             11,3-17       All</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/decimal-to-binary-conversion/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>fibonacci series</title>
		<link>https://www.emblogic.com/blog/02/fibonacci-series/</link>
		<comments>https://www.emblogic.com/blog/02/fibonacci-series/#comments</comments>
		<pubDate>Sat, 21 Feb 2015 07:26:51 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12246</guid>
		<description><![CDATA[1 #include &#60;stdio.h&#62; 2 int main() 3 { 4         int i=0; 5         int j=1; 6         printf(&#8220;%d&#8221;, i); 7         printf(&#8221; %d&#8221;,j); 8         int k,a,sum; 9         for (k=0;k&#60;=10;k++) 10         { 11                 sum=i+j; 12                 a=sum; 13                 i=j; 14                 j=a; 15                 printf(&#8221; %d&#8221;,sum); 16         &#8230; <a href="https://www.emblogic.com/blog/02/fibonacci-series/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1 #include &lt;stdio.h&gt;<br />
2 int main()<br />
3 {<br />
4         int i=0;<br />
5         int j=1;<br />
6         printf(&#8220;%d&#8221;, i);<br />
7         printf(&#8221; %d&#8221;,j);<br />
8         int k,a,sum;<br />
9         for (k=0;k&lt;=10;k++)<br />
10         {<br />
11                 sum=i+j;<br />
12                 a=sum;<br />
13                 i=j;<br />
14                 j=a;<br />
15                 printf(&#8221; %d&#8221;,sum);<br />
16         }<br />
17 }<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
~<br />
&#8220;fibonacci.c&#8221; 17L, 186C                                      7,2-9         All</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/fibonacci-series/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>addition of distance in feet and inches</title>
		<link>https://www.emblogic.com/blog/02/addition-of-distance-in-feet-and-inches/</link>
		<comments>https://www.emblogic.com/blog/02/addition-of-distance-in-feet-and-inches/#comments</comments>
		<pubDate>Sat, 21 Feb 2015 06:06:01 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12241</guid>
		<description><![CDATA[1 head    2.1; 2 access; 3 symbols; 4 locks 5         emblogic:1.1; strict; 6 comment @ * @; 7 8 9 1.1 10 date    2015.02.21.05.39.49;    author emblogic;        state Exp; 11 branches; 12 next    ; 13 14 15 desc 16 @This programme &#8230; <a href="https://www.emblogic.com/blog/02/addition-of-distance-in-feet-and-inches/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1 head    2.1;<br />
2 access;<br />
3 symbols;<br />
4 locks<br />
5         emblogic:1.1; strict;<br />
6 comment @ * @;<br />
7<br />
8<br />
9 1.1<br />
10 date    2015.02.21.05.39.49;    author emblogic;        state Exp;<br />
11 branches;<br />
12 next    ;<br />
13<br />
14<br />
15 desc<br />
16 @This programme will calculate the distance in feet and inches<br />
17 @<br />
18<br />
19<br />
20 1.1<br />
21 log<br />
22 @Initial revision<br />
23 @<br />
24 text<br />
25 @#include&lt;stdio.h&gt;<br />
26 int main()<br />
27 {<br />
28         float  feet, inch,feet1,feet2,inch1,inch2;<br />
29         printf(&#8220;enter 1st distance in feet\n&#8221;);<br />
30         scanf(&#8220;%f&#8221;, &amp;feet1);<br />
31         printf(&#8220;enter 1st distance in inches\n&#8221;);<br />
32         scanf(&#8220;%f&#8221;, &amp;inch1);<br />
33         printf(&#8220;enter 2nd distance in feet\n&#8221;);<br />
34         scanf(&#8220;%f&#8221;, &amp;feet2);<br />
35         printf(&#8220;enter 2nd distance in inches\n&#8221;);<br />
36         scanf(&#8220;%f&#8221;, &amp;inch2);<br />
37         feet= feet1 + feet2;<br />
38         inch=inch1 + inch2;<br />
39         if (inch &gt; 12)<br />
40         {<br />
41         inch=inch &#8211; 12;<br />
42         feet++;<br />
43         printf(&#8220;%4.2f\n&#8221;, feet);<br />
44         printf(&#8220;%4.2f\n&#8221;, inch);<br />
45         }<br />
46         return 0;<br />
47         }<br />
48 @<br />
~<br />
&#8211; INSERT &#8211;                                                                                                                                                                  1,7-10        All</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/addition-of-distance-in-feet-and-inches/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Smaller and Greater among 5 Numbers</title>
		<link>https://www.emblogic.com/blog/02/smaller-and-greater-among-5-numbers/</link>
		<comments>https://www.emblogic.com/blog/02/smaller-and-greater-among-5-numbers/#comments</comments>
		<pubDate>Fri, 20 Feb 2015 05:47:49 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12217</guid>
		<description><![CDATA[#include&#60;stdio.h&#62; int main() { int a,b,c,d,e,largest,smallest; printf(&#8220;enter five integers\n&#8221;); scanf(&#8220;%d%d%d%d%d&#8221;, &#38;a,&#38;b,&#38;c,&#38;d,&#38;e); largest = a; if (b &#62; largest) { largest=b; } if (c &#62; largest) { largest=c; } if (d &#62; largest) { largest=d; } if (e &#62; largest) { &#8230; <a href="https://www.emblogic.com/blog/02/smaller-and-greater-among-5-numbers/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>#include&lt;stdio.h&gt;<br />
int main()<br />
{<br />
int a,b,c,d,e,largest,smallest;<br />
printf(&#8220;enter five integers\n&#8221;);<br />
scanf(&#8220;%d%d%d%d%d&#8221;, &amp;a,&amp;b,&amp;c,&amp;d,&amp;e);<br />
largest = a;<br />
if (b &gt; largest)<br />
{<br />
largest=b;<br />
}<br />
if (c &gt; largest)<br />
{<br />
largest=c;<br />
}<br />
if (d &gt; largest)<br />
{<br />
largest=d;<br />
}<br />
if (e &gt; largest)<br />
{<br />
largest=e;<br />
}<br />
printf(&#8220;largest number is  = %d\n&#8221;,largest);<br />
smallest = a;<br />
if (b &lt; smallest)<br />
{<br />
smallest=b;<br />
}<br />
if (c &lt; smallest)<br />
{<br />
smallest=c;<br />
}<br />
if (d &lt; smallest)<br />
{<br />
smallest=d;<br />
}<br />
if (e &lt; smallest)<br />
{<br />
smallest=e;<br />
}<br />
printf(&#8220;smallest number is  = %d\n&#8221;,smallest);<br />
return 0;<br />
}</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/smaller-and-greater-among-5-numbers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>weekly wage with Overtime</title>
		<link>https://www.emblogic.com/blog/02/weekly-wage-with-overtime/</link>
		<comments>https://www.emblogic.com/blog/02/weekly-wage-with-overtime/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 10:55:59 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12211</guid>
		<description><![CDATA[&#160; &#160; 1 #include &#60;stdio.h&#62; 2 int main() 3 { 4         int a,b,c, pay1, pay2, pay; 5         printf(&#8220;enter daily working hours\n&#8221;); 6         scanf(&#8220;%d&#8221;, &#38;a); 7         b= a * 6; 8         printf(&#8220;weakly hours are %d\n&#8221;, b); 9         if (b &#62; 40) &#8230; <a href="https://www.emblogic.com/blog/02/weekly-wage-with-overtime/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>&nbsp;</p>
<p>&nbsp;</p>
<p>1 #include &lt;stdio.h&gt;<br />
2 int main()<br />
3 {<br />
4         int a,b,c, pay1, pay2, pay;<br />
5         printf(&#8220;enter daily working hours\n&#8221;);<br />
6         scanf(&#8220;%d&#8221;, &amp;a);<br />
7         b= a * 6;<br />
8         printf(&#8220;weakly hours are %d\n&#8221;, b);<br />
9         if (b &gt; 40)<br />
10         {<br />
11         c= b &#8211; 40;<br />
12         printf(&#8220;%d is overtime\n&#8221;, c);<br />
13         }<br />
14         else<br />
15         {<br />
16         c=0;<br />
17         }<br />
18         if (b &gt; 40)<br />
19         {<br />
20         pay1= 40 * 300;<br />
21         pay2=c * 400;<br />
22         pay= pay1 + pay2;<br />
23         printf(&#8220;pay is %d&#8221;,pay );<br />
24         }<br />
25         else<br />
26         {<br />
27         pay = b * 300;<br />
28         printf(&#8220;pay is %d&#8221;, pay);}return 0;<br />
29         return 0;<br />
30 }<br />
~</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/weekly-wage-with-overtime/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Area of Triangle or Square</title>
		<link>https://www.emblogic.com/blog/02/area-of-triangle-or-square/</link>
		<comments>https://www.emblogic.com/blog/02/area-of-triangle-or-square/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 10:52:53 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12208</guid>
		<description><![CDATA[1 #include &#60;stdio.h&#62; 2 int main() 3 { 4         int side, base, height,choice,AOT,AOS; 5         printf(&#8220;enter side\n&#8221;); 6         scanf(&#8220;%d&#8221;, &#38;side); 7         printf(&#8220;enter base\n&#8221;); 8         scanf(&#8220;%d&#8221;, &#38;base); 9         printf(&#8220;enter height\n&#8221;); 10         scanf(&#8220;%d&#8221;, &#38;height); 11         printf(&#8220;1=AOT\n&#8221;); 12         printf(&#8220;2=AOS\n&#8221;); 13         scanf(&#8220;%d&#8221;,&#38;choice); 14         switch(choice) 15         &#8230; <a href="https://www.emblogic.com/blog/02/area-of-triangle-or-square/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1 #include &lt;stdio.h&gt;<br />
2 int main()<br />
3 {<br />
4         int side, base, height,choice,AOT,AOS;<br />
5         printf(&#8220;enter side\n&#8221;);<br />
6         scanf(&#8220;%d&#8221;, &amp;side);<br />
7         printf(&#8220;enter base\n&#8221;);<br />
8         scanf(&#8220;%d&#8221;, &amp;base);<br />
9         printf(&#8220;enter height\n&#8221;);<br />
10         scanf(&#8220;%d&#8221;, &amp;height);<br />
11         printf(&#8220;1=AOT\n&#8221;);<br />
12         printf(&#8220;2=AOS\n&#8221;);<br />
13         scanf(&#8220;%d&#8221;,&amp;choice);<br />
14         switch(choice)<br />
15         {<br />
16                 case 1: AOT=(base*height)/2;<br />
17                 printf(&#8220;%d&#8221;, AOT);<br />
18                 break;<br />
19                 case 2: AOS=side*side;<br />
20                 printf(&#8220;%d&#8221;, AOS);<br />
21                 break;<br />
22                 }<br />
23                 return 0;<br />
24         }<br />
~</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/area-of-triangle-or-square/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Reverse the digits</title>
		<link>https://www.emblogic.com/blog/02/reverse-the-digits/</link>
		<comments>https://www.emblogic.com/blog/02/reverse-the-digits/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 10:43:54 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12205</guid>
		<description><![CDATA[1        #include &#60;stdio.h&#62; 2        int main() 3        { 4         long int a=0; 5         long int n; 6         printf(&#8220;enter a number\n&#8221;); 7         scanf(&#8220;%ld&#8221;, &#38;n); 8         while(n!=0) 9         { 10                 a=a*10; 11                 a=a+(n%10); 12                 n=n/10; 13                 } 14                 printf(&#8220;%ld&#8221;,a); 15                 return 0; &#8230; <a href="https://www.emblogic.com/blog/02/reverse-the-digits/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1        #include &lt;stdio.h&gt;<br />
2        int main()<br />
3        {<br />
4         long int a=0;<br />
5         long int n;<br />
6         printf(&#8220;enter a number\n&#8221;);<br />
7         scanf(&#8220;%ld&#8221;, &amp;n);<br />
8         while(n!=0)<br />
9         {<br />
10                 a=a*10;<br />
11                 a=a+(n%10);<br />
12                 n=n/10;<br />
13                 }<br />
14                 printf(&#8220;%ld&#8221;,a);<br />
15                 return 0;<br />
16                 }</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/reverse-the-digits/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Number: Positive or Negative</title>
		<link>https://www.emblogic.com/blog/02/number-positive-or-negative/</link>
		<comments>https://www.emblogic.com/blog/02/number-positive-or-negative/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 10:42:11 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12203</guid>
		<description><![CDATA[1        #include &#60;stdio.h&#62; 2        int main() 3        { 4         int a; 5         printf(&#8220;enter a number\n&#8221;); 6         scanf(&#8220;%d&#8221;, &#38;a); 7         if(a &#62; 0) 8         { 9         printf(&#8220;it is positive\n&#8221;); 10         } 11         else if(a &#60; 0) 12         { 13                 printf(&#8220;it is &#8230; <a href="https://www.emblogic.com/blog/02/number-positive-or-negative/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1        #include &lt;stdio.h&gt;<br />
2        int main()<br />
3        {<br />
4         int a;<br />
5         printf(&#8220;enter a number\n&#8221;);<br />
6         scanf(&#8220;%d&#8221;, &amp;a);<br />
7         if(a &gt; 0)<br />
8         {<br />
9         printf(&#8220;it is positive\n&#8221;);<br />
10         }<br />
11         else if(a &lt; 0)<br />
12         {<br />
13                 printf(&#8220;it is negative\n&#8221;);<br />
14         }<br />
15         else<br />
16         {<br />
17                 printf(&#8220;it is zero\n&#8221;);<br />
18         }<br />
19 }<br />
~</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/number-positive-or-negative/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>add distance in feets and inches</title>
		<link>https://www.emblogic.com/blog/02/add-distance-in-feets-and-inches/</link>
		<comments>https://www.emblogic.com/blog/02/add-distance-in-feets-and-inches/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 10:40:28 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12199</guid>
		<description><![CDATA[1         #include&#60;stdio.h&#62; 2          int main() 3         { 4         float  feet, inch,feet1,feet2,inch1,inch2; 5         printf(&#8220;enter 1st distance in feet\n&#8221;); 6         scanf(&#8220;%f&#8221;, &#38;feet1); 7         printf(&#8220;enter 1st distance in inches\n&#8221;); 8         scanf(&#8220;%f&#8221;, &#38;inch1); 9         printf(&#8220;enter 2nd distance in feet\n&#8221;); 10         scanf(&#8220;%f&#8221;, &#38;feet2); 11         printf(&#8220;enter &#8230; <a href="https://www.emblogic.com/blog/02/add-distance-in-feets-and-inches/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>1         #include&lt;stdio.h&gt;<br />
2          int main()<br />
3         {<br />
4         float  feet, inch,feet1,feet2,inch1,inch2;<br />
5         printf(&#8220;enter 1st distance in feet\n&#8221;);<br />
6         scanf(&#8220;%f&#8221;, &amp;feet1);<br />
7         printf(&#8220;enter 1st distance in inches\n&#8221;);<br />
8         scanf(&#8220;%f&#8221;, &amp;inch1);<br />
9         printf(&#8220;enter 2nd distance in feet\n&#8221;);<br />
10         scanf(&#8220;%f&#8221;, &amp;feet2);<br />
11         printf(&#8220;enter 2nd distance in inches\n&#8221;);<br />
12         scanf(&#8220;%f&#8221;, &amp;inch2);<br />
13         feet= feet1 + feet2;<br />
14         inch=inch1 + inch2;<br />
15         if (inch &gt; 12)<br />
16         {<br />
17         inch=inch &#8211; 12;<br />
18         feet++;<br />
19         printf(&#8220;%4.2f\n&#8221;, feet);<br />
20         printf(&#8220;%4.2f\n&#8221;, inch);<br />
21         }<br />
22         return 0;<br />
23         }<br />
~<br />
~<br />
~</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/add-distance-in-feets-and-inches/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>leap year or not</title>
		<link>https://www.emblogic.com/blog/02/leap-year-or-not/</link>
		<comments>https://www.emblogic.com/blog/02/leap-year-or-not/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 07:18:17 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12195</guid>
		<description><![CDATA[#include &#60;stdio.h&#62; int main() { int year; printf(&#8220;enter year\n&#8221;); scanf(&#8220;%d&#8221;, &#38;year); if(year % 4==0 &#124;&#124; year % 100== 0) printf(&#8220;it is leap year\n&#8221;); else printf(&#8220;it is non leap year\n&#8221;); return 0; }]]></description>
				<content:encoded><![CDATA[<p>#include &lt;stdio.h&gt;<br />
int main()<br />
{<br />
int year;<br />
printf(&#8220;enter year\n&#8221;);<br />
scanf(&#8220;%d&#8221;, &amp;year);<br />
if(year % 4==0 || year % 100== 0)<br />
printf(&#8220;it is leap year\n&#8221;);<br />
else<br />
printf(&#8220;it is non leap year\n&#8221;);</p>
<p>return 0;<br />
}</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/leap-year-or-not/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>power of 2</title>
		<link>https://www.emblogic.com/blog/02/power-of-2/</link>
		<comments>https://www.emblogic.com/blog/02/power-of-2/#comments</comments>
		<pubDate>Thu, 19 Feb 2015 06:48:45 +0000</pubDate>
		<dc:creator><![CDATA[Nishant Khanna]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=12192</guid>
		<description><![CDATA[#include &#60;stdio.h&#62; int main() { int a,i; printf(&#8220;enter a number\n&#8221;); scanf(&#8220;%d&#8221;, &#38;a); for (i=0;i&#60;=a;i++) { a=a/2; } if (a%2==0) printf(&#8220;it is power of 2\n&#8221;); else printf(&#8220;it is not\n&#8221;); return 0; }]]></description>
				<content:encoded><![CDATA[<p>#include &lt;stdio.h&gt;<br />
int main()<br />
{<br />
int a,i;<br />
printf(&#8220;enter a number\n&#8221;);<br />
scanf(&#8220;%d&#8221;, &amp;a);<br />
for (i=0;i&lt;=a;i++)<br />
{<br />
a=a/2;<br />
}<br />
if (a%2==0)<br />
printf(&#8220;it is power of 2\n&#8221;);<br />
else<br />
printf(&#8220;it is not\n&#8221;);</p>
<p>return 0;<br />
}</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/02/power-of-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
