<?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; Pankaj Suryawanshi</title>
	<atom:link href="https://www.emblogic.com/blog/author/pankajssuryawanshi/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>What is bss (Block Storage Start) ?</title>
		<link>https://www.emblogic.com/blog/08/what-is-bss-block-storage-start/</link>
		<comments>https://www.emblogic.com/blog/08/what-is-bss-block-storage-start/#comments</comments>
		<pubDate>Tue, 16 Aug 2016 19:14:21 +0000</pubDate>
		<dc:creator><![CDATA[Pankaj Suryawanshi]]></dc:creator>
				<category><![CDATA[Data Structures with C]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=13664</guid>
		<description><![CDATA[The .bss segment stores all uninitialized global, static, and external variables (declared with extern keyword). Global, external, and static variable are by default initialized to zero. This section occupies no actual space in the object file. it is merely a &#8230; <a href="https://www.emblogic.com/blog/08/what-is-bss-block-storage-start/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p style="text-align: justify">The .bss segment stores all uninitialized global, static, and external variables (declared with extern keyword). Global, external, and static variable are by default initialized to zero. This section occupies no actual space in the object file. it is merely a place holder. uninitialized variables do not have to occupy any actual disk space in the object file.<br />
The use of the term .bss to denote uninitialized data is universal. It Stands &#8220;Block Storage Start&#8221;.</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/08/what-is-bss-block-storage-start/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Matrix Addition using 2D Array with Pointers</title>
		<link>https://www.emblogic.com/blog/08/matrix-addition-using-2d-array-with-pointers/</link>
		<comments>https://www.emblogic.com/blog/08/matrix-addition-using-2d-array-with-pointers/#comments</comments>
		<pubDate>Sun, 14 Aug 2016 19:39:04 +0000</pubDate>
		<dc:creator><![CDATA[Pankaj Suryawanshi]]></dc:creator>
				<category><![CDATA[Data Structures with C]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=13659</guid>
		<description><![CDATA[#include #include int main() { int r,c,k; printf(&#8220;enter the size of rows\n&#8221;); scanf(&#8220;%d&#8221;,&#38;r); printf(&#8220;enter the size of columns\n&#8221;); scanf(&#8220;%d&#8221;,&#38;c); int **a,**b,**d,i,j; a=(int **)malloc(sizeof(int*)*3); if(!a) { perror(&#8220;malloc&#8221;); goto x; } for(i=0;i&#60;3;i++) *(a+i)=(int *)malloc(sizeof(int)*3); if(!(*(a+i))) { perror(&#34;malloc&#34;); goto x; } b=(int **)malloc(sizeof(int*)*3); &#8230; <a href="https://www.emblogic.com/blog/08/matrix-addition-using-2d-array-with-pointers/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
				<content:encoded><![CDATA[<p>#include<br />
#include</p>
<p>int main()<br />
{<br />
	int r,c,k;<br />
	printf(&#8220;enter the size of rows\n&#8221;);<br />
	scanf(&#8220;%d&#8221;,&amp;r);<br />
	printf(&#8220;enter the size of columns\n&#8221;);<br />
	scanf(&#8220;%d&#8221;,&amp;c);<br />
	int **a,**b,**d,i,j;<br />
	a=(int **)malloc(sizeof(int*)*3);<br />
	if(!a)<br />
	{<br />
		perror(&#8220;malloc&#8221;);<br />
		goto x;<br />
	}<br />
	for(i=0;i&lt;3;i++)<br />
	*(a+i)=(int *)malloc(sizeof(int)*3);<br />
	if(!(*(a+i)))<br />
	{<br />
		perror(&quot;malloc&quot;);<br />
		goto x;<br />
	}<br />
	b=(int **)malloc(sizeof(int*)*3);<br />
	if(!b)<br />
	{<br />
		perror(&quot;malloc&quot;);<br />
		goto x;<br />
	}<br />
	for(i=0;i&lt;3;i++)<br />
	*(b+i)=(int *)malloc(sizeof(int)*3);<br />
	if(!(*(b+i)))<br />
	{<br />
		perror(&quot;malloc&quot;);<br />
		goto x;<br />
	}<br />
	d=(int **)malloc(sizeof(int*)*3);<br />
	if(!d)<br />
	{<br />
		perror(&quot;malloc&quot;);<br />
		goto x;<br />
	}<br />
	for(i=0;i&lt;3;i++)<br />
	*(d+i)=(int *)malloc(sizeof(int)*3);<br />
	if(!(*(d+i)))<br />
	{<br />
		perror(&quot;malloc&quot;);<br />
		goto x;<br />
	}</p>
<p>	printf(&quot;enter the element of 1st matrix\n&quot;);<br />
	for(i=0;i&lt;r;i++)<br />
		{<br />
			for(j=0;j&lt;c;j++)<br />
				{<br />
					scanf(&quot;%d&quot;,*(a+i)+j);<br />
				}<br />
		}</p>
<p>	printf(&quot;enter the element of 2nd matrix\n&quot;);<br />
	for(i=0;i&lt;r;i++)<br />
		{<br />
			for(j=0;j&lt;c;j++)<br />
				{<br />
					scanf(&quot;%d&quot;,*(b+i)+j);<br />
				}<br />
		}</p>
<p>	printf(&quot;the element of 1st matrix\n&quot;);<br />
	for(i=0;i&lt;r;i++)<br />
		{<br />
			for(j=0;j&lt;c;j++)<br />
				{<br />
					printf(&quot;%d\t&quot;,*(*(a+i)+j));<br />
				}<br />
			printf(&quot;\n&quot;);<br />
		}</p>
<p>	printf(&quot;\nthe element of 2nd matrix\n&quot;);<br />
	for(i=0;i&lt;r;i++)<br />
		{<br />
			for(j=0;j&lt;c;j++)<br />
				{<br />
					printf(&quot;%d\t&quot;,*(*(b+i)+j));<br />
				}<br />
			printf(&quot;\n&quot;);<br />
		}</p>
<p>			for(i=0;i&lt;r;i++)<br />
			{</p>
<p>				for(j=0;j&lt;c;j++)</p>
<p>				{<br />
					*((*(d+i)+j)) = *((*(a+i))+j) + *((*(b+i))+j);</p>
<p>				}<br />
			}</p>
<p>	printf(&quot;\naddition is\n&quot;);</p>
<p>			for(i=0;i&lt;r;i++)<br />
			{<br />
			for(j=0;j&lt;c;j++)</p>
<p>				{<br />
					printf(&quot;%d\t&quot;,*((*(d+i))+j));<br />
				}<br />
			printf(&quot;\n&quot;);<br />
			}<br />
return 0;<br />
x:<br />
	return -1;<br />
}</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/08/matrix-addition-using-2d-array-with-pointers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>write a program for selection sort</title>
		<link>https://www.emblogic.com/blog/08/write-a-program-for-selection-sort/</link>
		<comments>https://www.emblogic.com/blog/08/write-a-program-for-selection-sort/#comments</comments>
		<pubDate>Wed, 03 Aug 2016 16:39:33 +0000</pubDate>
		<dc:creator><![CDATA[Pankaj Suryawanshi]]></dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.emblogic.com/blog/?p=13645</guid>
		<description><![CDATA[#include&#60;stdio.h&#62; int main() { int a[5]; int i,j,loc,smallest,temp; printf(&#8220;enter array element&#8221;); for(i=0;i&#60;5;i++) { scanf(&#8220;%d&#8221;,&#38;a[i]); } for(j=0;j&#60;5;j++) { smallest=a[j]; for(i=j+1;i&#60;5;i++) { if(a[i]&#60;smallest) { smallest=a[i]; loc=i; temp=a[j]; a[j]=a[loc]; a[loc]=temp; } } printf(&#8220;sorted array is[%d]=%d\n&#8221;,j,a[j]); } return 0; }]]></description>
				<content:encoded><![CDATA[<p>#include&lt;stdio.h&gt;</p>
<p>int main()<br />
{<br />
int a[5];<br />
int i,j,loc,smallest,temp;<br />
printf(&#8220;enter array element&#8221;);<br />
for(i=0;i&lt;5;i++)<br />
{<br />
scanf(&#8220;%d&#8221;,&amp;a[i]);<br />
}<br />
for(j=0;j&lt;5;j++)<br />
{<br />
smallest=a[j];<br />
for(i=j+1;i&lt;5;i++)<br />
{<br />
if(a[i]&lt;smallest)<br />
{<br />
smallest=a[i];<br />
loc=i;<br />
temp=a[j];<br />
a[j]=a[loc];<br />
a[loc]=temp;</p>
<p>}</p>
<p>}<br />
printf(&#8220;sorted array is[%d]=%d\n&#8221;,j,a[j]);<br />
}<br />
return 0;<br />
}</p>
]]></content:encoded>
			<wfw:commentRss>https://www.emblogic.com/blog/08/write-a-program-for-selection-sort/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
