<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:blogger='http://schemas.google.com/blogger/2008' xmlns:georss='http://www.georss.org/georss' xmlns:gd="http://schemas.google.com/g/2005" xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-4219296328889071497</id><updated>2024-09-12T04:57:44.238+05:30</updated><category term="C\C++"/><category term="Developer"/><category term="code"/><category term="Programming"/><category term="CUDA"/><category term="Garbage"/><category term="Graphics"/><category term="Integral"/><category term="Microsoft"/><category term="Nvidia"/><category term="Visual Studio"/><category term="Algorithm"/><category term="Image"/><category term="Java"/><category term="Languages"/><category term="SAT"/><category term="UML"/><category term=".NET"/><category term="2011"/><category term="ADVANCED"/><category term="AIYEHUM"/><category term="Brushfire"/><category term="CLI"/><category term="CORE"/><category term="Casts"/><category term="Challenge"/><category term="College"/><category term="Demo"/><category term="Embedded C"/><category term="Engineering"/><category term="Engineers"/><category term="Flood-fill"/><category term="Friend"/><category term="HLL"/><category term="Header"/><category term="Humanitarian"/><category term="IDE"/><category term="IEEE"/><category term="Interrupts"/><category term="John McCarthy"/><category term="Library"/><category term="Memory Leaks"/><category term="Mingw"/><category term="Mutable"/><category term="Projects"/><category term="Robotics"/><category term="Studio"/><category term="Templates"/><category term="TurboC"/><category term="VPL"/><category term="Volatile"/><category term="Wavefront"/><category term="Windows 7"/><category term="Young"/><category term="arithmetic"/><category term="collection"/><category term="dereferenced"/><category term="pointer"/><category term="sourceforge.net"/><category term="threads"/><title type='text'>Apurv Saxena&#39;s Blog</title><subtitle type='html'>Learn, Share, Help, Teach.</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default?redirect=false'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><link rel='next' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default?start-index=26&amp;max-results=25&amp;redirect=false'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>30</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-5820114829078341763</id><published>2012-09-30T18:36:00.003+05:30</published><updated>2012-09-30T18:51:36.983+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="code"/><category scheme="http://www.blogger.com/atom/ns#" term="Programming"/><title type='text'>Matrix Multiplication: 3x3 and 3x1</title><summary type="text">

Formula:

| a11 a12 a13 | &amp;nbsp; &amp;nbsp;| b1 | &amp;nbsp; &amp;nbsp;| a11*b1 + a12*b2 + a13*b3 |
| a21 a22 a23 | x | b2 | = | a21*b1 + a22*b2 + a23*b3 |
| a31 a32 a33 | &amp;nbsp; &amp;nbsp;| b3 | &amp;nbsp; &amp;nbsp;| a31*b1 + a32*b2 + a33*b3 | 

For arrays:

| a11 a12 a13 | &amp;nbsp; &amp;nbsp; &amp;nbsp;| a[0][0] a[0][1] a[0][2] |
| a21 a22 a23 | &amp;nbsp;= &amp;nbsp;| a[1][0] a[1][1] a[1][2] |
| a31 a32 a33 | &amp;nbsp; &amp;nbsp; &amp;nbsp;| </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/5820114829078341763/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/09/matrix-multiplication-3x3-and-3x1.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5820114829078341763'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5820114829078341763'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/09/matrix-multiplication-3x3-and-3x1.html' title='Matrix Multiplication: 3x3 and 3x1'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-3132443883765458549</id><published>2012-09-30T18:05:00.003+05:30</published><updated>2012-09-30T18:07:04.346+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="code"/><category scheme="http://www.blogger.com/atom/ns#" term="Programming"/><title type='text'>Matrix Inverse - 3x3</title><summary type="text">

Operations of&amp;nbsp;matrices&amp;nbsp;of 3x3 are very common in day to day applications.&amp;nbsp;Because the dimensions are already known, its better to avoid using a for-loop because of the extra computation involved in finding the subscript values.
Following is a quick formula for the inverse of a 3x3 matrix (implemented as a 2D array).

Formula

