Posts Tagged Date

How to: Implement Operations on Stack and Queue Data Structures in C++

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 implementation for operations is given by the discipline of access: LIFO – Last In First Out.
All adds (push) and extractions (pop) are achieved at the same end of the implementation structure, called the stack top.
Read the rest of this entry »

, , , ,

2 Comments

How to: Implement Arithmetic of Pointers in C++

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.
Read the rest of this entry »

, , , , , , , , ,

1 Comment

Structurile de date Stiva si Coada in C++

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 si extragerea unui element. Modalitatea de implementare a operatiilor este data de disciplina de acces: LIFO – Last In First Out. Toate inserarile (push) si extragerile (pop) sunt realizate la acelasi capat al structurii de implementare, denumit varful stivei.
Read the rest of this entry »

, , , ,

2 Comments

How to: Implement a Sparse Matrix Data Structure in C++ Using Simple Linked List

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 linked list type structure; it is defined as a pointer to the structure of the node in order to retain the address of the next node in the simply linked list.

Read the rest of this entry »

, , , ,

1 Comment

How to: Implement Sparse Matrix Data Structure in C++ Using Array

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 the processing capacity.
Read the rest of this entry »

, , , , ,

3 Comments

Implementarea structurii de date Matrice Rara in C++ utilizand lista simplu inlantuita

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 forma de pointer catre structura nodului pentru a retine adresa nodului care urmeaza in cadrul listei simple.

Read the rest of this entry »

, , , ,

2 Comments

Implementarea structurii de date Matrice Rara in C++ utilizand masive de date

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.
Read the rest of this entry »

, , , , ,

1 Comment

Implementarea aritmeticii de pointeri in C++

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 pointeri.

Read the rest of this entry »

, , , , , , , , ,

1 Comment

Definirea si utilizarea variabilelor de tip pointer in C++

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.

Read the rest of this entry »

, , , , , , , , ,

2 Comments

Crearea unei conexiuni ADO.NET si utilizarea DataSet in VB.NET

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 de programare bazat pe .NET Framework. Un exemplu in acest sens este ADO.NET (System.Data) care creeaza o conexiune la o sursa de date (baza de date).

Read the rest of this entry »

, , , , , , , , ,

No Comments