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. Algorithm for evaluation of an expression […]

Read More →
C and C++ library of functions and procedures for matrix (bidimensional arrays) processing – Introduction

Library source: C and C++ library of functions and procedures for matrix processing Language: C / C++Date: 04.2002Authors: Catalin Boja si Niculescu SilviuLicense: Creative Commons Attribution 3.0 License This post main objective is to tackle a series of aspects regarding the creation of a library that contains functions necessary in resolving the problems with matrices. […]

Read More →
How to create a simple motion animation in Flash CS3

This  Flash CS3 tutorial shows how to create a Flash animation using Adobe Flash CS3 (for Flash CS4 see the next post, because there are some differences on the application interface).In this example we will create an animation based on Flash motion tweens that will move an object on the screen on a linear trajectory. […]

Read More →
Adobe Flash CS3 and CS4 interface, basic commands and concepts

This post analyzes the interface of the two versions of Adobe Flash CS3 and CS4 because the number of similarities is too great to take them separately. Also, the examples and tutorials from this site, use most of the basic features that are found in both versions. The differences will be highlighted and described for […]

Read More →
How to read application settings from the Web.config file of an ASP.NET Website

There are many situations, in the development of an ASP.NET application, when particular values must be made visible from different Web Forms or code routines. These values can represent: –    global values or keys associated with an application setting;–    connections strings for databases–    passwords and hash values–    URLs for Web Services The web.config file is […]

Read More →
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 […]

Read More →
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. To build a DLL in C++ programming language as Visual Studio 2008 project, it […]

Read More →
Animated Gif
How to create an animated GIF in Photoshop CS3 or CS4

The Graphics Interchange Format (GIF) is a digital image format used to store bitmaps. Since it was introduced in 1987, it has been largely used on World Wide Web to allow websites to include images in their pages. It is an efficient format because:•    is limited to 8-bit indexed color•    it has a good compression […]

Read More →
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 […]

Read More →
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. Depending on the nature of arithmetic […]

Read More →
How to: Define and Use the Pointers Variables in C++

The pointer type variables allow the accessing of memory areas with numerical content for the management of the values which represent memory addresses. The dimension of a pointer variable depends on the processor architecture.In the C++ programming language, the definition template of a pointer variable is:

Read More →
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 […]

Read More →
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 […]

Read More →
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. Declararea unei structuri de […]

Read More →