The inverse of a 3x3 matrix:
| a11 a12 a13 |-1 &amp;nbsp; </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/3132443883765458549/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/09/matrix-inverse-3x3.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3132443883765458549'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3132443883765458549'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/09/matrix-inverse-3x3.html' title='Matrix Inverse - 3x3'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-4173881948952868505</id><published>2012-08-11T19:46:00.001+05:30</published><updated>2012-08-11T19:48:47.036+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="arithmetic"/><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="code"/><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="pointer"/><category scheme="http://www.blogger.com/atom/ns#" term="Programming"/><title type='text'>Forgotten rules of C/C++: Part 1</title><summary type="text">


Following is a list of important points people find very
convenient to forget. This is the first article of a series



·&amp;nbsp; &amp;nbsp;For bitwise operations, operand is promoted to
&quot;int&quot; before evaluation.

unsigned char I = 0x80;
printf(&quot;%d&quot;, i&amp;lt;&lt;1 nbsp=&quot;nbsp&quot;&gt; &amp;nbsp;256&lt;/1&gt;



·&amp;nbsp; &amp;nbsp;printf(5 + &quot;intelligent&quot;); &amp;nbsp;=&amp;gt; “ligent”

&amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;nbsp;Number specifies </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/4173881948952868505/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/08/forgotten-rules-of-cc-part-1.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/4173881948952868505'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/4173881948952868505'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/08/forgotten-rules-of-cc-part-1.html' title='Forgotten rules of C/C++: Part 1'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-8616099381993839117</id><published>2012-06-28T16:29:00.003+05:30</published><updated>2012-06-29T12:40:41.430+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Algorithm"/><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="code"/><category scheme="http://www.blogger.com/atom/ns#" term="Integral"/><category scheme="http://www.blogger.com/atom/ns#" term="Programming"/><category scheme="http://www.blogger.com/atom/ns#" term="SAT"/><category scheme="http://www.blogger.com/atom/ns#" term="UML"/><title type='text'>Code Snippet - Summed Area Table</title><summary type="text">
SUMMED AREA TABLE
Using the method described here, I have written the following code to calculate a summed area table. A sample image table of 5x5 dimensions has been assumed for simplicity. The code snippet and its results are given below.

CODE
// assumed height and width of the input table
#define height 6
#define width 6

// input matrix - 5x5
long matrix[
height&amp;nbsp;- 1][width&amp;nbsp;-1] = {</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/8616099381993839117/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/code-snippet-summed-area-table.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/8616099381993839117'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/8616099381993839117'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/code-snippet-summed-area-table.html' title='Code Snippet - Summed Area Table'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgQt_cJIY2M5Q3mIPhrkpt2q2zZOuAC6l4Gil0LuuGdCPuAHZ6PUWBQ8YAJyGUWNX6icH_w8o017p2GwVZ2s32vmldERuD_Ozm2BHFE6QJYTKdSUHj7j3mprrU5JAJi-Ejn5tDhct23EktQ/s72-c/Untitled.png" height="72" width="72"/><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-5855979833027463276</id><published>2012-06-26T14:42:00.002+05:30</published><updated>2012-06-28T16:32:34.050+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="CUDA"/><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="Graphics"/><category scheme="http://www.blogger.com/atom/ns#" term="Image"/><category scheme="http://www.blogger.com/atom/ns#" term="Integral"/><category scheme="http://www.blogger.com/atom/ns#" term="Programming"/><category scheme="http://www.blogger.com/atom/ns#" term="SAT"/><title type='text'>Summed Area Table</title><summary type="text">




Definition

Summed Area Table is both an algorithm and data
structure used in reference with the concept of Integral images. SAT is a name
used to refer to both the method and the result of conversion of an image to an
integral image.



SAT – The Algorithm

Summed Area Table (or Integral Image) is an algorithm
applied on a 2-dimensional array of elements. It’s a simple, single pass
</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/5855979833027463276/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/summed-area-table.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5855979833027463276'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5855979833027463276'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/summed-area-table.html' title='Summed Area Table'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-1490939231847364846</id><published>2012-06-26T14:37:00.002+05:30</published><updated>2012-06-27T14:57:57.182+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="Graphics"/><category scheme="http://www.blogger.com/atom/ns#" term="Image"/><category scheme="http://www.blogger.com/atom/ns#" term="Integral"/><title type='text'>Integral Image</title><summary type="text">



Definition

An Integral image is one that is conducive to frequent
summation operations. Any rectangular subset of such an image can be evaluated
in constant time. Such an image is achieved by converting its pixel values to a
SAT (summed area table) by simple interpolation of known pixel values.

An Integral Image is defined as,

I(x,y) = i(x,y) + I(x-1,y) + I(x,y-1) - I(x-1,y-1)

Where, 

i(</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/1490939231847364846/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/integral-image.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1490939231847364846'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1490939231847364846'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/integral-image.html' title='Integral Image'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-8893221887653758190</id><published>2012-06-25T21:02:00.001+05:30</published><updated>2012-06-25T21:02:01.836+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="CUDA"/><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="Nvidia"/><category scheme="http://www.blogger.com/atom/ns#" term="Visual Studio"/><title type='text'>How I Installed CUDA on my PC</title><summary type="text">


Platform: Windows 7 (32 bit)

CUDA Hardware: None yet, will use simulator till then.



1 Prologue

&amp;nbsp; &amp;nbsp; &amp;nbsp; Before you start, get a clear idea about CUDA and its features from here.



2 Installation

2.1 Software setups

Basic step is
to download the latest SDK and to choose an appropriate Toolkit according to
your hardware’s compute capability. Download links are given here. 

</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/8893221887653758190/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/how-i-installed-cuda-on-my-pc.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/8893221887653758190'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/8893221887653758190'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/how-i-installed-cuda-on-my-pc.html' title='How I Installed CUDA on my PC'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-826980179438824723</id><published>2012-06-25T20:57:00.000+05:30</published><updated>2012-06-25T20:57:34.708+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="code"/><category scheme="http://www.blogger.com/atom/ns#" term="CUDA"/><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="Nvidia"/><category scheme="http://www.blogger.com/atom/ns#" term="Visual Studio"/><title type='text'>CUDA Emulator</title><summary type="text">
The CUDA emulator&amp;nbsp;is a software that duplicates (or&amp;nbsp;emulates) the functions of a computer system with a CUDA-enabled card&amp;nbsp;in a computer system with no such hardware, so that the emulated behavior closely resembles the behavior of the real system. This software package is mainly aimed to empower developers and students who do not have access to Nvidia GPU&#39;s.

Initially, the CUDA </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/826980179438824723/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/cuda-emulator.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/826980179438824723'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/826980179438824723'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/cuda-emulator.html' title='CUDA Emulator'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-1939252160998076636</id><published>2012-06-25T20:15:00.001+05:30</published><updated>2012-06-25T20:16:04.089+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="CUDA"/><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="Nvidia"/><title type='text'>What is CUDA?</title><summary type="text">


The article serves as a prologue for beginners. Please note that this is
a primer not a tutorial, tutorials will follow.



CUDA (Compute Unified Device Architecture) is a parallel processing
architecture that gives developers the ability to process their applications on
CUDA-enabled processors. Basically it provides “us” the ability to process
parallely, not just the CPU. The CPU and GPU are </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/1939252160998076636/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/what-is-cuda.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1939252160998076636'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1939252160998076636'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2012/06/what-is-cuda.html' title='What is CUDA?'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-1689244682661185329</id><published>2011-02-16T11:27:00.000+05:30</published><updated>2011-02-16T11:27:57.697+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="College"/><category scheme="http://www.blogger.com/atom/ns#" term="Engineering"/><category scheme="http://www.blogger.com/atom/ns#" term="Projects"/><category scheme="http://www.blogger.com/atom/ns#" term="UML"/><title type='text'>Using UML in Projects</title><summary type="text">Well the obvious question by any fresh student\developer is not how but WHY??? UML is used extensively in project&amp;nbsp;development&amp;nbsp;as a general programming practice, where you pictorially represent your entire project as a series of diagrams.


What is UML?
Seriously if&amp;nbsp;you&#39;re&amp;nbsp;still searching then I&#39;d suggest&amp;nbsp;Wikipedia. the most apt definition i found was:
The Unified Modeling</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/1689244682661185329/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2011/02/using-uml-in-projects.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1689244682661185329'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1689244682661185329'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2011/02/using-uml-in-projects.html' title='Using UML in Projects'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-3467733959384741115</id><published>2011-01-29T23:09:00.000+05:30</published><updated>2011-01-29T23:09:11.237+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="2011"/><category scheme="http://www.blogger.com/atom/ns#" term="AIYEHUM"/><category scheme="http://www.blogger.com/atom/ns#" term="Challenge"/><category scheme="http://www.blogger.com/atom/ns#" term="Engineers"/><category scheme="http://www.blogger.com/atom/ns#" term="Humanitarian"/><category scheme="http://www.blogger.com/atom/ns#" term="IEEE"/><category scheme="http://www.blogger.com/atom/ns#" term="Young"/><title type='text'>IEEE - AIYEHUM 2011</title><summary type="text">IEEE Bangalore is&amp;nbsp;organizing&amp;nbsp;AIYEHUM 2011, or The&amp;nbsp;All India Young Engineers’ Humanitarian Challenge to encourage students to solve real world problems and promote their ideas by providing all necessary means to implement them. These projects will be judged on the basis of their impact on humanity and their creativity, and several other factors like sustainability and cost.

 </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/3467733959384741115/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2011/01/ieee-aiyehum-2011.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3467733959384741115'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3467733959384741115'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2011/01/ieee-aiyehum-2011.html' title='IEEE - AIYEHUM 2011'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-5162266017370246131</id><published>2011-01-29T22:39:00.000+05:30</published><updated>2011-01-29T22:39:06.967+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="sourceforge.net"/><title type='text'>Sourceforge.net attacked!</title><summary type="text">This was a direct attack to Open Source website sourceforge.net that hosts opensource projects made by anyone interested in making such projects. On&amp;nbsp;Wednesday, the website reported exploit of several servers and fears compromise of user passwords. Hence all users have been asked to renew their passwords via the link:
https://sourceforge.net/account/registration/recover.php
Besides this, many</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/5162266017370246131/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2011/01/sourceforgenet-attacked.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5162266017370246131'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5162266017370246131'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2011/01/sourceforgenet-attacked.html' title='Sourceforge.net attacked!'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-4668371399297770179</id><published>2011-01-26T03:39:00.000+05:30</published><updated>2011-01-26T03:39:50.137+05:30</updated><title type='text'>Google Summer of CodeTM 2011</title><summary type="text">While surfing i came across this completely amazing concept by google, actually just another to add to their existing list of ideas. Eventually I also felt the need to promote this. Imagine being paid to express your coding abilities on open-source environments, i.e. to be paid stipends to work on open source programs.

An excellent opportunity for college students to gain experience&amp;nbsp;on&amp;nbsp</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/4668371399297770179/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2011/01/google-summer-of-codetm-2011.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/4668371399297770179'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/4668371399297770179'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2011/01/google-summer-of-codetm-2011.html' title='Google Summer of CodeTM 2011'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-3420805554883364938</id><published>2010-11-19T23:17:00.002+05:30</published><updated>2010-11-19T23:24:22.689+05:30</updated><title type='text'>Exception Handling Basics</title><summary type="text">Basics:
Events are abnormal activities      that occur during runtime.
Errors are rather cataclysmic;      there is no recovery or handling.
Exceptions are the unwanted      problems in a program that don’t cause irrecoverable damage. Exceptions      are, in effect, just errors that can be handled by guessing their      occurrence in a particular section of code. They are of two types, Checked</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/3420805554883364938/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/11/exception-handling-basics.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3420805554883364938'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3420805554883364938'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/11/exception-handling-basics.html' title='Exception Handling Basics'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-7076348765589473946</id><published>2010-11-16T17:45:00.000+05:30</published><updated>2010-11-16T17:45:31.252+05:30</updated><title type='text'>GO Programming Language</title><summary type="text">GO is a systems&amp;nbsp;programming language by Google.Inc.&amp;nbsp;
The official website&amp;nbsp;http://golang.org/&amp;nbsp;describes this language as&amp;nbsp;simple,&amp;nbsp;fast,&amp;nbsp;concurrent, safe, fun, open source and what not. So far it has not been developed for the Windows platform, so if interested, it means you need the good ol&#39; Linux.

GO is basically an OOPs based language that looks a lot like Java</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/7076348765589473946/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/11/go-programming-language.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7076348765589473946'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7076348765589473946'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/11/go-programming-language.html' title='GO Programming Language'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-5404572105362869771</id><published>2010-11-16T17:33:00.000+05:30</published><updated>2010-11-16T17:33:10.356+05:30</updated><title type='text'>Stack Template Class</title><summary type="text">The stack template I made. Overflow conditions have been skipped as they practically dont occur on modern PC&#39;s.


Please specify class T when you declare the object, for example for &#39;int&#39;,
stack&amp;nbsp;&amp;nbsp;&amp;lt;&amp;nbsp;type_name&amp;nbsp;&amp;gt;&amp;nbsp;stack_object_name;

template&amp;nbsp;&amp;lt;&amp;nbsp;class T&amp;nbsp;&amp;gt;class stack{ struct node {  T data;  struct node *next; }*top;
public: stack() {&amp;nbsp;</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/5404572105362869771/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/11/stack-template-class.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5404572105362869771'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/5404572105362869771'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/11/stack-template-class.html' title='Stack Template Class'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-1206504394311783049</id><published>2010-10-26T16:43:00.004+05:30</published><updated>2010-10-26T17:19:25.513+05:30</updated><title type='text'>Queue Template</title><summary type="text">The queue template I made. Overflow conditions have been skipped as they practically dont occur on modern PC&#39;s.

Please specify class T when you declare the object, for example for &#39;int&#39;,queue&amp;nbsp;&amp;lt;&amp;nbsp;type_name&amp;nbsp;&amp;gt;&amp;nbsp;queue_object_name;
template&amp;nbsp;&amp;lt;&amp;nbsp;class T&amp;nbsp;&amp;gt;class queue{
&amp;nbsp;&amp;nbsp;&amp;nbsp;struct node{ &amp;nbsp;&amp;nbsp; T data; &amp;nbsp;&amp;nbsp; struct node *next;&amp;nbsp;&amp;</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/1206504394311783049/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/10/queue-template.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1206504394311783049'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/1206504394311783049'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/10/queue-template.html' title='Queue Template'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-7463739094707668581</id><published>2010-09-19T23:34:00.000+05:30</published><updated>2010-09-19T23:34:35.445+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="Mingw"/><category scheme="http://www.blogger.com/atom/ns#" term="TurboC"/><category scheme="http://www.blogger.com/atom/ns#" term="Windows 7"/><title type='text'>Windows 7 and the Inevitble Headache of 32-bit C++</title><summary type="text">Windows 7 is here,
Windows 7 is the future,
Windows 7 doesnt support my C++!!!!!

TurboC is definitely functional but NOT COMPLETELY.&amp;nbsp;This is alarming, but most conventional compilors and IDE&#39;s that worked on the traditional 16-bit environment will not work anymore, atleast not properly. The more advanced the OS becomes, the more detached it becomes from its roots, or so is the trend these </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/7463739094707668581/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/09/windows-7-and-inevitble-headache-of-32.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7463739094707668581'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7463739094707668581'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/09/windows-7-and-inevitble-headache-of-32.html' title='Windows 7 and the Inevitble Headache of 32-bit C++'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-8158927173564436376</id><published>2010-08-26T21:29:00.000+05:30</published><updated>2010-08-26T21:29:47.324+05:30</updated><title type='text'>LinkLists in C++: Part 4</title><summary type="text">Fourth&amp;nbsp;in the series of Link-List funtions.
/***************************************************/#include&amp;lt; iostream.h &amp;gt;#include&amp;lt; conio.h &amp;gt;#include&amp;lt; stdlib.h &amp;gt;
struct node{ int info; node* next;}*start, *end, *t;
void reverse(){ int n; t = start; while(t != NULL) {  n++;  t = t-&amp;gt;next; } for(int i = 0;i &amp;lt;= n-3;i++) {  t = start;  while(t-&amp;gt;next-&amp;gt;next-&amp;gt;next != </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/8158927173564436376/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-in-c-part-4.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/8158927173564436376'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/8158927173564436376'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-in-c-part-4.html' title='LinkLists in C++: Part 4'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-3457577039001819806</id><published>2010-08-26T21:25:00.001+05:30</published><updated>2010-08-26T21:25:31.160+05:30</updated><title type='text'>LinkLists in C++: Part 3</title><summary type="text">Third&amp;nbsp;in the series of Link-List funtions.
/***************************************************/#include&amp;lt; iostream.h &amp;gt;#include&amp;lt; conio.h &amp;gt;#include&amp;lt; stdlib.h &amp;gt;
struct node{ int info; node* next;}*start, *end, *t;

void listnode(){ t = start; cout &amp;lt;&amp;lt;&quot;\nTHE CONTENTS ARE\n&quot;; while(t != NULL) {  cout &amp;lt;info &amp;lt;  t = t-&amp;gt;next; }}
void count(){ t = start; int ctr = 0; </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/3457577039001819806/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-part-3.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3457577039001819806'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/3457577039001819806'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-part-3.html' title='LinkLists in C++: Part 3'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-9015699643034165723</id><published>2010-08-26T21:19:00.002+05:30</published><updated>2010-08-26T21:25:44.604+05:30</updated><title type='text'>LinkLists in C++: Part 2</title><summary type="text">Second in the series of Link-List funtions.
/***************************************************/#include&amp;lt; iostream.h &amp;gt;#include&amp;lt; conio.h &amp;gt;#include&amp;lt; stdlib.h &amp;gt;
struct node{ int info; node* next;}*start, *end, *t;


void delnode(){ int ch; cout &amp;lt;&amp;lt;&quot;\n1.DELETE IN THE BEGINNING.&quot;; cout &amp;lt;&amp;lt;&quot;\n2.DELETE AT THE END.&quot;; cout &amp;lt;&amp;lt;&quot;\n3.DELETE IN THE MIDDLE.&quot;; cout &amp;lt;&amp;lt;&quot;\</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/9015699643034165723/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-part-2.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/9015699643034165723'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/9015699643034165723'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-part-2.html' title='LinkLists in C++: Part 2'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-7466930068572919774</id><published>2010-08-26T21:16:00.002+05:30</published><updated>2010-08-26T21:26:02.386+05:30</updated><title type='text'>LinkLists in C++: Part 1</title><summary type="text">

First in the series of Link-List funtions.
/***************************************************/#include&amp;lt; iostream.h &amp;gt;#include&amp;lt; conio.h &amp;gt;#include&amp;lt; stdlib.h &amp;gt;
struct node{ int info; node* next;}*start, *end, *t;
void addnode(){ int ch; if(start == NULL) {  start = new node;  if(start == NULL)  {   cout &amp;lt;&amp;lt;&quot;\nNOT ENOUGH MEMORY&quot;;   getch();   exit(0);  }  cout &amp;lt;&amp;lt;&quot;\</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/7466930068572919774/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-part-1.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7466930068572919774'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7466930068572919774'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/linklists-part-1.html' title='LinkLists in C++: Part 1'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-4069209992820349556</id><published>2010-08-22T19:45:00.000+05:30</published><updated>2010-08-22T19:45:34.444+05:30</updated><title type='text'>A Nifty Trick...</title><summary type="text">A trick is to make any PC shut down in a specified time with a horrifying message. No harm will be done&amp;nbsp;of course. We will just make a small executable of &quot;.exe&quot; format for our mischief.
The executable will work its magic only when clicked, so expect no &quot;virus-action&quot;, but it can be easily disguised as some other program.&amp;nbsp;
Here are the steps:
On your Desktop,&amp;nbsp;Right click-&amp;gt;New-&amp;</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/4069209992820349556/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/nifty-trick.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/4069209992820349556'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/4069209992820349556'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/nifty-trick.html' title='A Nifty Trick...'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjQeQV5CJ1dhU0FFwmI4YCtWoQJubnUpDtfkblJ5dH89Kia3wXh_sk39ZTwVmDyVM3baeLGHyffL33gHnS4n6KbjaFXBCRujJgHWpOsQPLXTNduYqUkY_Z_JTVENcztq-8GslzB-zsFltQn/s72-c/New+Bitmap+Image+(2).bmp" height="72" width="72"/><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-7179408719547465985</id><published>2010-08-13T23:30:00.000+05:30</published><updated>2010-08-13T23:30:52.381+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="Developer"/><category scheme="http://www.blogger.com/atom/ns#" term="Microsoft"/><category scheme="http://www.blogger.com/atom/ns#" term="Robotics"/><category scheme="http://www.blogger.com/atom/ns#" term="Studio"/><category scheme="http://www.blogger.com/atom/ns#" term="Visual Studio"/><category scheme="http://www.blogger.com/atom/ns#" term="VPL"/><title type='text'>Microsoft Robotics Developer Studio</title><summary type="text">Robotics Developer Studio, or RDS, is an environment made by Microsoft to develop and test projects on robotics. This is a major step by Microsoft indeed, to promote hobbyists as well as professional developers. Using this Windows-based suite, not only can we write code for a robot, but simulate a virtual prototype in a real world scenario using the state-of-the-art simulation engine. Whats looks</summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/7179408719547465985/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/microsoft-robotics-developer-studio.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7179408719547465985'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7179408719547465985'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/microsoft-robotics-developer-studio.html' title='Microsoft Robotics Developer Studio'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEja8Ql6cOcu_sg7NBLTPs0e9AScFrhlPlTkbs4DqPAVfGm6ESKFnPtSfS0w-DRY1xgrWXVc8WLqTKbCC0vAx9dar608XOnRYRNXWUGlOGac2RsUm_n6NcCo2ozxqI2ybfFwrmiIrqhVICFv/s72-c/robotics_developer_studio_2008.jpg" height="72" width="72"/><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-4219296328889071497.post-7770799746909589657</id><published>2010-08-11T23:21:00.000+05:30</published><updated>2010-08-11T23:28:32.199+05:30</updated><category scheme="http://www.blogger.com/atom/ns#" term="C\C++"/><category scheme="http://www.blogger.com/atom/ns#" term="Casts"/><category scheme="http://www.blogger.com/atom/ns#" term="code"/><category scheme="http://www.blogger.com/atom/ns#" term="Embedded C"/><category scheme="http://www.blogger.com/atom/ns#" term="Friend"/><category scheme="http://www.blogger.com/atom/ns#" term="Garbage"/><category scheme="http://www.blogger.com/atom/ns#" term="Graphics"/><category scheme="http://www.blogger.com/atom/ns#" term="Header"/><category scheme="http://www.blogger.com/atom/ns#" term="HLL"/><category scheme="http://www.blogger.com/atom/ns#" term="IDE"/><category scheme="http://www.blogger.com/atom/ns#" term="Interrupts"/><category scheme="http://www.blogger.com/atom/ns#" term="Library"/><category scheme="http://www.blogger.com/atom/ns#" term="Mutable"/><category scheme="http://www.blogger.com/atom/ns#" term="Templates"/><category scheme="http://www.blogger.com/atom/ns#" term="threads"/><category scheme="http://www.blogger.com/atom/ns#" term="Volatile"/><title type='text'>What your C\C++ teachers didnt teach you...or forgot!!!</title><summary type="text">Well their is no end to C\C++ and their never will be, simply because C++ can evolve to suit whats being demanded... Even this infinite syllabus has certain features that all of you should know. You might know most of this stuff but mind you many do not have that privilege.

Level - C++ is NOT a &quot;High Level Language&quot;, or atleast not a conventional HLL because of its heavy use of low level </summary><link rel='replies' type='application/atom+xml' href='http://apurvsaxena.blogspot.com/feeds/7770799746909589657/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/what-your-cc-teachers-didnt-teach-youor.html#comment-form' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7770799746909589657'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4219296328889071497/posts/default/7770799746909589657'/><link rel='alternate' type='text/html' href='http://apurvsaxena.blogspot.com/2010/08/what-your-cc-teachers-didnt-teach-youor.html' title='What your C\C++ teachers didnt teach you...or forgot!!!'/><author><name>Anonymous</name><uri>http://www.blogger.com/profile/10026943786094027513</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>2</thr:total></entry></feed>