Posts Tagged C++

How to: Transform a Mathematical Expression from Infix Writing to Postfix Writing in C++

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

, , , ,

1 Comment

How to: Evaluate a Mathematical Expression in Postfix Writing in C++

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.

Read the rest of this entry »

, , , ,

1 Comment

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: Create a DLL – Dynamic Link Library in C++ as Visual Studio 2008 Project

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

, , , , , , , , ,

1 Comment

How to: Optimize the Memory Space by Heap Memory Allocation in C++

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 must anticipate the maximum size of memory space that can be used in the application.
Read the rest of this entry »

, , , , , , , , ,

No 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

How to: Apply the Arithmetic of Pointers and Access the Areas of Heap Memory in C++

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

, , , , , , , , , ,

No Comments

Conversia unei expresii matematice din scrierea infixata in scrierea postfixata in C++

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

, , , ,

9 Comments

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

Evaluarea unei expresii matematice in scrierea postfixata in C++

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 sunt usor de efectuat cu ajutorul calculatorului.

Read the rest of this entry »

, , , ,

1 Comment