<?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>IT&#38;C Solutions &#187; C++</title>
	<atom:link href="http://www.itcsolutions.eu/tag/c/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.itcsolutions.eu</link>
	<description>Solutions and tutorials for IT&#38;C development</description>
	<lastBuildDate>Wed, 23 Jun 2010 16:52:51 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>How to: Transform a Mathematical Expression from Infix Writing to Postfix Writing in C++</title>
		<link>http://www.itcsolutions.eu/2010/02/28/how-to-transform-a-mathematical-expressions-from-infix-writing-to-postfix-writing-in-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2010/02/28/how-to-transform-a-mathematical-expressions-from-infix-writing-to-postfix-writing-in-c-programming-language/#comments</comments>
		<pubDate>Sun, 28 Feb 2010 10:05:56 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Aplicatie]]></category>
		<category><![CDATA[Conversie]]></category>
		<category><![CDATA[Scriere infixata]]></category>
		<category><![CDATA[Scriere postfixata]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=1301</guid>
		<description><![CDATA[Postfix writing (Reverse Polish Form) was made by Polish mathematician Jan Łukasiewicz. Particularities of this form of writing mathematical expressions are presented in [...]. An algorithm for transforming a writing mathematical expressions from infix to postfix writing was developed by Edsger Dijkstra (Dijkstra Shunting Algorithm). Algorithm requires: Use a stack type structure [...] in which [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2010/02/28/how-to-transform-a-mathematical-expressions-from-infix-writing-to-postfix-writing-in-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>How to: Evaluate a Mathematical Expression in Postfix Writing in C++</title>
		<link>http://www.itcsolutions.eu/2010/02/28/evaluation-of-a-mathematical-expression-in-postfix-writing-in-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2010/02/28/evaluation-of-a-mathematical-expression-in-postfix-writing-in-c-programming-language/#comments</comments>
		<pubDate>Sun, 28 Feb 2010 09:03:53 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Cod sursa]]></category>
		<category><![CDATA[Evaluare]]></category>
		<category><![CDATA[Expresie]]></category>
		<category><![CDATA[Scriere postfixata]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=1285</guid>
		<description><![CDATA[Postfix writing [...] is a form of representation of mathematical expressions in which arithmetic operatorsare written specified by operands. Advantages of postfix writing over prefix and infix writing: Highlights clear policy of making operations; Brackets for forcing priority for implementing operators are not necessary; Evaluations are easily performed by computer. Algorithm for evaluation of an [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2010/02/28/evaluation-of-a-mathematical-expression-in-postfix-writing-in-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>How to: Implement Operations on Stack and Queue Data Structures in C++</title>
		<link>http://www.itcsolutions.eu/2009/12/16/how-to-implement-operations-on-stacka-and-queue-data-structures-in-c/</link>
		<comments>http://www.itcsolutions.eu/2009/12/16/how-to-implement-operations-on-stacka-and-queue-data-structures-in-c/#comments</comments>
		<pubDate>Wed, 16 Dec 2009 11:47:51 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Coada]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Stiva]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=987</guid>
		<description><![CDATA[Stack is a logical data structure, its implementation in physical memory being made by using other data structures. The components of the stack data structure have the same data type, which means that the stack is a homogeneous data structure. There are two basic operations with stack: adding and removal of an item. Manner of [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/12/16/how-to-implement-operations-on-stacka-and-queue-data-structures-in-c/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>How to: Create a DLL &#8211; Dynamic Link Library in C++ as Visual Studio 2008 Project</title>
		<link>http://www.itcsolutions.eu/2009/12/10/how-to-create-a-dll-dynamic-link-library-in-c-as-visual-studio-2008-project/</link>
		<comments>http://www.itcsolutions.eu/2009/12/10/how-to-create-a-dll-dynamic-link-library-in-c-as-visual-studio-2008-project/#comments</comments>
		<pubDate>Thu, 10 Dec 2009 14:11:53 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Aplicatie]]></category>
		<category><![CDATA[Cod sursa]]></category>
		<category><![CDATA[Creare]]></category>
		<category><![CDATA[DLL]]></category>
		<category><![CDATA[Fisier]]></category>
		<category><![CDATA[Library]]></category>
		<category><![CDATA[Limbaj de programare]]></category>
		<category><![CDATA[Reutilizare]]></category>
		<category><![CDATA[Visual Studio]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=956</guid>
		<description><![CDATA[Using DLL ensure productivity and/or financial gain in the software development process by reusing the source code written C++. Routines and/or programming components included in a DLL are referenced in the application without the need of their re-implementation in these applications. To build a DLL in C++ programming language as Visual Studio 2008 project, it [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/12/10/how-to-create-a-dll-dynamic-link-library-in-c-as-visual-studio-2008-project/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>How to: Optimize the Memory Space by Heap Memory Allocation in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/26/how-to-optimize-the-memory-space-by-heap-memory-allocation-in-c/</link>
		<comments>http://www.itcsolutions.eu/2009/11/26/how-to-optimize-the-memory-space-by-heap-memory-allocation-in-c/#comments</comments>
		<pubDate>Thu, 26 Nov 2009 14:02:55 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Alocare]]></category>
		<category><![CDATA[Cod sursa]]></category>
		<category><![CDATA[Heap]]></category>
		<category><![CDATA[Indicator]]></category>
		<category><![CDATA[Limbaj de programare]]></category>
		<category><![CDATA[Masiv]]></category>
		<category><![CDATA[Memorie]]></category>
		<category><![CDATA[Optimizare]]></category>
		<category><![CDATA[Pointer]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=915</guid>
		<description><![CDATA[Memory allocation at the applications run-time enables the use of a storage space, expressed in number of bytes, having the size of heap memory required for data storing defined by the variables. Compile-time allocation allows the reservation and use of storage space with predefined size expressed in number of bytes. In this situation, software developers [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/26/how-to-optimize-the-memory-space-by-heap-memory-allocation-in-c/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How to: Implement Arithmetic of Pointers in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/23/how-to-implement-arithmetic-of-pointers-in-c/</link>
		<comments>http://www.itcsolutions.eu/2009/11/23/how-to-implement-arithmetic-of-pointers-in-c/#comments</comments>
		<pubDate>Mon, 23 Nov 2009 11:41:40 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Adresa]]></category>
		<category><![CDATA[Aritmetica]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Limbaj de programare]]></category>
		<category><![CDATA[Memorie]]></category>
		<category><![CDATA[Operator]]></category>
		<category><![CDATA[Pointer]]></category>
		<category><![CDATA[Referire]]></category>
		<category><![CDATA[Variabila]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=889</guid>
		<description><![CDATA[In C++ programming language, memory areas can be accessed indirectly through pointer type variable [...]. Also, available with a memory address, it ensures movement on memory areas from the memory address stored in the variable pointer. This is ensured by arithmetic operators and it is called arithmetic of pointers. Depending on the nature of arithmetic [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/23/how-to-implement-arithmetic-of-pointers-in-c/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>How to: Apply the Arithmetic of Pointers and Access the Areas of Heap Memory in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/21/how-to-apply-the-pointers-arithmetic-and-access-the-areas-of-heap-memory-in-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2009/11/21/how-to-apply-the-pointers-arithmetic-and-access-the-areas-of-heap-memory-in-c-programming-language/#comments</comments>
		<pubDate>Sat, 21 Nov 2009 13:00:23 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Adresa]]></category>
		<category><![CDATA[Alocare]]></category>
		<category><![CDATA[Aritmetica]]></category>
		<category><![CDATA[Caracter]]></category>
		<category><![CDATA[Heap]]></category>
		<category><![CDATA[Limbaj de programare]]></category>
		<category><![CDATA[Masiv]]></category>
		<category><![CDATA[Memorie]]></category>
		<category><![CDATA[Pointer]]></category>
		<category><![CDATA[Visual Studio]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=854</guid>
		<description><![CDATA[Areas of heap memory are accessed via variables of pointer type [...]. This kind of variable manages values of memory address type. Arithmetic of pointers [...] involves the operators use to access the areas of heap memory. Allocating of heap memory areas is done by functions and/or operators implemented in programming language. In the below [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/21/how-to-apply-the-pointers-arithmetic-and-access-the-areas-of-heap-memory-in-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Conversia unei expresii matematice din scrierea infixata in scrierea postfixata in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/14/conversia-unei-expresii-matematice-din-scrierea-infixata-in-scrierea-postfixata-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/11/14/conversia-unei-expresii-matematice-din-scrierea-infixata-in-scrierea-postfixata-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Sat, 14 Nov 2009 09:35:22 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Aplicatie]]></category>
		<category><![CDATA[Conversie]]></category>
		<category><![CDATA[Scriere infixata]]></category>
		<category><![CDATA[Scriere postfixata]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=822</guid>
		<description><![CDATA[Scrierea postfixata (forma poloneza inversa) a fost realizata de matematicianul de origine poloneza Jan Lukasiewicz. Particularitati ale acestei forme de scriere a expresiilor matematice sunt prezentate la [...]. Un algoritm de transformare a unei expresii matematice din scrierea infixata in scrierea postfixata a fost elaborat de Edsger Dijkstra (Dijkstra Shunting Algorithm). Algoritmul presupune: Utilizarea unei [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/14/conversia-unei-expresii-matematice-din-scrierea-infixata-in-scrierea-postfixata-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>9</slash:comments>
		</item>
		<item>
		<title>Structurile de date Stiva si Coada in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/10/structurile-de-date-stiva-si-coada/</link>
		<comments>http://www.itcsolutions.eu/2009/11/10/structurile-de-date-stiva-si-coada/#comments</comments>
		<pubDate>Tue, 10 Nov 2009 08:51:28 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Coada]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Stiva]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=805</guid>
		<description><![CDATA[Stiva este o structura de date logica, implementarea sa din punct de vedere fizic fiind realizata prin utilizarea altor structuri de date. Elementele componente ale structurii de tip stiva sunt de acelasi tip, ceea ce inseamna ca stiva este o structura de date omogena. Exista doua operatii de baza cu structura de tip stiva: adaugarea [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/10/structurile-de-date-stiva-si-coada/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Evaluarea unei expresii matematice in scrierea postfixata in C++</title>
		<link>http://www.itcsolutions.eu/2009/11/10/evaluarea-unei-expresii-matematice-in-scrierea-postfixata-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/11/10/evaluarea-unei-expresii-matematice-in-scrierea-postfixata-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Tue, 10 Nov 2009 08:16:00 +0000</pubDate>
		<dc:creator>marius.popa</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Cod sursa]]></category>
		<category><![CDATA[Evaluare]]></category>
		<category><![CDATA[Expresie]]></category>
		<category><![CDATA[Scriere postfixata]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=795</guid>
		<description><![CDATA[Scrierea postfixata (forma poloneza inversa) [...] este o forma de reprezentare a unei expresii matematice aritmetice in care operatorii sunt scrisi, specificati dupa operanzi. Avantaje ale scrierii postfixate fata de scrierile prefixata si infixata: Evidentierea clara a ordinii de efectuare a operatiilor; Parantezele pentru fortarea prioritatii de aplicare a operatorilor nu mai sunt necesare; Evaluarile [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/10/evaluarea-unei-expresii-matematice-in-scrierea-postfixata-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
