<?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; Date</title>
	<atom:link href="http://www.itcsolutions.eu/tag/date/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.itcsolutions.eu</link>
	<description>Solutions and tutorials for IT&#38;C development</description>
	<lastBuildDate>Sun, 16 Oct 2011 21:22:35 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<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</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: 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</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>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</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>How to: Implement a Sparse Matrix Data Structure in C++ Using Simple Linked List</title>
		<link>http://www.itcsolutions.eu/2009/11/02/how-to-use-simply-linked-lists-for-implementing-the-sparse-matrix-data-structure-in-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2009/11/02/how-to-use-simply-linked-lists-for-implementing-the-sparse-matrix-data-structure-in-c-programming-language/#comments</comments>
		<pubDate>Mon, 02 Nov 2009 18:46:56 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Lista simpla]]></category>
		<category><![CDATA[Matrice rara]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=751</guid>
		<description><![CDATA[The storage structures for sparse matrixes are presented at [...]. The simply linked list is a linear data structure, formed by elements called nodes. A node is composed by two categories of fields: The field with the information necessary for processing; The field with the information for connecting with the successor node in the simply [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/02/how-to-use-simply-linked-lists-for-implementing-the-sparse-matrix-data-structure-in-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>How to: Implement Sparse Matrix Data Structure in C++ Using Array</title>
		<link>http://www.itcsolutions.eu/2009/11/02/how-to-implement-sparse-matrix-data-structure-in-the-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2009/11/02/how-to-implement-sparse-matrix-data-structure-in-the-c-programming-language/#comments</comments>
		<pubDate>Mon, 02 Nov 2009 17:08:40 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Implementare]]></category>
		<category><![CDATA[Limbaj de programare]]></category>
		<category><![CDATA[Matrice rara]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=733</guid>
		<description><![CDATA[The sparse matrix represents a special type of two-dimensional array consisting of a large number of elements from out of which a very high proportion is occupied by null elements. Thus, the classical declaration of a two-dimensional array in the C++ programming language leads to unnecessary use of memory by storing null values and of [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/02/how-to-implement-sparse-matrix-data-structure-in-the-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Implementarea structurii de date Matrice Rara in C++ utilizand lista simplu inlantuita</title>
		<link>http://www.itcsolutions.eu/2009/10/31/utilizarea-listelor-simple-pentru-implementarea-structurii-de-date-matrice-rara-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/10/31/utilizarea-listelor-simple-pentru-implementarea-structurii-de-date-matrice-rara-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Sat, 31 Oct 2009 10:56:53 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Lista simpla]]></category>
		<category><![CDATA[Matrice rara]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=718</guid>
		<description><![CDATA[Structurile de stocare a matricelor rare sunt prezentate la [...]. Lista simpla este o structura de date liniara, formata din elemente denumite noduri. Un nod este compus din doua categorii de campuri: Campul cu informatia necesara prelucrarii; Campul cu informatia de legatura cu nodul succesor in cadrul structurii de tip lista simpla; se defineste sub [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/10/31/utilizarea-listelor-simple-pentru-implementarea-structurii-de-date-matrice-rara-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Implementarea structurii de date Matrice Rara in C++ utilizand masive de date</title>
		<link>http://www.itcsolutions.eu/2009/10/30/implementarea-structurii-de-date-matrice-rara-in-limbajul-c/</link>
		<comments>http://www.itcsolutions.eu/2009/10/30/implementarea-structurii-de-date-matrice-rara-in-limbajul-c/#comments</comments>
		<pubDate>Fri, 30 Oct 2009 15:07:03 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Implementare]]></category>
		<category><![CDATA[Limbaj de programare]]></category>
		<category><![CDATA[Matrice rara]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=704</guid>
		<description><![CDATA[Matricea rara reprezinta in tip special de masiv dimensional format dintr-un numar foarte mare de elemente din care o pondere foarte mare o ocupa elementele nule. Astfel, declararea clasica a unui masiv bidimensional in limbajul C++ conduce la utilizarea inutila a memoriei prin stocarea valorilor nule si a capacitatii de procesare. Declararea unei structuri de [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/10/30/implementarea-structurii-de-date-matrice-rara-in-limbajul-c/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Implementarea aritmeticii de pointeri in C++</title>
		<link>http://www.itcsolutions.eu/2009/10/13/implementarea-aritmeticii-de-pointeri-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/10/13/implementarea-aritmeticii-de-pointeri-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Tue, 13 Oct 2009 10:14:29 +0000</pubDate>
		<dc:creator>Marius</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=576</guid>
		<description><![CDATA[In limbajul de programare C++, zonele de memorie pot fi accesate indirect prin variabile de tip pointer [...]. De asemenea, avand la dispozitie o adresa de memorie, se asigura deplasarea pe zona de memorie pornind de la adresa stocata in variabila pointer. Acest lucru se asigura prin operatori aritmetici si poarta denumirea de aritmetica de [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/10/13/implementarea-aritmeticii-de-pointeri-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Definirea si utilizarea variabilelor de tip pointer in C++</title>
		<link>http://www.itcsolutions.eu/2009/10/13/definirea-si-utilizarea-variabilelor-de-tip-pointer-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/10/13/definirea-si-utilizarea-variabilelor-de-tip-pointer-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Tue, 13 Oct 2009 09:01:44 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Adresa]]></category>
		<category><![CDATA[Cod sursa]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Definire]]></category>
		<category><![CDATA[Heap]]></category>
		<category><![CDATA[Memorie]]></category>
		<category><![CDATA[Operator]]></category>
		<category><![CDATA[Pointer]]></category>
		<category><![CDATA[Variabila]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=563</guid>
		<description><![CDATA[Variabilele de tip pointer permit accesarea de zone de memorie cu continut numeric pentru gestionarea valorilor ce reprezinta adrese de memorie. Dimensiunea unei variabile pointer depinde de arhitectura procesorului. In limbajul de programare C++, sablonul de definire a unei variabile pointer este: TipData *Den_VarPointer; Exemple: int *pi;//pointer la tipul int char **ppc;//pointer la tipul char* [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/10/13/definirea-si-utilizarea-variabilelor-de-tip-pointer-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Crearea unei conexiuni ADO.NET si utilizarea DataSet in VB.NET</title>
		<link>http://www.itcsolutions.eu/2009/07/10/crearea-unei-conexiuni-adonet-si-utilizarea-dataset-in-vbnet/</link>
		<comments>http://www.itcsolutions.eu/2009/07/10/crearea-unei-conexiuni-adonet-si-utilizarea-dataset-in-vbnet/#comments</comments>
		<pubDate>Fri, 10 Jul 2009 14:01:48 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[VB.NET]]></category>
		<category><![CDATA[Baza de date]]></category>
		<category><![CDATA[Conexiune]]></category>
		<category><![CDATA[Creare]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Design View]]></category>
		<category><![CDATA[Executie]]></category>
		<category><![CDATA[Obiect]]></category>
		<category><![CDATA[Relatie]]></category>
		<category><![CDATA[Tabel]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=455</guid>
		<description><![CDATA[Databinding reprezinta caracteristica a controalelor de interfata VB.NET de extragere si afisare a datelor dintr-o sursa de date (baza de date) intr-un mod transparent pentru utilizator. Fiecare control de interfata legat de o sursa de date poseda propriile proprietati. Legarea controalelor de interfata cu surse de date se realizeaza prin clase suport definite in mediul [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/07/10/crearea-unei-conexiuni-adonet-si-utilizarea-dataset-in-vbnet/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

